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

PolyQROM: Orthogonal-Polynomial-Based Quantum Reduced-Order Model for Flow Field Analysis

Fang, Yu, Cheng Xue, Tai‐Ping Sun, Xiao‐Fan Xu, Xi‐Ning Zhuang, Yunjie Wang, Chuang-Chao Ye, Teng-Yang Ma, Jiaxuan Zhang, Huanyu Liu, Yu-Chun Wu, Zhao‐Yun Chen, Guo‐Ping Guo

Published Apr 30, 2025• 2 citations
arXivHTMLPDF

Abstract

Quantum computing promises exponential acceleration for fluid flow simulations, yet the measurement overhead required to extract flow features from quantum-encoded flow field data fundamentally undermines this advantage--a critical challenge termed the ``output problem''. To address this, we propose an orthogonal-polynomial-based quantum reduced-order model (PolyQROM) that integrates orthogonal polynomial basis transformations with variational quantum circuits (VQCs). PolyQROM employs optimized polynomial-based quantum operations to compress flow field data into low-dimensional representations while preserving essential features, enabling efficient quantum or classical post-processing for tasks like reconstruction and classification. By leveraging the mathematical properties of orthogonal polynomials, the framework enhances circuit expressivity and stabilizes training compared to conventional hardware-efficient VQCs. Numerical experiments demonstrate PolyQROM's effectiveness in reconstructing flow fields with high fidelity and classifying flow patterns with accuracy surpassing classical methods and quantum benchmarks, all while reducing computational complexity and parameter counts. The work bridges quantum simulation outputs with practical fluid analysis, addressing the ``output problem'' through efficient reduced-order modeling tailored for quantum-encoded flow data, offering a scalable pathway to exploit quantum advantages in computational fluid dynamics.

DOI
10.48550/arxiv.2504.21567

Related papers

Quantum machine learning for efficient reduced order modelling of turbulent flows

Han Li, Yutong Lou, Dunhui Xiao

Accurately predicting turbulent flows remains a central challenge in fluid dynamics due to their high dimensionality and intrinsic nonlinearity. Recent developments in quantum algorithms and machine learning offer new opportunities for overcoming the computational barriers inherent in turbulence modeling. Here we present a new hybrid quantum-classical framework that enables faster-than-real-time turbulence prediction by integrating machine learning, quantum computation, and fluid dynamics modeling, in particular, the reduced-order modeling. The novel framework combines quantum proper orthogonal decomposition (QPOD) with a quantum-enhanced deep kernel learning (QDKL) approach. QPOD employs quantum circuits to perform efficient eigenvalue decomposition for low-rank flow reconstruction, while QDKL exploits quantum entanglement and nonlinear mappings to enhance kernel expressivity and dynamic prediction accuracy. The new method is demonstrated on three benchmark turbulent flows, our architecture achieves significantly improved predictive accuracy at reduced model ranks, with training speeds up to 10 times faster and parameter counts reduced by a factor of 1/N compared to classical counterparts, where N is the input dimensionality. Although constrained by current noisy intermediate-scale quantum (NISQ) hardware, our results demonstrate the potential of quantum machine learning to transform turbulence simulation and lay a solid foundation for scalable, real-time quantum fluid modeling in future quantum computers.

physics.flu-dynCross-listedarXiv:2511.18552•Nov 25, 2025•2 citations

Efficient Treatment of Non-Linearity in Quantum Computational Fluid Dynamics Using Hybrid Tensor Networks

Pia Siegl, Nis-Luca van Hülst, Maximilian Mandelt Buxadé +2 more

