Fluid simulations, especially at high Reynolds numbers, are computationally expensive on classical computers, making them promising application targets for quantum computing. Recent studies have combined the lattice Boltzmann method (LBM) with Carleman linearization to design quantum algorithms for computational fluid dynamics (CFD). However, practical quantum-circuit implementations of these algorithms that incorporate non-periodic boundary conditions have not been fully explored. In this work, we implement a quantum algorithm for two-dimensional linearized fluid flow around an obstacle, using block-encoding of the linear-system matrix and quantum singular value transformation (QSVT) to solve it. Inflow, outflow, and no-slip boundary conditions are formulated as sparse matrix operations and efficiently embedded into quantum circuits using index-value encoding. We demonstrate logarithmic scaling of the required numbers of qubits and gates with respect to the number of lattice points, suggesting the potential feasibility of quantum-computational fluid dynamics simulations.
Fluid simulations, especially at high Reynolds numbers, are computationally expensive on classical computers, making them promising application targets for quantum computing. Recent studies have combined the lattice Boltzmann method (LBM) with Carleman linearization to design quantum algorithms for computational fluid dynamics (CFD). However, practical quantum-circuit implementations of these algorithms that incorporate non-periodic boundary conditions have not been fully explored. In this work, we implement a quantum algorithm for two-dimensional linearized fluid flow around an obstacle, using block-encoding of the linear-system matrix and quantum singular value transformation (QSVT) to solve it. Inflow, outflow, and no-slip boundary conditions are formulated as sparse matrix operations and efficiently embedded into quantum circuits using index-value encoding. We demonstrate logarithmic scaling of the required numbers of qubits and gates with respect to the number of lattice points, suggesting the potential feasibility of quantum-computational fluid dynamics simulations.
We apply Carleman linearization of the Lattice Boltzmann (CLB) representation of fluid flows to quantum emulate the dynamics of a two-dimensional Kolmogorov-like flow. We assess the accuracy of the result and find a relative error of the order of 10−3 with just two Carleman iterates for a range of the Reynolds number up to a few hundreds. We first define a gate-based quantum circuit for the implementation of the CLB method and then exploit the sparse nature of the CLB matrix to build a quantum circuit based on block-encoding techniques which makes use of matrix oracles. It is shown that the gate complexity of the algorithm is thereby dramatically reduced, from exponential to quadratic. However, due to the need of employing up to seven ancilla qubits, the probability of success of the corresponding circuit for a single time step is too low to enable multi-step time evolution. Several possible directions to circumvent this problem are briefly outlined.
Quantum computation of fluid dynamics has attracted growing attention as a key application of fault-tolerant quantum computers anticipated in the coming decade, with lattice Boltzmann methods emerging as a particularly promising approach. Explicit and efficient elementary-gate-level circuit simulations, however, have so far been demonstrated only in the linear case. Here we include the leading nonlinearity through second-order Carleman linearization of the one-dimensional Boltzmann equation, and demonstrate, via explicit quantum-circuit simulation, the preparation of the final-time state using a Taylor-expansion-based ODE solver based on the quantum singular value transformation. With this construction, we analyze the gate and qubit complexities, which scale logarithmically with the grid size, the nonlinearity captured by the higher-order Carleman linearization, and the practical utility of higher-order expansions in the Taylor ODE solver. The construction provides a concrete baseline for computational cost reduction and further developments such as extensions to higher dimensions, complex geometries, and the extraction of physical quantities, towards industrially useful quantum CFD.
Computational Fluid Dynamics simulations are crucial in industrial applications but require extensive computational resources, particularly for extreme turbulent regimes. While classical digital approaches remain the standard, quantum computing promises a breakthrough by enabling a more efficient encoding of large-scale simulations with a limited number of qubits. This work presents a practical numerical assessment of a hybrid quantum-classical approach to CFD based on the Lattice Boltzmann Method (LBM). The inherently non-linear LBM equations are linearized via a Carleman expansion and solved using the quantum Harrow-Hassidim-Lloyd algorithm (HHL). We evaluate this method on three benchmark cases featuring different boundary conditions—periodic, bounce-back, and moving wall—using state-vector emulation on high-performance computing resources. Our results confirm the validity of the approach, achieving median error fidelities on the order of10−3and success probabilities sufficient for practical quantum state sampling. Notably, the spectral properties of small lattice systems closely approximate those of larger ones, suggesting a pathway to mitigate one of HHL's bottlenecks: eigenvalue pre-evaluation.
Computational fluid dynamics (CFD) is a cornerstone of classical scientific computing, and there is growing interest in whether quantum computers can accelerate such simulations. The existing proposals for fault-tolerant quantum algorithms for CFD have almost exclusively been based on the Carleman embedding method, used to encode nonlinearities on a quantum computer. Here, we first identify several key challenges that must be addressed in order to establish quantum advantage using this method, including Carleman convergence, time-stepping requirements, condition-number scaling, and data extraction. Building on this analysis, we develop a novel algorithm for the incompressible lattice Boltzmann equation that addresses them, and provide its detailed analysis, including all potential sources of algorithmic complexity, as well as gate count estimates. We find that for an end-to-end problem, a modest quantum advantage may be preserved for selected observables in the high-error-tolerance regime. We establish a lower bound for the Reynolds number scaling of our quantum algorithm in dimension D at Kolmogorov microscale resolution with O(Re43(1+2D)×qM), where qM is a multiplicative overhead for data extraction with qM=O(Re83) for the drag force. This upper bounds the scaling improvement over classical algorithms by O(Re83D). However, our numerical investigations suggest a lower speedup, with a scaling estimate of O(Re1.936×qM) for D=2. Our results give robust evidence that small, but nontrivial, quantum advantages can be achieved in the context of CFD, and motivate the need for additional rigorous end-to-end quantum algorithm development.
We present a quantum computing algorithm for fluid flows based on the Carleman-linearization of the Lattice Boltzmann (LB) method. First, we demonstrate the convergence of the classical Carleman procedure at moderate Reynolds numbers, namely, for Kolmogorov-like flows. Then we proceed to formulate the corresponding quantum algorithm, including the quantum circuit layout, and analyze its computational viability. We show that, at least for moderate Reynolds numbers between 10 and 100, the Carleman–LB procedure can be successfully truncated at second order, which is a very encouraging result. We also show that the quantum circuit implementing the single time-step collision operator has a fixed depth, regardless of the number of lattice sites. However, such depth is of the order of ten thousands quantum gates, meaning that quantum advantage over classical computing is not attainable today, but could be achieved in the near or mid-term future. The same goal for the multi-step version remains, however, an open topic for future research.
Quantum computing (QC) has emerged as a potential computational tool in fluid dynamics. However, a practical QC protocol with end-to-end practical applications to fluid flow is still in nascent. We here propose a simple and practical hybrid QC algorithm based on lattice Boltzmann methods (LBM), which we term HQLBM, for fluid dynamics simulations. The existing QC-based LBMs are limited to simple low-Reynolds-number flow simulations due to their disability to handle the nonlinear collision term in LBM for QC. In this work, a linearized non-equilibrium collision, derived from kinetic theory, is presented for HQLBM simulating practical flows. The present approach ensures the unitary of quantum algorithms while keeping the collision relaxation parameter adjustable for simulating different Reynolds number flows. Most importantly, the linearized collision keeps the accuracy of the original nonlinear one in the lattice Boltzmann equation when it theoretically recovers its macroscopic counterpart—Navier–Stokes equations. The practicality of the proposed method is demonstrated by simulating two typical flows, including lid-driven and natural convection flows in a square cavity at different Reynolds and Rayleigh numbers, respectively. It is shown that the proposed HQLBM has good numerical accuracy compared to the conventional LBM, and lower complexity on comparisons to the QC-based LBM carried out on single-circuit QC even when it is performed on a Qiskit virtual quantum computer. This work offers a practical application of QC-based LBM for complex fluid dynamics problems.