QubitSolve is working on a quantum solution for computational fluid dynamics (CFD). We have created a variational quantum CFD (VQCFD) algorithm and a 2D Software Prototype based on it. By testing the Software Prototype on a quantum simulator, we demonstrate that the partial differential equations that underlie CFD can be solved using quantum computers. We aim to determine whether a quantum advantage can be achieved with VQCFD. To do this, we compare the performance of VQCFD with classical CFD using performance models. The quantum performance model uses data from VQCFD circuits run on quantum computers. We define a key performance parameter Q5E7, the ratio of quantum to classical simulation time for a size relevant to industrial simulations. Given the current state of the Software Prototype and the limited computing resources available, we can only estimate an upper bound for Q5E7. While the estimated Q5E7 shows that the algorithm's implementation must improve significantly, we have identified several innovative techniques that could reduce it sufficiently to achieve a quantum advantage. In the next phase of development, we will develop a 3D minimum-viable product and implement those techniques.
QubitSolve is working on a quantum solution for computational fluid dynamics (CFD). We have created a variational quantum CFD (VQCFD) algorithm and a 2D Software Prototype based on it. By testing the Software Prototype on a quantum simulator, we demonstrate that the partial differential equations that underlie CFD can be solved using quantum computers. We aim to determine whether a quantum advantage can be achieved with VQCFD. To do this, we compare the performance of VQCFD with classical CFD using performance models. The quantum performance model uses data from VQCFD circuits run on quantum computers. We define a key performance parameter Q5E7, the ratio of quantum to classical simulation time for a size relevant to industrial simulations. Given the current state of the Software Prototype and the limited computing resources available, we can only estimate an upper bound for Q5E7. While the estimated Q5E7 shows that the algorithm's implementation must improve significantly, we have identified several innovative techniques that could reduce it sufficiently to achieve a quantum advantage. In the next phase of development, we will develop a 3D minimum-viable product and implement those techniques.
We present a comprehensive review of quantum approaches for solving partial differential equations (PDEs) arising in computational fluid dynamics (CFD). We examine fully quantum approaches, including quantum linear system algorithms (QLSAs), ranging from the Harrow--Hassidim--Lloyd (HHL) algorithm to quantum singular value transformation (QSVT), Hamiltonian simulation, and quantum lattice Boltzmann methods (QLBMs), while emphasizing hybrid quantum--classical approaches, including quantum physics-informed neural networks (QPINNs) and amplitude-encoded variational PDE solvers. We focus on hardware-agnostic algorithms compatible with present noisy processors and emerging fault-tolerant architectures. For each framework, we analyze the mathematical formulation, algorithmic structure, and principal limitations. We also examine tensor-network (TN) representations, since CFD fields, differential operators, and geometrical information can often be encoded efficiently in low-rank form. The TN formalism bridges CFD discretizations and quantum states, operators, and circuits, enabling compact representations to be translated into tensor-programmable variational quantum algorithms (TP-VQAs). We further review benchmark problems, including Poisson, reaction, diffusion, and nonlinear model equations, and assess how well quantum algorithms capture key features of fluid dynamics. Our analysis highlights that potential quantum advantage is highly problem dependent and governed by condition number, representational complexity, state preparation, and measurement constraints. We outline capabilities, limitations, and challenges toward scalable quantum algorithms for CFD.
Quantum computing has the potential to revolutionize computational problem-solving by leveraging the quantum mechanical phenomena such as superposition and entanglement, enabling fundamentally different computational strategies compared to classical computing. Classical methods for solving complex and high dimensional partial differential equations (PDEs), crucial for modeling diverse physical phenomena, suffer from an exponential growth in computational complexity known as the curse of dimensionality. This can limit their effectiveness for certain high-resolution simulations and real-time computational applications. In contrast, quantum computing inherently exploits superposition and entanglement to efficiently represent and simultaneously manipulate large-scale discretized PDEs, using exponentially fewer resources compared to classical systems. There are currently many quantum techniques available for solving partial differential equations (PDEs), which are mainly based on variational quantum circuits. However, the existing quantum PDE solvers, particularly those based on variational quantum eigensolver (VQE) techniques, suffer from several limitations. These include low accuracy, high execution times, and low scalability on quantum simulators as well as on noisy intermediate-scale quantum (NISQ) devices, especially for multidimensional PDEs. In this work, we propose an efficient and scalable algorithm for solving multidimensional PDEs. We present two variants of our algorithm: the first leverages finite-difference method (FDM), classical-to-quantum (C2Q) encoding, and numerical instantiation, while the second employs FDM, C2Q, and column-by-column decomposition (CCD). Both variants are designed to enhance accuracy and scalability while reducing execution times. We have validated and evaluated our proposed concepts using a number of case studies including multidimensional Poisson equation, multidimensional heat equation, Black Scholes equation for financial option pricing, and Navier-Stokes equation for computational fluid dynamics (CFD), achieving promising results. Our results demonstrate higher accuracy, higher scalability, and faster execution times compared to VQE-based solvers on noise-free and noisy quantum simulators from IBM. Additionally, we validated our approach on hardware emulators and actual quantum hardware, employing noise mitigation techniques. This work establishes a practical and effective approach for solving PDEs using quantum computing for engineering and scientific applications.
In the last few years, quantum computing has evolved as the next big technological breakthrough. Many big companies are actively researching this area and have built open-source frameworks which can be used to develop solutions for problems that connect be solved by classical computers. One such problem is the solution of Navier-Stokes equations which takes exponential time for simulation but using quantum computers, they can be solved in polynomial time. But the current state of quantum computation does not enable everyone to test their implementation on a real quantum computer. In this situation, a simulator enables rapid prototype and testing techniques and algorithms for when the real quantum computer is ready. This paper focuses on simulating fluid flow algorithms using a quantum framework, such as Navier- Stokes equations, with the lattice Boltzmann method (LBM) used to numerically solve the relevant system of equations on both CPU and GPU to speed up the process. The quantum framework used in this paper is Qiskit, an open-source software development kit created by IBM that allows developers to create and test quantum algorithms. NVIDIA cuQuantum is an SDK of optimized libraries and tools for expediting quantum computing operations used in this paper to solve the fundamental problem of modeling large-size quantum circuits using the power of GPU
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.
The solution for non-linear, complex partial differential Equations (PDEs) is achieved through numerical approximations, which yield a linear system of equations. This approach is prevalent in Computational Fluid Dynamics (CFD), but it restricts the mesh size since the solution of the linear system becomes computationally intractable when the mesh resolution increases. The reliance on the ability of High-Performance Computers (HPC) to scale up and meet these requirements is myopic; such very high-fidelity simulations require a paradigm shift in computing. This paper presents an exploration of quantum methodologies aimed at achieving high accuracy in solving such a large system of equations. Leveraging recent works in Quantum Linear Solver Algorithms (QLSA) and variational algorithms suitable for Quantum Simulation in HPC, we aspire to push the boundaries of CFD-relevant problems that can be solved on hybrid quantum-classical framework. To this end, we consider the 2D, transient, incompressible, viscous, non-linear coupled Burgers equation as a test problem and investigate the accuracy of our approach by comparing results with a classical linear system of equation solvers, such as the Generalized Minimal RESidual method (GMRES). Through rigorous testing, our findings demonstrate that our quantum methods yield results comparable in accuracy to traditional approaches. Additionally, we demonstrate the accuracy, scalability, and consistency of our quantum method. Lastly, we present an insightful estimation of the resources our quantum algorithm needs to solve systems with nearly 2 billion mesh points.
Abstract This article is meant to review of current state-of-the-art of quantum computing applied to computational fluid dynamics and discuss possible applications of Quantum computing technologies in the area of thermofluid-dynamics. Quantum computers are devices that use quantum mechanical phenomena like superposition, entanglement and interference to perform calculations, with a theoretical high speed-up compared with traditional computing solutions, especially for computer science applications but also for engineering applications, like structural optimization, resolution of linear system and analysis of complex dynamics. Beside the consideration about the hardware implementation of these type of devices, this article propose a simplified taxonomy of the technologies that can be currently envisioned for the resolution of thermofluid dynamics problems, identifying the three main approaches, i.e., the traditional algorithmic or circuital approach (with the use of serval algorithms dedicated to the resolution of partial differential equations as well as algorithms dedicated to optimization and search), the analog approach (with the development of direct simulations given the analogy between quantum mechanical systems, like the Schrödinger flow or the Dirac Majorana formulation, and fluid problems, like the inviscid flow or the Lattice Boltzmann model), and the applications based on machine learning techniques. The article discusses practical examples which highlight the flexibility of the methods as well as their intrinsic limitations that hinder the application to many industrial problems, i.e. the simplifications requires to manage physical non-linearities, or the absence of a general purpose algorithm, indicating, beside the intrinsic properties of each method, the technology readiness level (TRL) of this type of approach and the required level of modelling.