Quantum Lattice Boltzmann Method for Multiple Time Steps Without Reinitialization for Linear Advection-Diffusion Problems
Aaron Nagel, Johannes Löwe
TL;DR
This work presents a fully quantum extension of the Quantum Lattice Boltzmann Method (QLBM) that enables multiple time steps of linear advection-diffusion simulations without any mid-circuit measurements or state reinitialization. The authors implement a unitary collision via tailored rotations, conditioned streaming, and a re-prep mechanism that uses time qubits to cyclically prepare the state for successive steps, with a decay model that quantifies amplitude loss per step. Verified on 1D (D1Q2, D1Q3) and 2D (D2Q9) advection-diffusion problems against classical LBM, the approach shows good agreement and convergence, while highlighting sampling-noise and the need for increased shots for longer runs. The method offers a pathway to extract surface or scalar quantities without reconstructing the full flow field, potentially improving scalability for large grids, though it trades off with increased circuit depth and coherence-time demands; future work targets amplitude amplification and nonlinear extensions.
Abstract
To simulate highly-resolved flow fields, we extend the Quantum Lattice Boltzmann Method (QLBM) to be able to simulate multiple time steps without state extraction or reinitialization. We adjust and extend given QLBM approaches from the literature to completely remove the need to measure or reinitialize the flow field in between the simulation time steps. Therefore, our algorithm does not require to sample the entire flow field at any time. We solve the linear advection-diffusion problem and derive all necessary equations and build the corresponding quantum circuit diagrams, including details on the QLBM blocks and explicitly drawing the circuit gates. We discuss the general decay of a QLBM step and how that effects our algorithm. The new algorithm is verified on 1D and 2D test cases using the shot method of IBMs Qiskit package. We show excellent agreement and convergence between our QLBM and classical LBM methods. The conclusion section includes a discussion on the advantages of our algorithm as well as limitations and to what extent it is more efficient.
