Quantum algorithms are gaining attention in Computational Fluid Dynamics (CFD) for their favorable scaling, as encoding physical fields into quantum probability amplitudes enables representation of two to the power of n spatial points with only n qubits. A key challenge in Quantum CFD is the efficient readout of simulation results, a topic that has received limited attention in literature. This work presents methods to extract statistical properties of spatial velocity fields, such as central moments and structure functions, directly from parameterized ansatz circuits, avoiding full quantum state tomography. As a proof of concept, we implement our approach for 1D velocity fields, encoding 16 spatial points with 4 qubits, and analyze both a sine wave signal and four snapshots from Burgers' equation evolution. Using Qedma's error mitigation software QESEM, we demonstrate that such computations achieve high accuracy on current quantum devices, specifically IBMQ's Heron2 system ibm_fez.
Quantum algorithms are gaining attention in Computational Fluid Dynamics (CFD) for their favorable scaling, as encoding physical fields into quantum probability amplitudes enables representation of two to the power of n spatial points with only n qubits. A key challenge in Quantum CFD is the efficient readout of simulation results, a topic that has received limited attention in literature. This work presents methods to extract statistical properties of spatial velocity fields, such as central moments and structure functions, directly from parameterized ansatz circuits, avoiding full quantum state tomography. As a proof of concept, we implement our approach for 1D velocity fields, encoding 16 spatial points with 4 qubits, and analyze both a sine wave signal and four snapshots from Burgers' equation evolution. Using Qedma's error mitigation software QESEM, we demonstrate that such computations achieve high accuracy on current quantum devices, specifically IBMQ's Heron2 system ibm_fez.
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.
High-fidelity reconstruction of computational fluid dynamics (CFD) fields is a central challenge in reduced-order modelling, flow control, and large-scale scientific simulations, where classical approaches face severe scalability and nonlinearity limitations. In this work, a hybrid quantum–classical framework is proposed for reconstructing CFD solution snapshots using variational quantum algorithms (VQAs) on near-term quantum hardware. The method formulates CFD field reconstruction as a variational quantum state learning problem using amplitude encoding and shallow parameterized quantum circuits. Reconstruction fidelities ranging from 0.8696 to 0.9369 and low L2 errors between 0.2532 and 0.3673 are achieved, demonstrating accurate quantum approximation of high-dimensional fluid fields. The results significantly outperform earlier low-fidelity attempts and confirm that VQA-based surrogate modelling can capture dominant spatial flow structures even with limited circuit depth. This study highlights the potential of hybrid variational quantum frameworks as scalable alternatives to classical CFD post-processing and reduced-order modelling.
Classical computational fluid dynamics (CFD) methods encounter significant computational bottlenecks in large systems and at high Reynolds number flows due to the rapid increase in degrees of freedom, even on flagship supercomputers. As quantum computers emerge, the Quantum Lattice Boltzmann Method (QLBM) has been proposed as a quantum-native alternative for solving fluid dynamics problems. However, until recently, nearly all studies have relied on classical quantum simulators rather than real quantum hardware. This study presents a benchmark of a one-dimensional QLBM implementation executed on three different IBM Quantum hardware. We design and test a quantum circuit for the advection-diffusion equation using amplitude encoding, a Bhatnagar-Gross-Krook (BGK)-type collision operator, and a streaming step with periodic boundary conditions. Our numerical experiments evaluate transpiled two-qubit gate count, total circuit depth, runtime, and accuracy metrics including maximum absolute error (L∞ norm) and root-mean-square error (RMSE). We find that the present collision and streaming operators dominate the overall cost and become the primary scalability bottleneck on current hardware. To mitigate the prohibitive cost of full quantum state tomography on hardware-based benchmarking exercises, we introduce a sampler-based measurement strategy that reconstructs macroscopic density fields directly from computational-basis measurements. This approach substantially reduces measurement overhead while preserving the expected advection-diffusion dynamics on hardware. These results provide a quantitative assessment of QLBM performance in the noisy intermediate-scale quantum (NISQ) regime and identify the principal algorithmic and experimental limitations that must be addressed for QLBM to become viable for fluid dynamics.
Quantum computing is a promising technology that accelerates the partial differential equations solver for practical problems. The reconstruction of solutions (i.e., the readout of quantum states) remains a crucial problem, although numerous efficient quantum algorithms have been proposed. In this paper, we propose and compare several efficient readout methods in the real and the Fourier space. The Fourier space readout (FSR) and the proposed approximate real space readout (ARSR) methods are currently the most efficient and practical ones for the purpose of reconstructing continuous real-valued functions. In contrast, the quantum amplitude estimation (QAE) based methods (especially in the Fourier space) are favorable for mid-term/far-term quantum devices. Besides, we apply the methods for benchmark solutions in computational fluid dynamics (CFD) and demonstrate great improvements compared to the conventional sampling method for large grid numbers. Equipped with efficient readout methods, we further show that a 2D Burgers' equation can be solved efficiently without using the expensive strategy of linearization. It suggests the potential quantum advantages for some practical applications on mid-term quantum devices.
ABSTRACT Encoding velocity fields as quantum states poses a significant challenge in the development of quantum algorithms for fluid dynamics. Conventional methods, often based on direct normalization of discrete velocity data, do not intrinsically capture the structure and dynamics of vortex flows, potentially introducing artifacts that affect accuracy in modeling flow evolution. We propose a method for encoding velocity fields as quantum states of a spinor field using the spherical Clebsch representation. By applying a pointwise normalization constraint, we develop an ansatz with parameterized controlled rotation gates, optimized through a variational quantum algorithm. This approach encodes target velocity fields into spinor‐based quantum states, offering a pathway to more efficient quantum simulations of fluid dynamics. Furthermore, the encoded quantum state can be mapped to the vortex‐surface field, providing a useful approach for analyzing vortex dynamics and characterizing flow structures. While the calculation of the loss function encounters exponential complexity per training step, and the measurement of all qubits is inevitable, leading to high computational complexity for implementation on quantum hardware and requiring further optimization, its effectiveness has been validated across various scenarios through quantum simulation. This method enables spinor‐based encoding and quantum simulation, with potential applications to diverse vector fields and complex flows, including magnetohydrodynamics and reactive flows.
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.