Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2402.16686 · Physics of Fluids

Three Carleman routes to the quantum simulation of classical fluids

C. Sanavio, R. Scatamacchia, C. de Falco, Sauro Succi

Published May 1, 2024• 49 citations
arXivHTMLPDF

Abstract

We discuss the Carleman approach to the quantum simulation of classical fluids, as applied to (i) lattice Boltzmann, (ii) Navier–Stokes, and (iii) Grad formulations of fluid dynamics. Carleman lattice Boltzmann shows excellent convergence properties, but it is plagued by nonlocality which results in an exponential depth of the corresponding circuit with the number of Carleman variables. The Carleman Navier–Stokes offers a dramatic reduction of the number Carleman variables, which might lead to a viable depth, provided locality can be preserved and convergence can be achieved with a moderate number of iterates also at sizeable Reynolds numbers. Finally, it is argued that Carleman Grad might combine the best of Carleman lattice Boltzmann and Carleman Navier–Stokes.

DOI
10.1063/5.0204955

Related papers

Carleman-Grad approach to the quantum simulation of fluids

Claudio Sanavio, Enea Mauri, Sauro Succi

We discuss the Carleman linearization approach to the quantum simulation of classical fluids based on Grad's generalized hydrodynamics and compare it to previous investigations based on lattice Boltzmann and Navier-Stokes formulations. We show that the Carleman-Grad procedure exhibits intermediate properties between the two. Namely, convergence of the Carleman iteration over a few tens of timesteps and a potentially viable quantum circuit implementation using quantum linear algebra solvers. However, both features still need substantial improvements to yield a viable quantum algorithm for fluid flows.

arXiv:2406.01118•Jun 3, 2024•10 citations

Schrödinger-Navier-Stokes Equation for the Quantum Simulation of Navier-Stokes Flows

Luca Cappelli, Sauro Succi, Monica Lacatus +2 more

The search for quantum-like wave formulations of the Navier-Stokes (Schrödinger-Navier-Stokes, SNS for short) equations describing classical dissipative fluids has met with increasing attention in the recent years, due to the large portfolio of potential applications in science and engineering. A SNS formulation of classical fluids was first presented in a largely un-noticed paper by Dietrich and Vautherin back in 1985(Journal de Physique). In this paper, we revisit this specific SNS approach and assess its viability for quantum implementations based on Carleman embedding/linearization techniques. Specifically, we i) Clarify in full mathematical detail why the SNS dissipator presents a steep challenge for quantum computers and propose a way out strategy based on the Hamilton-Jacobi (HJ) formulation of fluid dynamics; ii) Develop a corresponding quantum algorithm using a new technique based on a tensor-network representation of Carleman embedding of the HJ equations (CHJ) which permits substantial memory savings; iii) Emulate the CHJ quantum algorithm on a classical computer and analyse its convergence and accuracy for the specific case of Kolmogorov-like flows at moderate Reynolds numbers. To the best of our knowledge, this is the first quantum algorithm based on a quantum-like wave formulation of the genuine Navier-Stokes equations, including pressure, dissipation and vorticity.

quant-pharXiv:2604.11113•Quantum Science and Technology•Apr 14, 2026•4 citations

Quantum computing for simulation of fluid dynamics

Claudio Sanavio, Sauro Succi

The implementation of quantum algorithms for the simulation of classical fluid dynamics poses a fundamental challenge due to the nonlinearity of the fluid equations. In this work, we provide a pedagogical introduction to quantum computing algorithms for simulating classical fluids, with a special focus on the Carleman-Lattice Boltzmann algorithm, which has captured significant attention in the last couple of years. While this algorithm demonstrates satisfactory convergence to analytical solutions for systems at low-to-moderate Reynolds numbers, it also shows an exponential depth of the corresponding quantum circuit. As a result much further analysis is needed to assess the availability of the Carleman-Lattice Boltzmann method on a quantum computer.

arXiv:2404.01302•IntechOpen eBooks•May 8, 2024•10 citations

Lattice Boltzmann–Carleman quantum algorithm and circuit for fluid flows at moderate Reynolds number

Claudio Sanavio, Sauro Succi

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.

arXiv:2310.17973•AVS Quantum Science•Apr 22, 2024•58 citations

A Demonstration of Quantum Circuit Implementation for Obstacle Flow Using Carleman-Linearized Lattice Boltzmann Method

Kazumasa Ueno, Keita Kanno, Yasunori Lee

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.

quant-pharXiv:2605.28135•May 28, 2026•2 citations

An end-to-end quantum algorithm for nonlinear fluid dynamics with bounded quantum advantage

