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 with periodic boundary conditions 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 the classical Lattice Boltzmann method. The conclusion section includes a discussion on the advantages of our algorithm as well as limitations and to what extent it is more efficient.
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 with periodic boundary conditions 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 the classical Lattice Boltzmann method. The conclusion section includes a discussion on the advantages of our algorithm as well as limitations and to what extent it is more efficient.
The computational power to resolve large complex aerospace flow problems has increased over the past decades but is still yet not able to simulate these problems sufficiently accurate to a scale resolved level. At the same time, the interest in quantum computing has recently increased rapidly due to the massive improvements of the quantum computer hardware technology. Many fields of research explore the possible advantages that quantum computing can offer in their respective fields. For fluid flow problems, the exponentially increasing storage capacity of flow properties by quantum amplitude encoding offers an approach to efficiently deal with highly resolved flow fields. Within the DLR-QCI project ToQuaFlics, we adjust and extend the quantum lattice Boltzmann method (QLBM) from the literature for single time steps and present our extension to multiple time steps. The structure of our algorithm is shown in Fig. 1. Our extended QLBM can perform all time steps of a simulation without having to extract the quantum state or parts of it at any time. Therefore, with our algorithm there is no need to measure any qubit during or at the end of the simulation. This saves the computationally expensive read out and reinitialization after every time step and enables an efficient time stepping scheme. We verify our algorithm on 1D and 2D test cases simulating a linear advection-diffusion process with periodic boundary conditions. The algorithm is simulated using the IBM simulator package Qiskit with the shot method. For verification reasons, we measure the entire flow field at the end of the simulation to demonstrate the agreement with the reference solution given by the classic lattice Boltzmann solution. The results show excellent agreement and arbitrary convergence towards the reference. We further discuss the inherent amplitude decay of a QLBM time step and how that effects our solution in terms of signal loss of the quantum state. An outlook to include a body with a surface interaction model and to capture nonlinearities is given and briefly sketched.
We present a versatile and efficient quantum algorithm based on the Lattice Boltzmann method (LBM) approximate solution of the linear advection-diffusion equation (ADE). We emphasize that the LBM approximation modifies the diffusion term of the underlying exact ADE and leads to a modified equation (mADE). Due to its versatility in terms of operator splitting, the proposed quantum LBM algorithm for the mADE provides a building block for future quantum algorithms to solve the linearized Navier-Stokes equation on quantum computers. We split the algorithm into four operations: initialization, collision, streaming, and calculation of the macroscopic quantities. We propose general quantum building blocks for each operator, which adapt intrinsically from the general three-dimensional case to smaller dimensions and apply to arbitrary lattice-velocity sets. Based on (sub-linear) amplitude data encoding, we propose improved initialization and collision operations with reduced complexity and efficient sampling-based simulation. Quantum streaming algorithms are based on previous developments. The proposed quantum algorithm allows for the computation of successive time steps, requiring full state measurement and reinitialization after every time step. It is validated by comparison with a digital implementation and based on analytical solutions in one and two dimensions. Furthermore, we demonstrate the versatility of the quantum algorithm for two cases with non-uniform advection velocities in two and three dimensions. Various velocity sets are considered to further highlight the flexibility of the algorithm. We benchmark our optimized quantum algorithm against previous methods employed in sampling-based quantum simulators. We demonstrate sampling efficiency, with sampling accelerated convergence requiring fewer shots. • Novel LBM quantum algorithm for solving the linear advection-diffusion equation with variable velocity as a building block. • Modular quantum algorithm for 1 through 3 spatial dimensions and all common lattice-velocity sets. • Significant reduction in quantum-algorithm complexity achieved through efficient encoding strategy leveraging symmetries. • Improved collision quantum-algorithm building block leading to higher success rates for the collision operator. • Benchmarking shows faster convergence and reduced shot requirements compared to previous algorithms.
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.
This article introduces a novel framework for developing quantum algorithms for the Lattice Boltzmann Method (LBM) applied to the advection-diffusion equation. We formulate the collision-streaming evolution of the LBM as a compact time-marching scheme and rigorously establish its stability under low Mach number conditions. This unified formulation eliminates the need for classical measurement at each time step, enabling a systematic and fully quantum implementation. Building upon this representation, we investigate two distinct quantum algorithmic approaches. The first is a time-marching quantum algorithm realized through sequential evolution operators, for which we provide a detailed implementation-including block-encoding and dilating unitarization-along with a full complexity analysis. The second employs a quantum linear systems algorithm, which encodes the entire time evolution into a single global linear system. We demonstrate that both methods achieve comparable asymptotic time complexities. The proposed algorithms are validated through numerical simulations of benchmark problems in one and two dimensions. This work provides a systematic pathway that avoids full-state measurement and reinitialization at every time step for the quantum simulation of advection-diffusion processes via the lattice Boltzmann paradigm.
Classical computational fluid dynamics (CFD) methods encounter significant computational bottlenecks in large systems and at high Reynolds number flows due to the rapid increase in degrees of freedom, even on flagship supercomputers. As quantum computers emerge, the Quantum Lattice Boltzmann Method (QLBM) has been proposed as a quantum-native alternative for solving fluid dynamics problems. However, until recently, nearly all studies have relied on classical quantum simulators rather than real quantum hardware. This study presents a benchmark of a one-dimensional QLBM implementation executed on three different IBM Quantum hardware. We design and test a quantum circuit for the advection-diffusion equation using amplitude encoding, a Bhatnagar-Gross-Krook (BGK)-type collision operator, and a streaming step with periodic boundary conditions. Our numerical experiments evaluate transpiled two-qubit gate count, total circuit depth, runtime, and accuracy metrics including maximum absolute error (L∞ norm) and root-mean-square error (RMSE). We find that the present collision and streaming operators dominate the overall cost and become the primary scalability bottleneck on current hardware. To mitigate the prohibitive cost of full quantum state tomography on hardware-based benchmarking exercises, we introduce a sampler-based measurement strategy that reconstructs macroscopic density fields directly from computational-basis measurements. This approach substantially reduces measurement overhead while preserving the expected advection-diffusion dynamics on hardware. These results provide a quantitative assessment of QLBM performance in the noisy intermediate-scale quantum (NISQ) regime and identify the principal algorithmic and experimental limitations that must be addressed for QLBM to become viable for fluid dynamics.
Quantum computing offers a promising pathway to accelerate fluid dynamics simulations. In this work, we propose a hybrid quantum-classical lattice Boltzmann method (LBM) for solving the advection–diffusion equation, as a step toward an efficient and general quantum linear solver framework for fluid flows. Quantum circuits handle the computationally intensive collision and streaming steps, exploiting quantum parallelism and removing parameter constraints, while boundary corrections are managed classically to avoid unnecessary overhead. Various boundary conditions are incorporated within the quantum framework, enhancing the flexibility and applicability of the method. Numerical experiments with Gaussian hill initial conditions under periodic boundaries and zero initial conditions under mixed Dirichlet–Neumann boundaries, each in one and two dimensions, demonstrate the precision of the proposed approach. The computational complexity is analyzed in detail. The collision and streaming steps achieve a lower complexity than their classical LBM counterparts, although overall performance is still limited by the input and output costs. This work represents a critical step toward the practical quantum simulation of complex fluid flows.