We present a mass-weighted meshless formulation for the shifted incompressible lattice Boltzmann method (LBM) whose streaming step is exactly unitary, combining with the Carleman embedding. In traditional meshless LBM, on a scattered node set the semi-Lagrangian streaming step is an interpolation, which is not unitary; a generic block encoding of this matrix therefore requires a normalization proportional to its sparsity and logarithmically many ancillas. To overcome the non-unitarity, we instead express the interpolation as the exponential exp(a Dx + b Dy) of mimetic derivative operators. Endowing each node with its Voronoi mass and applying a mass-weighted similarity transform renders these derivative operators skew-Hermitian by enforcing moment constraints together with low-wave number trigonometric differentiation conditions, so that the interpolation becomes exactly unitary. Such unitarization of interpolation leave the local collision step unchanged up to a rescaling of its quadratic term, where the same weights define the amplitude encoding of the distribution functions. For quasi-uniform node sets, the mass-weighting diagonal remains within a unit-order normalization that degrades only mildly as the Carleman truncation order grows, thereby mitigating the cost of block encoding. Numerical experiments on the Taylor Green vortex confirm that the method reproduces the full meshless LBM, with the velocity error decreasing as the Carleman order increases.
We present a mass-weighted meshless formulation for the shifted incompressible lattice Boltzmann method (LBM) whose streaming step is exactly unitary, combining with the Carleman embedding. In traditional meshless LBM, on a scattered node set the semi-Lagrangian streaming step is an interpolation, which is not unitary; a generic block encoding of this matrix therefore requires a normalization proportional to its sparsity and logarithmically many ancillas. To overcome the non-unitarity, we instead express the interpolation as the exponential exp(a Dx + b Dy) of mimetic derivative operators. Endowing each node with its Voronoi mass and applying a mass-weighted similarity transform renders these derivative operators skew-Hermitian by enforcing moment constraints together with low-wave number trigonometric differentiation conditions, so that the interpolation becomes exactly unitary. Such unitarization of interpolation leave the local collision step unchanged up to a rescaling of its quadratic term, where the same weights define the amplitude encoding of the distribution functions. For quasi-uniform node sets, the mass-weighting diagonal remains within a unit-order normalization that degrades only mildly as the Carleman truncation order grows, thereby mitigating the cost of block encoding. Numerical experiments on the Taylor Green vortex confirm that the method reproduces the full meshless LBM, with the velocity error decreasing as the Carleman order increases.
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.
In this work, an interpolation-supplemented quantum lattice Boltzmann method (IS-QLBM) is proposed to simulate incompressible flows with nonuniform meshes and curved boundaries. Owing to the constraint of lattice uniformity, existing quantum LBMs are restricted to uniform square meshes and regular geometries, which severely limit their practicality. To address this limitation, we introduce an interpolation strategy to reconstruct the distribution functions f at each mesh point from those at neighboring points, thereby formulating the entire streaming step into the form of A·f. The matrix A is then decomposed into unitary matrices via singular value decomposition (SVD) for quantum circuit implementation. Since A depends solely on the mesh point coordinates, IS-QLBM can be applied to arbitrary meshes and geometries. The proposed method is validated using two-dimensional incompressible isothermal and thermal flows. The results show that IS-QLBM agrees very well with its classical counterpart IS-LBM, and that quadratic or higher-order interpolation is recommended to ensure sufficient accuracy. To further improve computational efficiency, we develop a multi-circuit IS-QLBM framework that reduces computational cost to less than one-eighth of the single-circuit implementation without sacrificing accuracy.
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.
The Lattice Boltzmann method (LBM) is a well-established mesoscopic approach for simulating fluid dynamics by evolving particle distribution functions on discrete lattices. While the LBM is highly parallelizable on classical hardware, its translation to quantum algorithms is impeded by the collision process, which is intrinsically nonlinear and irreversible. Several existing quantum formulations implement this process through repeated quantum tomography and state preparation at every timestep, leading to significant overheads. We introduce a quantum LBM based on a denoising-type collision operator that avoids tomography-based updates. The collision dynamics are reformulated as an orthogonal projection onto the linearized manifold of equilibrium distributions around a reference state. This geometric approach filters non-equilibrium components while preserving lattice symmetries and approximating nonlinear terms needed to recover hydrodynamic behavior. A complete pipeline is presented with efficient gate-level realizations, incorporating encoding of distributions, collision, streaming, boundary conditions, and measurement of physical quantities such as hydrodynamic forces. In addition, we outline an approach for implementing projector-based operators deterministically without postselection, paving the way to fully coherent multi-timestep LBM simulations. Numerical experiments for advection-diffusion and flow problems demonstrate that the method reproduces macroscopic behaviors with high accuracy, with performance depending on the choice of reference state.
In this work, a quantum Taylor series expansion and Least squares-based Fractional-step Lattice Boltzmann Method (TLFS-LBM) is proposed to simulate incompressible flows on non-uniform meshes. Most existing quantum LBMs face two critical challenges: with the relaxation time τ fixed at 1, a fixed mesh resolution corresponds to only a single Reynolds number, and the streaming step, typically implemented through the quantum walk method, is limited to uniform meshes. To address these issues, we retain τ = 1 and decompose the quantum TLFS-LBM into predictor and corrector steps using a fractional-step method. The predictor step is implemented on a quantum circuit, but the resulting viscosity generally differs from the physical viscosity. A diffusion equation is therefore solved classically in the corrector step to restore the correct physical viscosity. Moreover, the streaming step is expressed in the form of A · f eq using Taylor series expansion and least-squares approximation, with singular value decomposition applied to factorize matrix A into unitary matrices for quantum implementation. Since A depends solely on mesh point coordinates, the proposed method is applicable to arbitrary mesh types. Validation through two-dimensional incompressible isothermal and thermal flow simulations confirms that the quantum TLFS-LBM achieves accuracy comparable to its classical counterpart, while extending the applicability of quantum LBM to non-uniform meshes and curved boundaries.
Nonlinear ordinary and partial differential equations are ubiquitous in science and engineering, yet finding their solutions is often computationally intractable for classical hardware. To determine if quantum computers can offer a practical advantage, one critical challenge that must be solved is determining how to efficiently load exponentially sized matrices onto quantum hardware. In this article, we introduce an alternative linear combination of unitaries (LCU) strategy which relies on an intermediate linear combination of non-unitaries (LCNU) and a systematic embedding procedure. One advantage of this LCU strategy is that it maintains the exact number of terms as in the LCNU. Therefore, this approach offers a data loading framework for matrices that lack an efficient decomposition using the standard LCU alone. Using this approach, we construct a generalized LCNU framework for any Carleman linearized autonomous dynamical system having a polynomial nonlinearity. To demonstrate the effectiveness of our approach, we construct an LCNU for the 3D Carleman linearized lattice Boltzmann equation (LBE). Here, we find that the number of terms in the decomposition scales like Ns∼O(α2Q2), where α is the Carleman truncation order and Q is the number of discrete velocities. Importantly, Ns is independent of the number of spatial and temporal discretization points. We then perform a resource estimation of our LCNU's T gate cost when combined with the (1) PREP and SELECT block encoding oracles, and (2) variational quantum linear solver. In the former, the T cost scales like O(α3Q2(log2n)2), where n is the total number of spatial grid points. The latter requires exactly Ns2(log2(2ntnα)+1) circuits per iteration for nt time steps, with a worst case T gate cost of O(α(log2Qn)2) among them.