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:2308.12972 · Communications Physics

Quantum-inspired framework for computational fluid dynamics

Raghavendra Dheeraj Peddinti, Stefano Pisoni, Alessandro Marini, P. Aaron Lott, Henrique Gustavo Argentieri, Egor Tiunov, Leandro Aolita

Published Apr 27, 2024• 42 citations
arXivHTMLPDF

Abstract

Abstract Computational fluid dynamics is both a thriving research field and a key tool for advanced industry applications. However, the simulation of turbulent flows in complex geometries is a compute-power intensive task due to the vast vector dimensions required by discretized meshes. We present a complete and self-consistent full-stack method to solve incompressible fluids with memory and run time scaling logarithmically in the mesh size. Our framework is based on matrix-product states, a compressed representation of quantum states. It is complete in that it solves for flows around immersed objects of arbitrary geometries, with non-trivial boundary conditions, and self-consistent in that it can retrieve the solution directly from the compressed encoding, i.e. without passing through the expensive dense-vector representation. This framework lays the foundation for a generation of more efficient solvers of real-life fluid problems.

DOI
10.1038/s42005-024-01623-8

Related papers

Quantum-Inspired Computational Fluid Dynamics for Transient Turbulent Compressible Flows

Shang Xian Matthew Lee, Melissa Kozul, Muhammad Usman +3 more

Quantum-inspired algorithms are an emerging class of algorithms for computational fluid dynamics (CFD) with potentially favourable scaling for large problems compared to classical methods. However, their applications have been limited to incompressible flows due to arithmetic limitations, which are addressed in this work. This work introduces the first true end-to-end quantum-inspired computational fluid dynamics (QICFD) solver for direct numerical simulation of the compressible Navier-Stokes equations, that is, all arithmetic operations, as well as initialisation and post-processing, are undertaken in the tensor train (TT) format. Importantly, new division and square-root algorithms using TTs enable the use of Sutherland's law for viscosity, and leverages recent improvements in TT arithmetic algorithms for reduced runtime and memory cost. The new QICFD solver is validated by comparison with the classical CFD solver HiPSTAR and by way of a challenging fluid-flow test case, the low resolution Taylor-Green Vortex (TGV) at Mach numbers of 0.8 and 0.1. The TGV test case is a transient turbulent case that is very sensitive to accumulating errors, yet our QICFD solver achieves excellent agreement with the classical CFD reference. This work demonstrates the correctness of the new TT division and square-root algorithms, and that QICFD is capable of compressible flow simulations. The new QICFD solver is also able to perform simultaneous simulations, running multiple TGV-like cases initialised differently in parallel with reduced extra cost. Finally, the demonstrated TGV test case reveals additional challenges of QICFD as well as highlight the need for future advances to make TT methods viable for industrially-relevant conditions.

physics.flu-dynCross-listedarXiv:2608.26995•Aug 28, 2026

A roadmap to Quantum Computational Fluid Dynamics

Langer, Stefan, Stefan Görtz

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.

•Oct 1, 2025•0 citations

Technical report on a quantum-inspired solver for simulating compressible flows

Raghavendra Dheeraj Peddinti, Stefano Pisoni, Egor Tiunov +2 more

This document presents a quantum-inspired solver for 2D Euler equations, accepted at the final phase of the Airbus-BWM Group Quantum Computing Challenge (ABQCC) 2024. We tackle the case study of Quantum Solvers for Predictive Aeroacoustic and Aerodynamic modeling tasks. We propose a tensor network based solver that scales polylogarithmically with the mesh size, in both runtime and memory. This provides a promising avenue for tackling the curse of dimensionality that plagues the direct numerical simulations in the field of computational fluid dynamics.

arXiv:2506.03833•Jun 4, 2025•0 citations

Quantum-Inspired Simulation of Complex Fluid Dynamics

Jincheng Zhang

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.

•Sep 6, 2026•0 citations

Quantum-inspired tensor-network fractional-step method for incompressible flow in curvilinear coordinates

Nis-Luca van Hülst, Pia Siegl, Over, Paul +5 more

We introduce an algorithmic framework based on tensor networks for computing fluid flows around immersed objects in curvilinear coordinates. We show that the tensor network simulations can be carried out solely using highly compressed tensor representations of the flow fields and the differential operators and discuss the numerical implementation of the tensor operations required for computing fluid flows in detail. The applicability of our method is demonstrated by applying it to the paradigm example of steady and transient flows around stationary and rotating cylinders. We find excellent quantitative agreement in comparison to finite difference simulations for Strouhal numbers, forces and velocity fields. The properties of our approach are discussed in terms of reduced order models. We estimate the memory saving and potential runtime advantages in comparison to standard finite difference simulations. We find accurate results with errors of less than 0.3% for flow-field compressions by a factor of up to 20 and differential operators compressed by factors of up to 1000 compared to sparse matrix representations. We provide strong numerical evidence that the runtime scaling advantages of the tensor network approach with system size will provide substantial resource savings when simulating larger systems. Finally, we note that, like other tensor network-based fluid flow simulations, our algorithmic framework is directly portable to a quantum computer leading to further scaling advantages.

•Apr 22, 2026•0 citations

Quantum-inspired tensor-network fractional-step method for incompressible flow in curvilinear coordinates

Nis-Luca van Hülst, Pia Siegl, Paul Lauterbur Over +5 more