Nonlinear terms present a fundamental challenge for quantum computational fluid dynamics, as their implementation on inherently linear quantum hardware typically requires resource-intensive workarounds that limit scalability to large-scale simulations. We present a hybrid quantum-classical tensor network algorithm that addresses this bottleneck by combining variational time-stepping with quantum tensor programming to efficiently compile operators and time-dependent fields into quantum circuits. Within a probabilistic framework, we replace prior state-based nonlinear implementations with tensor-based block encodings, stabilizing success probabilities that otherwise decay exponentially with system size. Benchmarking on turbulent flow fields demonstrates that the algorithm maintains high success probabilities and moderate measurement overhead across increasing Reynolds numbers and grid resolutions. Compared to fully classical tensor network solvers, our hybrid approach yields substantial reductions in both memory footprint and computational cost, establishing a scalable pathway toward practical quantum advantage in scale-resolving CFD simulations.

quant-pharXiv:2608.24150•Aug 26, 2026•1 citation

Hybrid Quantum–Classical Variational Reconstruction of CFD Fields Using VQAs

Surbhi Sharma, Rashmi Bhardwaj, Debabrata Datta

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 $L_2$ 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.

Boletim da Sociedade Paranaense de Matemática•Apr 10, 2026•0 citations

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

Towards Hybrid Quantum-Classical Computing for Large-Scale CFD: Tackling Scalability Challenges of the Variational Quantum Linear Solver

Viraj Dsouza, Dhamotharan S, Tanishque Kumar +5 more

Quantum computing (QC) represents an emerging frontier with significant potential for transformative advancements in Computational Fluid Dynamics (CFD). This potential has been explicitly recognized by the CFD Vision 2030 report, emphasizing the strategic importance of exploring QC for future breakthroughs. Among quantum algorithms relevant to CFD, the Variational Quantum Linear Solver (VQLS) is particularly promising due to its suitability for solving linear and Hamiltonian-based problems, characteristic of fundamental CFD equations such as the pressure-Poisson equation. However, the practical implementation of VQLS for large-scale CFD problems faces critical scalability challenges, most notably the exponential increase in the number of quantum circuit evaluations and the barren plateau phenomenon, which severely hampers trainability and algorithm convergence. In this study, two novel strategies are introduced to address these challenges. First, we utilize a block encoding technique based on efficient oracles, thereby significantly reducing quantum circuit complexity and qubit overhead while accessing system matrix. Second, we incorporate a quantum-inspired evolutionary optimization (QIEO) approach, demonstrating enhanced training efficiency and effectively mitigating the barren plateau issue. These improvements are integrated within a Hybrid Quantum-Classical Method (HQCM) linear solver framework and demonstrated through solving a 2D steady-state heat equation, representative of the pressure-Poisson equations common in incompressible CFD simulations. The proposed methodologies yield promising results, showcasing improved circuit efficiency, enhanced stability during optimization, and accurate numerical solutions. This work lays a foundational step toward realizing practical, scalable quantum-assisted CFD solvers and sets clear pathways for future research aimed at further algorithmic and architectural enhancements.