David Jennings, Kamil Korzekwa, Matteo Lostaglio +3 more

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(\mathrm{Re}^{\frac{3}{4}(1+\frac{D}{2})} \times q_M)$, where $q_M$ is a multiplicative overhead for data extraction with $q_M = O(\mathrm{Re}^{\frac{3}{8}})$ for the drag force. This upper bounds the scaling improvement over classical algorithms by $O(\mathrm{Re}^{\frac{3D}{8}})$. However, our numerical investigations suggest a lower speedup, with a scaling estimate of $O(\mathrm{Re}^{1.936} \times q_M)$ 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.

quant-pharXiv:2512.03758•PRX Quantum•Dec 4, 2025•30 citations
We discuss the Carleman approach to the quantum simulation of classical fluids, as applied to (i) lattice Boltzmann, (ii) Navier–Stokes, and (iii) Grad formulations of fluid dynamics. Carleman lattice Boltzmann shows excellent convergence properties, but it is plagued by nonlocality which results in an exponential depth of the corresponding circuit with the number of Carleman variables. The Carleman Navier–Stokes offers a dramatic reduction of the number Carleman variables, which might lead to a viable depth, provided locality can be preserved and convergence can be achieved with a moderate number of iterates also at sizeable Reynolds numbers. Finally, it is argued that Carleman Grad might combine the best of Carleman lattice Boltzmann and Carleman Navier–Stokes.
We discuss the Carleman linearization approach to the quantum simulation of classical fluids based on Grad's generalized hydrodynamics and compare it to previous investigations based on lattice Boltzmann and Navier-Stokes formulations. We show that the Carleman-Grad procedure exhibits intermediate properties between the two. Namely, convergence of the Carleman iteration over a few tens of timesteps and a potentially viable quantum circuit implementation using quantum linear algebra solvers. However, both features still need substantial improvements to yield a viable quantum algorithm for fluid flows.
The search for quantum-like wave formulations of the Navier-Stokes (Schrödinger-Navier-Stokes, SNS for short) equations describing classical dissipative fluids has met with increasing attention in the recent years, due to the large portfolio of potential applications in science and engineering. A SNS formulation of classical fluids was first presented in a largely un-noticed paper by Dietrich and Vautherin back in 1985(Journal de Physique). In this paper, we revisit this specific SNS approach and assess its viability for quantum implementations based on Carleman embedding/linearization techniques. Specifically, we i) Clarify in full mathematical detail why the SNS dissipator presents a steep challenge for quantum computers and propose a way out strategy based on the Hamilton-Jacobi (HJ) formulation of fluid dynamics; ii) Develop a corresponding quantum algorithm using a new technique based on a tensor-network representation of Carleman embedding of the HJ equations (CHJ) which permits substantial memory savings; iii) Emulate the CHJ quantum algorithm on a classical computer and analyse its convergence and accuracy for the specific case of Kolmogorov-like flows at moderate Reynolds numbers. To the best of our knowledge, this is the first quantum algorithm based on a quantum-like wave formulation of the genuine Navier-Stokes equations, including pressure, dissipation and vorticity.
The implementation of quantum algorithms for the simulation of classical fluid dynamics poses a fundamental challenge due to the nonlinearity of the fluid equations. In this work, we provide a pedagogical introduction to quantum computing algorithms for simulating classical fluids, with a special focus on the Carleman-Lattice Boltzmann algorithm, which has captured significant attention in the last couple of years. While this algorithm demonstrates satisfactory convergence to analytical solutions for systems at low-to-moderate Reynolds numbers, it also shows an exponential depth of the corresponding quantum circuit. As a result much further analysis is needed to assess the availability of the Carleman-Lattice Boltzmann method on a quantum computer.
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.
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.
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 DDD at Kolmogorov microscale resolution with O(Re34(1+D2)×qM)O(\mathrm{Re}^{\frac{3}{4}(1+\frac{D}{2})} \times q_M)O(Re43​(1+2D​)×qM​), where qMq_MqM​ is a multiplicative overhead for data extraction with qM=O(Re38)q_M = O(\mathrm{Re}^{\frac{3}{8}})qM​=O(Re83​) for the drag force. This upper bounds the scaling improvement over classical algorithms by O(Re3D8)O(\mathrm{Re}^{\frac{3D}{8}})O(Re83D​). However, our numerical investigations suggest a lower speedup, with a scaling estimate of O(Re1.936×qM)O(\mathrm{Re}^{1.936} \times q_M)O(Re1.936×qM​) for D=2D=2D=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.