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:2511.20017

Real and Fourier space readout methods: Comparison of complexity and applications to CFD problems

Xinchi Huang, Hirofumi Nishi, Yoshifumi Kawada, Tomofumi Zushi, Yu-ichiro Matsushita

quant-phSubmitted Nov 25, 2025• Announced Nov 26, 2025• 3 citations
arXivHTMLPDF

Abstract

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.

Comments
41 pages including the appendices

Related papers

Problem-Specific Basis Quantum State Readout via Proper Orthogonal Decomposition

Kota Ichiki, Xinchi Huang, Gekko Budiutama +7 more

Quantum computing offers a promising approach to accelerating partial differential equation (PDE) solvers for large-scale, real-world problems. However, reconstructing the classical representation of a solution from a quantum state remains a significant computational bottleneck. We propose a problem-specific method, termed proper orthogonal decomposition-based readout (PODR), to improve this efficiency. This method comprises offline and online stages. In the offline stage, a set of basis functions capturing the dominant features of the target problem is constructed using classical computations. In the online stage, the quantum state is projected onto this reduced basis, and only a small number of coefficients is extracted to reconstruct the solution. PODR is particularly advantageous for simulations involving varying parameters, common in computational fluid dynamics (CFD), because the POD basis functions are constructed only once in the offline stage and reused during the online stage. Applying PODR to benchmark CFD problems demonstrates a significant reduction in online computational cost compared with conventional readout methods.

quant-pharXiv:2605.27915•May 28, 2026•0 citations

Fourier space readout method for efficiently recovering functions encoded in quantum states

Xinchi Huang, Hirofumi Nishi, Yoshifumi Kawada +2 more

Abstract Applying quantum computing to computer-aided engineering (CAE) problems is highly expected since quantum computers yield potential exponential speedups for the operations between extremely large matrices and vectors. Although efficient quantum algorithms for the above problems have been intensively investigated, it remains a crucial task to extract all the grid-point values encoded in the prepared quantum states, which was believed to eliminate the achieved quantum advantage. In this paper, we propose a quantum–classical hybrid Fourier space readout method to efficiently recover the underlying function from its corresponding quantum state. We provide explicit quantum circuits, followed by theoretical and numerical discussions on its complexity. In particular, the complexity on quantum computers has only a logarithmic dependence on the grid number, while its complexity on classical computers has a linear dependence on the number of target points instead of the grid number. Our result implies that the achieved quantum speedups are not necessarily ruined when we read out the solutions to the CAE problems.

arXiv:2507.20599•Quantum Science and Technology•Jul 10, 2026•4 citations

Utilizing Quantum Computing for Solving Multidimensional Partial Differential Equations

Manu Chaudhary

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.

•Jan 1, 2025•0 citations

Quantum Algorithms for Computational Fluid Dynamics

Mario Guillaume Cecile, Nis-Luca van Hülst, Tomohiro Hashizume +19 more

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.

quant-pharXiv:2609.39962•Oct 1, 2026•1 citation

A Review of the Current State-of-the-Art of Quantum Computing for CFD: Approaches, Advantages, and Limitations

Giulio Malinverno, Javier Blasco Alberto

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.

Aerotecnica Missili & Spazio•Jun 12, 2025•8 citations

Solving Burgers’ equation with quantum computing

Furkan Oz, Rohit K. S. S. Vuppala, Kursat Kara +1 more

Abstract Computational fluid dynamics (CFD) simulations are a vital part of the design process in the aerospace industry. Although reliable CFD results can be obtained with turbulence models, direct numerical simulation of complex bodies in three spatial dimensions (3D) is impracticable due to the massive amount of computational elements. For instance, a 3D direct numerical simulation of a turbulent boundary-layer over the wing of a commercial jetliner that resolves all relevant length scales using a serial CFD solver on a modern digital computer would take approximately 750 million years or roughly 20% of the earth’s age. Over the past 25 years, quantum computers have become the object of great interest worldwide as powerful quantum algorithms have been constructed for several important, computationally challenging problems that provide enormous speed-up over the best-known classical algorithms. In this paper, we adapt a recently introduced quantum algorithm for partial differential equations to Burgers’ equation and develop a quantum CFD solver that determines its solutions. We used our quantum CFD solver to verify the quantum Burgers’ equation algorithm to find the flow solution when a shockwave is and is not present. The quantum simulation results were compared to: (i) an exact analytical solution for a flow without a shockwave; and (ii) the results of a classical CFD solver for flows with and without a shockwave. Excellent agreement was found in both cases, and the error of the quantum CFD solver was comparable to that of the classical CFD solver.

Quantum Information Processing•Dec 31, 2021•70 citations
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.
Quantum computing offers a promising approach to accelerating partial differential equation (PDE) solvers for large-scale, real-world problems. However, reconstructing the classical representation of a solution from a quantum state remains a significant computational bottleneck. We propose a problem-specific method, termed proper orthogonal decomposition-based readout (PODR), to improve this efficiency. This method comprises offline and online stages. In the offline stage, a set of basis functions capturing the dominant features of the target problem is constructed using classical computations. In the online stage, the quantum state is projected onto this reduced basis, and only a small number of coefficients is extracted to reconstruct the solution. PODR is particularly advantageous for simulations involving varying parameters, common in computational fluid dynamics (CFD), because the POD basis functions are constructed only once in the offline stage and reused during the online stage. Applying PODR to benchmark CFD problems demonstrates a significant reduction in online computational cost compared with conventional readout methods.
Abstract Applying quantum computing to computer-aided engineering (CAE) problems is highly expected since quantum computers yield potential exponential speedups for the operations between extremely large matrices and vectors. Although efficient quantum algorithms for the above problems have been intensively investigated, it remains a crucial task to extract all the grid-point values encoded in the prepared quantum states, which was believed to eliminate the achieved quantum advantage. In this paper, we propose a quantum–classical hybrid Fourier space readout method to efficiently recover the underlying function from its corresponding quantum state. We provide explicit quantum circuits, followed by theoretical and numerical discussions on its complexity. In particular, the complexity on quantum computers has only a logarithmic dependence on the grid number, while its complexity on classical computers has a linear dependence on the number of target points instead of the grid number. Our result implies that the achieved quantum speedups are not necessarily ruined when we read out the solutions to the CAE problems.
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.
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.
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.
Abstract Computational fluid dynamics (CFD) simulations are a vital part of the design process in the aerospace industry. Although reliable CFD results can be obtained with turbulence models, direct numerical simulation of complex bodies in three spatial dimensions (3D) is impracticable due to the massive amount of computational elements. For instance, a 3D direct numerical simulation of a turbulent boundary-layer over the wing of a commercial jetliner that resolves all relevant length scales using a serial CFD solver on a modern digital computer would take approximately 750 million years or roughly 20% of the earth’s age. Over the past 25 years, quantum computers have become the object of great interest worldwide as powerful quantum algorithms have been constructed for several important, computationally challenging problems that provide enormous speed-up over the best-known classical algorithms. In this paper, we adapt a recently introduced quantum algorithm for partial differential equations to Burgers’ equation and develop a quantum CFD solver that determines its solutions. We used our quantum CFD solver to verify the quantum Burgers’ equation algorithm to find the flow solution when a shockwave is and is not present. The quantum simulation results were compared to: (i) an exact analytical solution for a flow without a shockwave; and (ii) the results of a classical CFD solver for flows with and without a shockwave. Excellent agreement was found in both cases, and the error of the quantum CFD solver was comparable to that of the classical CFD solver.