We propose an end-to-end quantum algorithm to simulate rapidly distorted turbulence via linear combination of Hamiltonian (LCHS). The algorithm comprises three primary stages: the efficient preparation of an initial turbulent state with a prescribed energy spectrum, its subsequent time evolution via LCHS, and the direct measurement of key turbulence statistics. Our analysis indicates that the algorithm can offer a practical quantum speedup over the classical simulation methods for a sufficiently large computational grid. We evaluate the quantum resource requirements for simulating a minimal instance of non-trivial turbulence with classical validation. The numerical results show excellent agreement with ground-truth solutions, capturing both the qualitative evolution of turbulent fields and the quantitative behavior of statistics, including the Reynolds stresses and the fluctuating velocity spectrum. Despite its linearity, rapidly distorted turbulence captures essential turbulence mechanisms and may inform the development of quantum algorithms for the Navier-Stokes equations. Our work establishes a foundation for addressing more complex turbulent phenomena on future fault-tolerant quantum computers.
We propose an end-to-end quantum algorithm to simulate rapidly distorted turbulence via linear combination of Hamiltonian (LCHS). The algorithm comprises three primary stages: the efficient preparation of an initial turbulent state with a prescribed energy spectrum, its subsequent time evolution via LCHS, and the direct measurement of key turbulence statistics. Our analysis indicates that the algorithm can offer a practical quantum speedup over the classical simulation methods for a sufficiently large computational grid. We evaluate the quantum resource requirements for simulating a minimal instance of non-trivial turbulence with classical validation. The numerical results show excellent agreement with ground-truth solutions, capturing both the qualitative evolution of turbulent fields and the quantitative behavior of statistics, including the Reynolds stresses and the fluctuating velocity spectrum. Despite its linearity, rapidly distorted turbulence captures essential turbulence mechanisms and may inform the development of quantum algorithms for the Navier-Stokes equations. Our work establishes a foundation for addressing more complex turbulent phenomena on future fault-tolerant quantum computers.
The accurate simulation of turbulent compressible fluids is a major computational challenge for the aviation industry and possibly a key technology for improving the efficiency of future aircraft so that the ambitious climate targets can be achieved. Even though great progress has been made in the field of CFD in recent decades, and simulation software is available to a wide range of users from both commercial providers and research institutes, it still has two major shortcomings: a) The accuracy of the results is usually limited by the quality of the turbulence models. Even very advanced turbulence models such as Reynolds-Stress models are not able to accurately reproduce a wide range of flows, in particular at the border of the flight envelope. For unseen test cases involving complex physical phenomena or unconventional aircraft configurations, selecting an appropriate turbulence model is often challenging and not straightforward. b) In order to overcome the shortcomings resulting from turbulence modeling, scale-resolving methods such as large eddy simulations or even direct numerical simulations are increasingly being carried out. However, the cost of these simulations for flight Reynolds numbers is so high that even under very optimistic assumptions about the development of future HPC resources and advances in algorithms, full-aircraft simulations seem unrealistic. Even though the possibilities for the use of quantum computers in CFD are still limited due to their current stage of development, they may offer the potential to accelerate calculations in such a way that scale-resolving methods for complete aircraft seem possible. Since algorithms that can be efficiently implemented on quantum computers for solving compressible nonlinear transport equations are also largely not yet available, the time is now to deal with them.
This paper presents a novel approach to simulating complex fluid dynamics, specifically turbulent flows, utilizing quantum-inspired algorithms. Traditional numerical methods, such as Navier-Stokes solvers, often struggle with the computational demands of accurately representing turbulence, leading to significant processing times and limitations in practical applications. We introduce a simulation strategy based on quantum amplitude estimation (QAE), a technique inspired by quantum computing principles, to accelerate the solution process. The core idea is to approximate the probability amplitude associated with different fluid states, thereby reducing the number of iterations required to reach a stable solution. We demonstrate, through theoretical analysis and a simplified numerical framework, that QAE offers a promising path toward more efficient and accurate simulations of turbulent flows, potentially bridging the gap between classical computational fluid dynamics (CFD) and the computational benefits anticipated from full-scale quantum simulation. This work lays the groundwork for future research exploring the full potential of quantum-inspired algorithms in tackling complex fluid dynamics problems.
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.
Fault-tolerant quantum computing is a promising technology to solve linear partial differential equations that are classically demanding to integrate. It is still challenging to solve non-linear equations in fluid dynamics, such as the Burgers equation, using quantum computers. We propose a novel quantum algorithm to solve the Burgers equation. With the Cole-Hopf transformation that maps the fluid velocity field u to a new field ψ, we apply a sequence of quantum gates to solve the resulting linear equation and obtain the quantum state ∣ψ⟩ that encodes the solution ψ. We also propose an efficient way to extract stochastic properties of u, namely the multi-point functions of u, from the quantum state of ∣ψ⟩. Our algorithm offers an exponential advantage over the classical finite difference method in terms of the number of spatial grids when a perturbativity condition in the information-extracting step is met.
Quantum computing holds transformative potential for simulating nonlinear physical systems, such as fluid turbulence. However, mapping nonlinear dynamics to the linear operations required by quantum hardware remains a fundamental challenge. Here, we bridge this gap by introducing a novel node-level ensemble description of a lattice gas, which enables the simulation of nonlinear fluid dynamics on quantum computers. This approach combines the advantages of the lattice Boltzmann method with low-dimensional representation (computational cost) and lattice gas cellular automata with linear collision treatment (quantum compatibility). Building on this framework, we propose a quantum lattice Boltzmann method that relies on linear operations with medium dimensionality, offering the potential for quantum speedup. We validated the algorithm through simulations of vortex-pair merging and decaying turbulence on up to 16.8 million computational grid points. The results demonstrate remarkable agreement with direct numerical simulation, effectively capturing the essential nonlinear mechanisms of fluid dynamics. This work potentially advances the development of quantum algorithms for other nonlinear problems across various transport phenomena in engineering.
Simulations of chemical dynamics are a powerful means for understanding chemistry. However, classical computers struggle to simulate many chemical processes, especially non-adiabatic ones, where the Born-Oppenheimer approximation breaks down. Quantum computers could simulate quantum-chemical dynamics more efficiently than classical computers, but there is currently no complete quantum algorithm for calculating dynamical observables to within a known error. Here, we develop an efficient, end-to-end quantum algorithm for simulating chemical dynamics that avoids all uncontrolled approximations (including the Born-Oppenheimer approximation) and whose error is bounded subject to mild assumptions. To do so, we treat the nuclei and the electrons on an equal footing and simulate the full molecular wavefunction on a momentum-space grid in first quantization, including all algorithmic steps: initial-state preparation, time evolution using qubitization, and measurement of chemical observables such as reaction yields and rates. Our work gives the first algorithm for quantum simulation of chemistry whose end-to-end complexity achieves sublinear scaling in the size of the grid. We achieve this by developing an exponentially faster method for initial-state-preparation. Photochemistry is a likely early application of our algorithm and we estimate resources required for end-to-end simulations of non-adiabatic dynamics of atmospherically important molecules. Classically intractable photochemical computations could be performed using resources comparable to those required for other chemical applications of quantum computing.