Algorithmic Advances Towards a Realizable Quantum Lattice Boltzmann Method

• URL: http://arxiv.org/abs/2504.10870v1
• Date: Tue, 15 Apr 2025 05:02:41 GMT
• Title: Algorithmic Advances Towards a Realizable Quantum Lattice Boltzmann Method
• Authors: Apurva Tiwari, Jason Iaconis, Jezer Jojo, Sayonee Ray, Martin Roetteler, Chris Hill, Jay Pathak,
• Abstract summary: 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.
• Score: 2.7192829556657774
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: The Quantum Lattice Boltzmann Method (QLBM) is one of the most promising approaches for realizing the potential of quantum computing in simulating computational fluid dynamics. Many recent works mostly focus on classical simulation, and rely on full state tomography. Several key algorithmic issues like observable readout, data encoding, and impractical circuit depth remain unsolved. As a result, these are not directly realizable on any quantum hardware. We present a series of novel algorithmic advances which allow us to implement the QLBM algorithm, for the first time, on a quantum computer. Hardware results for the time evolution of a 2D Gaussian initial density distribution subject to a uniform advection-diffusion field are presented. Furthermore, 3D simulation results are presented for particular non-uniform advection fields, devised so as to avoid the problem of diminishing probability of success due to repeated post-selection operations required for multiple timesteps. We demonstrate the evolution of an initial quantum state governed by the advection-diffusion equation, accounting for the iterative nature of the explicit QLBM algorithm. A tensor network encoding scheme is used to represent the initial condition supplied to the advection-diffusion equation, significantly reducing the two-qubit gate count affording a shorter circuit depth. Further reductions are made in the collision and streaming operators. Collectively, these advances give a path to realizing more practical, 2D and 3D QLBM applications with non-trivial velocity fields on quantum hardware.

Related papers

• Practical Application of the Quantum Carleman Lattice Boltzmann Method in Industrial CFD Simulations [44.99833362998488]
  This work presents a practical numerical assessment of a hybrid quantum-classical approach to CFD based on the Lattice Boltzmann Method (LBM) We evaluate this method on three benchmark cases featuring different boundary conditions, periodic, bounceback, and moving wall. Our results confirm the validity of the approach, achieving median error fidelities on the order of $10-3$ and success probabilities sufficient for practical quantum state sampling.
  arXiv  Detail & Related papers  (2025-04-17T15:41:48Z)
• Quantum Dynamics Simulation of the Advection-Diffusion Equation [9.343244024936194]
  The advection-diffusion equation is simulated on a superconducting quantum computer via several quantum algorithms.<n>Three formulations are considered: Trotterization, (2) variational quantum time evolution (VarQTE), and (3) adaptive variational quantum dynamics simulation (AVQDS)
  arXiv  Detail & Related papers  (2025-03-17T21:31:34Z)
• Quantum smoothed particle hydrodynamics algorithm inspired by quantum walks [0.0]
  We propose a quantum algorithm for the time-dependent smoothed particle hydrodynamics (SPH) method.<n>Our algorithm uses concepts from discrete-time quantum walks to solve the one-dimensional advection partial differential equation.<n>We construct a quantum circuit to carry out the calculations for a two-particle system over one, two and three timesteps.
  arXiv  Detail & Related papers  (2025-03-07T13:09:33Z)
• Eigenstate Preparation on Quantum Computers [0.0]
  This thesis investigates algorithms for eigenstate preparation using near-term quantum computing devices. We establish three methods in detail: quantum adiabatic evolution with optimal control, the Rodeo Algorithm, and the Variational Rodeo Algorithm. We show results suggesting that this method can be effective in preparing eigenstates, but its practicality is predicated on the preparation of an initial state that has significant overlap with the desired eigenstate.
  arXiv  Detail & Related papers  (2024-12-19T17:28:21Z)
• A probabilistic imaginary-time evolution quantum algorithm for advection-diffusion equation: Explicit gate-level implementation and comparisons to quantum linear system algorithms [0.0]
  We propose a quantum algorithm for solving the advection-diffusion-reaction equation. Our algorithm achieves an exponential speedup regarding the matrix size at the cost of a worse dependence on the error bound.
  arXiv  Detail & Related papers  (2024-09-27T08:56:21Z)
• 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 algorithms for grid-based variational time evolution [36.136619420474766]
  We propose a variational quantum algorithm for performing quantum dynamics in first quantization. Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
  arXiv  Detail & Related papers  (2022-03-04T19:00:45Z)
• Preparing thermal states on noiseless and noisy programmable quantum processors [0.0]
  We provide two quantum algorithms with provable guarantees to prepare thermal states on near-term quantum computers. The first algorithm is inspired by the natural thermalization process where the ancilla qubits act as the infinite thermal bath. The second algorithm works for any system and in general runs in exponential time.
  arXiv  Detail & Related papers  (2021-12-29T18:06:36Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
  Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task. Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate. The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
  arXiv  Detail & Related papers  (2021-06-06T13:15:25Z)
• Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
  We study two different methods to prepare excited states on a quantum computer. We benchmark these techniques on emulated and real quantum devices. These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
  arXiv  Detail & Related papers  (2020-09-28T17:21:25Z)

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.