Improved Quantum Lattice Boltzmann Method for Advection-Diffusion Equations with a Linear Collision Model

• URL: http://arxiv.org/abs/2505.01271v1
• Date: Fri, 18 Apr 2025 02:42:31 GMT
• Title: Improved Quantum Lattice Boltzmann Method for Advection-Diffusion Equations with a Linear Collision Model
• Authors: Li Xu, Ming Li, Lei Zhang, Hai Sun, Jun Yao,
• Abstract summary: We propose an ancilla free quantum lattice Boltzmann method for advection-diffusion equations.<n>There is no need to perform quantum state tomography in each previous loop, if the macroscopic variables for a certain loop are needed.<n>The numerical simulations of the $DQ_3$ and $DQ_5$ models have confirmed the feasibility of the proposed algorithm.
• Score: 16.868124747083375
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum computing has made tremendous progress in recent years, providing potentialities for breaking the bottleneck of computing power in the field of scientific computing, like computational fluid dynamics. To reduce computational costs and achieve an acceleration, we propose an ancilla free quantum lattice Boltzmann method for advection-diffusion equations that fully leverages the parallelism of quantum computing. More significantly, there is no need to perform quantum state tomography in each previous loop, if the macroscopic variables for a certain loop is needed. The non-unitary collision operators are replaced by the unique local unitary operations, and the removal of ancilla qubit greatly diminishes the complexity of the quantum circuit. The numerical simulations of the $D_1Q_3$ and $D_2Q_5$ models have confirmed the feasibility of the proposed algorithm.

Related papers

• Algorithmic Advances Towards a Realizable Quantum Lattice Boltzmann Method [2.7192829556657774]
  The Quantum Lattice Boltzmann Method (QLBM) is one of the most promising approaches for realizing the potential of quantum computing.<n>We present a series of novel algorithmic advances which allow us to implement the QLBM algorithm, for the first time, on a quantum computer.
  arXiv  Detail & Related papers  (2025-04-15T05:02:41Z)
• Quantum simulation of Burgers turbulence: Nonlinear transformation and direct evaluation of statistical quantities [0.0]
  It is still challenging to solve nonlinear equations in fluid dynamics, such as the Burgers equation, using quantum computers.<n>We propose a novel quantum algorithm to solve the Burgers equation.
  arXiv  Detail & Related papers  (2024-12-23T01:17:26Z)
• Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions [39.58317527488534]
  We propose a variational strategy based on symmetry-preserving cost functions to iteratively construct a reduced subspace for extraction of low-lying energy states.<n>As a proof of concept, we test the proposed algorithms on H4 chain and ring, targeting both the ground-state energy and the charge gap.
  arXiv  Detail & Related papers  (2024-11-25T20:33:47Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Evaluation of phase shifts for non-relativistic elastic scattering using quantum computers [39.58317527488534]
  This work reports the development of an algorithm that makes it possible to obtain phase shifts for generic non-relativistic elastic scattering processes on a quantum computer.
  arXiv  Detail & Related papers  (2024-07-04T21:11:05Z)
• A multiple-circuit approach to quantum resource reduction with application to the quantum lattice Boltzmann method [39.671915199737846]
  We introduce a multiple-circuit algorithm for a quantum lattice Boltzmann method (QLBM) solve of the incompressible Navier--Stokes equations.<n>The presented method is validated and demonstrated for 2D lid-driven cavity flow.
  arXiv  Detail & Related papers  (2024-01-20T15:32:01Z)
• Quantum computing of reacting flows via Hamiltonian simulation [13.377719901871027]
  We develop the quantum spectral and finite difference methods for simulating reacting flows in periodic and general conditions. The present quantum computing algorithms offer a one-shot'' solution for a given time without temporal discretization.
  arXiv  Detail & Related papers  (2023-12-13T04:31:49Z)
• A hybrid quantum-classical algorithm for multichannel quantum scattering of atoms and molecules [62.997667081978825]
  We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions. The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix. We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
  arXiv  Detail & Related papers  (2023-04-12T18:10:47Z)
• Pricing multi-asset derivatives by variational quantum algorithms [0.6181093777643575]
  We use variational quantum simulation to solve the Black-Scholes equation and compute the derivative price from the inner product between the solution and a probability distribution. This avoids the measurement bottleneck of the naive approach and would provide quantum speedup even in noisy quantum computers.
  arXiv  Detail & Related papers  (2022-07-04T09:11:15Z)
• Commutation simulator for open quantum dynamics [0.0]
  We propose an innovative method to investigate directly the properties of a time-dependent density operator $hatrho(t)$. We can directly compute the expectation value of the commutation relation and thus of the rate of change of $hatrho(t)$. A simple but important example is demonstrated in the single-qubit case and we discuss extension of the method for practical quantum simulation with many qubits.
  arXiv  Detail & Related papers  (2022-06-01T16:03:43Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.