We introduce an algorithmic framework based on tensor networks for computing fluid flows around immersed objects in curvilinear coordinates. We show that the tensor network simulations can be carried out solely using highly compressed tensor representations of the flow fields and the differential operators and discuss the numerical implementation of the tensor operations required for computing fluid flows in detail. The applicability of our method is demonstrated by applying it to the paradigm example of steady and transient flows around stationary and rotating cylinders. We find excellent quantitative agreement in comparison to finite difference simulations for Strouhal numbers, forces and velocity fields. The properties of our approach are discussed in terms of reduced order models. We estimate the memory saving and potential runtime advantages in comparison to standard finite difference simulations. We find accurate results with errors of less than 0.3% for flow-field compressions by a factor of up to 20 and differential operators compressed by factors of up to 1000 compared to sparse matrix representations. We provide strong numerical evidence that the runtime scaling advantages of the tensor network approach with system size will provide substantial resource savings when simulating larger systems. Finally, we note that, like other tensor network-based fluid flow simulations, our algorithmic framework is directly portable to a quantum computer leading to further scaling advantages.

arXiv:2507.05222•Computer Physics Communications•Apr 22, 2026•3 citations
Abstract Computational fluid dynamics is both a thriving research field and a key tool for advanced industry applications. However, the simulation of turbulent flows in complex geometries is a compute-power intensive task due to the vast vector dimensions required by discretized meshes. We present a complete and self-consistent full-stack method to solve incompressible fluids with memory and run time scaling logarithmically in the mesh size. Our framework is based on matrix-product states, a compressed representation of quantum states. It is complete in that it solves for flows around immersed objects of arbitrary geometries, with non-trivial boundary conditions, and self-consistent in that it can retrieve the solution directly from the compressed encoding, i.e. without passing through the expensive dense-vector representation. This framework lays the foundation for a generation of more efficient solvers of real-life fluid problems.
Quantum-inspired algorithms are an emerging class of algorithms for computational fluid dynamics (CFD) with potentially favourable scaling for large problems compared to classical methods. However, their applications have been limited to incompressible flows due to arithmetic limitations, which are addressed in this work. This work introduces the first true end-to-end quantum-inspired computational fluid dynamics (QICFD) solver for direct numerical simulation of the compressible Navier-Stokes equations, that is, all arithmetic operations, as well as initialisation and post-processing, are undertaken in the tensor train (TT) format. Importantly, new division and square-root algorithms using TTs enable the use of Sutherland's law for viscosity, and leverages recent improvements in TT arithmetic algorithms for reduced runtime and memory cost. The new QICFD solver is validated by comparison with the classical CFD solver HiPSTAR and by way of a challenging fluid-flow test case, the low resolution Taylor-Green Vortex (TGV) at Mach numbers of 0.8 and 0.1. The TGV test case is a transient turbulent case that is very sensitive to accumulating errors, yet our QICFD solver achieves excellent agreement with the classical CFD reference. This work demonstrates the correctness of the new TT division and square-root algorithms, and that QICFD is capable of compressible flow simulations. The new QICFD solver is also able to perform simultaneous simulations, running multiple TGV-like cases initialised differently in parallel with reduced extra cost. Finally, the demonstrated TGV test case reveals additional challenges of QICFD as well as highlight the need for future advances to make TT methods viable for industrially-relevant conditions.
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 document presents a quantum-inspired solver for 2D Euler equations, accepted at the final phase of the Airbus-BWM Group Quantum Computing Challenge (ABQCC) 2024. We tackle the case study of Quantum Solvers for Predictive Aeroacoustic and Aerodynamic modeling tasks. We propose a tensor network based solver that scales polylogarithmically with the mesh size, in both runtime and memory. This provides a promising avenue for tackling the curse of dimensionality that plagues the direct numerical simulations in the field of computational fluid dynamics.
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.
We introduce an algorithmic framework based on tensor networks for computing fluid flows around immersed objects in curvilinear coordinates. We show that the tensor network simulations can be carried out solely using highly compressed tensor representations of the flow fields and the differential operators and discuss the numerical implementation of the tensor operations required for computing fluid flows in detail. The applicability of our method is demonstrated by applying it to the paradigm example of steady and transient flows around stationary and rotating cylinders. We find excellent quantitative agreement in comparison to finite difference simulations for Strouhal numbers, forces and velocity fields. The properties of our approach are discussed in terms of reduced order models. We estimate the memory saving and potential runtime advantages in comparison to standard finite difference simulations. We find accurate results with errors of less than 0.3% for flow-field compressions by a factor of up to 20 and differential operators compressed by factors of up to 1000 compared to sparse matrix representations. We provide strong numerical evidence that the runtime scaling advantages of the tensor network approach with system size will provide substantial resource savings when simulating larger systems. Finally, we note that, like other tensor network-based fluid flow simulations, our algorithmic framework is directly portable to a quantum computer leading to further scaling advantages.
We introduce an algorithmic framework based on tensor networks for computing fluid flows around immersed objects in curvilinear coordinates. We show that the tensor network simulations can be carried out solely using highly compressed tensor representations of the flow fields and the differential operators and discuss the numerical implementation of the tensor operations required for computing fluid flows in detail. The applicability of our method is demonstrated by applying it to the paradigm example of steady and transient flows around stationary and rotating cylinders. We find excellent quantitative agreement in comparison to finite difference simulations for Strouhal numbers, forces and velocity fields. The properties of our approach are discussed in terms of reduced order models. We estimate the memory saving and potential runtime advantages in comparison to standard finite difference simulations. We find accurate results with errors of less than 0.3% for flow-field compressions by a factor of up to 20 and differential operators compressed by factors of up to 1000 compared to sparse matrix representations. We provide strong numerical evidence that the runtime scaling advantages of the tensor network approach with system size will provide substantial resource savings when simulating larger systems. Finally, we note that, like other tensor network-based fluid flow simulations, our algorithmic framework is directly portable to a quantum computer leading to further scaling advantages.