AIAA AVIATION Forum•Jul 16, 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
Quantum computing promises exponential acceleration for fluid flow simulations, yet the measurement overhead required to extract flow features from quantum-encoded flow field data fundamentally undermines this advantage--a critical challenge termed the output problem''. To address this, we propose an orthogonal-polynomial-based quantum reduced-order model (PolyQROM) that integrates orthogonal polynomial basis transformations with variational quantum circuits (VQCs). PolyQROM employs optimized polynomial-based quantum operations to compress flow field data into low-dimensional representations while preserving essential features, enabling efficient quantum or classical post-processing for tasks like reconstruction and classification. By leveraging the mathematical properties of orthogonal polynomials, the framework enhances circuit expressivity and stabilizes training compared to conventional hardware-efficient VQCs. Numerical experiments demonstrate PolyQROM's effectiveness in reconstructing flow fields with high fidelity and classifying flow patterns with accuracy surpassing classical methods and quantum benchmarks, all while reducing computational complexity and parameter counts. The work bridges quantum simulation outputs with practical fluid analysis, addressing the output problem'' through efficient reduced-order modeling tailored for quantum-encoded flow data, offering a scalable pathway to exploit quantum advantages in computational fluid dynamics.
Accurately predicting turbulent flows remains a central challenge in fluid dynamics due to their high dimensionality and intrinsic nonlinearity. Recent developments in quantum algorithms and machine learning offer new opportunities for overcoming the computational barriers inherent in turbulence modeling. Here we present a new hybrid quantum-classical framework that enables faster-than-real-time turbulence prediction by integrating machine learning, quantum computation, and fluid dynamics modeling, in particular, the reduced-order modeling. The novel framework combines quantum proper orthogonal decomposition (QPOD) with a quantum-enhanced deep kernel learning (QDKL) approach. QPOD employs quantum circuits to perform efficient eigenvalue decomposition for low-rank flow reconstruction, while QDKL exploits quantum entanglement and nonlinear mappings to enhance kernel expressivity and dynamic prediction accuracy. The new method is demonstrated on three benchmark turbulent flows, our architecture achieves significantly improved predictive accuracy at reduced model ranks, with training speeds up to 10 times faster and parameter counts reduced by a factor of 1/N compared to classical counterparts, where N is the input dimensionality. Although constrained by current noisy intermediate-scale quantum (NISQ) hardware, our results demonstrate the potential of quantum machine learning to transform turbulence simulation and lay a solid foundation for scalable, real-time quantum fluid modeling in future quantum computers.
Nonlinear terms present a fundamental challenge for quantum computational fluid dynamics, as their implementation on inherently linear quantum hardware typically requires resource-intensive workarounds that limit scalability to large-scale simulations. We present a hybrid quantum-classical tensor network algorithm that addresses this bottleneck by combining variational time-stepping with quantum tensor programming to efficiently compile operators and time-dependent fields into quantum circuits. Within a probabilistic framework, we replace prior state-based nonlinear implementations with tensor-based block encodings, stabilizing success probabilities that otherwise decay exponentially with system size. Benchmarking on turbulent flow fields demonstrates that the algorithm maintains high success probabilities and moderate measurement overhead across increasing Reynolds numbers and grid resolutions. Compared to fully classical tensor network solvers, our hybrid approach yields substantial reductions in both memory footprint and computational cost, establishing a scalable pathway toward practical quantum advantage in scale-resolving CFD simulations.
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 L2L_2L2​ 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.
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.
Quantum computing (QC) represents an emerging frontier with significant potential for transformative advancements in Computational Fluid Dynamics (CFD). This potential has been explicitly recognized by the CFD Vision 2030 report, emphasizing the strategic importance of exploring QC for future breakthroughs. Among quantum algorithms relevant to CFD, the Variational Quantum Linear Solver (VQLS) is particularly promising due to its suitability for solving linear and Hamiltonian-based problems, characteristic of fundamental CFD equations such as the pressure-Poisson equation. However, the practical implementation of VQLS for large-scale CFD problems faces critical scalability challenges, most notably the exponential increase in the number of quantum circuit evaluations and the barren plateau phenomenon, which severely hampers trainability and algorithm convergence. In this study, two novel strategies are introduced to address these challenges. First, we utilize a block encoding technique based on efficient oracles, thereby significantly reducing quantum circuit complexity and qubit overhead while accessing system matrix. Second, we incorporate a quantum-inspired evolutionary optimization (QIEO) approach, demonstrating enhanced training efficiency and effectively mitigating the barren plateau issue. These improvements are integrated within a Hybrid Quantum-Classical Method (HQCM) linear solver framework and demonstrated through solving a 2D steady-state heat equation, representative of the pressure-Poisson equations common in incompressible CFD simulations. The proposed methodologies yield promising results, showcasing improved circuit efficiency, enhanced stability during optimization, and accurate numerical solutions. This work lays a foundational step toward realizing practical, scalable quantum-assisted CFD solvers and sets clear pathways for future research aimed at further algorithmic and architectural enhancements.
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.