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:2512.07918 · Proceedings of the Combustion Institute

Quantum computing of nonlinear reacting flows via the probability density function method

Jizhi Zhang, Ziang Yang, Zhaoyuan Meng, Zhen Lu, Yue Yang

quant-phSubmitted Dec 8, 2025• Announced Dec 9, 2025• 1 citation• Revised Mar 15, 2026 (v2)
v1 · Dec 8, 2025v2 · Mar 15, 2026
arXivHTMLPDF

Abstract

Quantum computing offers the promise of speedups for scientific computations, but its application to reacting flows is hindered by nonlinear source terms, the challenges of time-dependent simulations, and the difficulty of extracting meaningful physical quantities from quantum states. We employ a probability density function (PDF) formulation to transform the nonlinear reacting-flow governing equations into high-dimensional linear ones. The entire temporal evolution is then solved as a single large linear system using the history state method, which avoids the measurement bottleneck of conventional time-marching schemes and fully leverages the advantages of quantum linear system algorithms. To extract the quantity of interest from the resulting quantum state, we develop an efficient algorithm to measure the statistical moments of the PDF, bypassing the need for costly full-state tomography. A computational complexity analysis shows that the measurement algorithm achieves a complexity polynomial in the logarithm of the system size using low-order polynomial approximations, compared to the exponential cost of the exact operator, thereby retaining the quantum advantage gained from solving the linear system. We validate the framework in two stages: an a priori test confirms the accuracy of the measurement algorithm on beta distributions with known analytical moments, and a perfectly stirred reactor simulation demonstrates the capability to capture the PDF evolution and statistics of a nonlinear reactive system. This work establishes a pathway for applying quantum computing to nonlinear reacting flows.

Related papers

Carleman Linearization Application for Chemical Reaction and Reacting Flow Toward Quantum Computing

Takaki Akiba, Youhi Morii, Minhyeok Lee +2 more

Reacting flows are governed by the conservation equations of mass, momentum, energy, and chemical species, and exhibit strong nonlinearity due to convection and chemical reactions. As quantum computers are inherently limited to linear operations, a bridging method is required to enable their application to such nonlinear systems. This study proposes an approach using the Carleman linearization to integrate quantum computing into reacting flow analysis, with a focus on the nonlinear temperature dependence described by the Arrhenius equation. To handle the exponential form of the reaction rate, a Taylor series expansion is employed. The present method is validated through numerical simulations of fuel ignition. The impacts of the truncation order in the Carleman linearization and the polynomial order in the Taylor expansion are systematically examined. The results demonstrate that higher-order approximations enhance the accuracy but may also introduce numerical stiffness. Overall, the findings confirm the validity and potential of the proposed framework for quantum-assisted reacting flow computations.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•0 citations

Quantum Homotopy Algorithm for Solving Nonlinear PDEs and Flow Problems

Sachin S. Bharadwaj, Balasubramanya Nadiga, Stephan Eidenbenz +1 more

Quantum algorithms to integrate nonlinear PDEs governing flow problems are challenging to discover but critical to enhancing the practical usefulness of quantum computing. We present a near-optimal, robust, and end-to-end quantum algorithm to solve time-dependent, dissipative, nonlinear PDEs. We embed the PDEs in a truncated, high-dimensional linear space on the basis of quantum homotopy analysis. The linearized system is discretized and integrated using finite-difference methods with a compact quantum algorithm. The present approach can adapt its input to the nature of nonlinearity and underlying physics. The complexity estimates improve existing approaches in terms of the time-marching system size, simulation time, accuracy parameters, and post-selection parameters. We provide a general embedding strategy, bounds on stability criteria, accuracy, gate counts, and query complexity. A physically motivated measure of nonlinearity is connected to a parameter similar to the flow Reynolds number $Re_{\textrm{H}}$, whose inverse marks the allowed integration window, for given accuracy and complexity. We illustrate the embedding scheme with numerical simulations of Burgers, Fisher--KPP, damped Kuramoto--Sivashinsky, and real Ginzburg--Landau/Allen--Cahn equations. Together, these examples encompass cubic nonlinearity and saturation, quadratic transport, and fourth-order dissipative stiffness. This work shows the potential of hybrid quantum algorithms for simulating nonlinear problems on near-term and fault-tolerant devices.

quant-pharXiv:2512.21033•Dec 25, 2025•4 citations

Efficient evaluation of Arrhenius rates for quantum computing applications in reactive flow problems using Carleman linearization

Takaki Akiba, Youhi Morii, Minhyeok Lee +2 more

This research introduces a novel approach toward integrating quantum computing into reactive flow analysis in combustion science, addressing the challenges posed by the nonlinear behavior of Arrhenius reaction rates. Combustion systems are described by nonlinear equations. Quantum computers, however, work based on linear algebra and are good at solving linear systems, necessitating a method to bridge this disparity. The study utilizes Carleman linearization, a technique that transforms nonlinear equations into linear ones, making them suitable for quantum algorithms. To address the exponential temperature dependence of Arrhenius rate constants, Taylor series expansions are employed. The method is validated through numerical simulations of ignition in H 2 /air and CH 4 /air mixtures. By examining the impact of truncation order in Carleman linearization and fitting order in the Taylor expansion, the study balances computational accuracy and cost. Results reveal that higher-order approximations improve accuracy but can introduce numerical stiffness, particularly in systems with high activation energies, such as CH 4 /air in this study. The findings highlight the trade-offs between computational feasibility and solution precision, emphasizing the importance of optimizing fitting and truncation parameters. This work establishes a critical foundation for applying quantum computing to combustion research.

Proceedings of the Combustion Institute•Jan 1, 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

Quantum simulation of Burgers turbulence: Nonlinear transformation and direct evaluation of statistical quantities

Fumio Uchida, Koichi Miyamoto, Soichiro Yamazaki +2 more

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 $\vertψ\rangle$ 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 $\vertψ\rangle$. 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.

arXiv:2412.17206•Dec 23, 2024•7 citations

Hybrid quantum algorithms for flow problems

Sachin S. Bharadwaj, Katepalli R. Sreenivasan

For quantum computing (QC) to emerge as a practically indispensable computational tool, there is a need for quantum protocols with end-to-end practical applications-in this instance, fluid dynamics. We debut here a high-performance quantum simulator which we term QFlowS (Quantum Flow Simulator), designed for fluid flow simulations using QC. Solving nonlinear flows by QC generally proceeds by solving an equivalent infinite dimensional linear system as a result of linear embedding. Thus, we first choose to simulate two well-known flows using QFlowS and demonstrate a previously unseen, full gate-level implementation of a hybrid and high precision Quantum Linear Systems Algorithms (QLSA) for simulating such flows at low Reynolds numbers. The utility of this simulator is demonstrated by extracting error estimates and power law scaling that relates [Formula: see text] (a parameter crucial to Hamiltonian simulations) to the condition number [Formula: see text] of the simulation matrix and allows the prediction of an optimal scaling parameter for accurate eigenvalue estimation. Further, we include two speedup preserving algorithms for a) the functional form or sparse quantum state preparation and b) in situ quantum postprocessing tool for computing nonlinear functions of the velocity field. We choose the viscous dissipation rate as an example, for which the end-to-end complexity is shown to be [Formula: see text], where [Formula: see text] is the size of the linear system of equations, [Formula: see text] is the solution error, and [Formula: see text] is the error in postprocessing. This work suggests a path toward quantum simulation of fluid flows and highlights the special considerations needed at the gate-level implementation of QC.

arXiv:2307.00391•Proceedings of the National Academy of Sciences•Dec 1, 2023•54 citations
Quantum computing offers the promise of speedups for scientific computations, but its application to reacting flows is hindered by nonlinear source terms, the challenges of time-dependent simulations, and the difficulty of extracting meaningful physical quantities from quantum states. We employ a probability density function (PDF) formulation to transform the nonlinear reacting-flow governing equations into high-dimensional linear ones. The entire temporal evolution is then solved as a single large linear system using the history state method, which avoids the measurement bottleneck of conventional time-marching schemes and fully leverages the advantages of quantum linear system algorithms. To extract the quantity of interest from the resulting quantum state, we develop an efficient algorithm to measure the statistical moments of the PDF, bypassing the need for costly full-state tomography. A computational complexity analysis shows that the measurement algorithm achieves a complexity polynomial in the logarithm of the system size using low-order polynomial approximations, compared to the exponential cost of the exact operator, thereby retaining the quantum advantage gained from solving the linear system. We validate the framework in two stages: an a priori test confirms the accuracy of the measurement algorithm on beta distributions with known analytical moments, and a perfectly stirred reactor simulation demonstrates the capability to capture the PDF evolution and statistics of a nonlinear reactive system. This work establishes a pathway for applying quantum computing to nonlinear reacting flows.
Reacting flows are governed by the conservation equations of mass, momentum, energy, and chemical species, and exhibit strong nonlinearity due to convection and chemical reactions. As quantum computers are inherently limited to linear operations, a bridging method is required to enable their application to such nonlinear systems. This study proposes an approach using the Carleman linearization to integrate quantum computing into reacting flow analysis, with a focus on the nonlinear temperature dependence described by the Arrhenius equation. To handle the exponential form of the reaction rate, a Taylor series expansion is employed. The present method is validated through numerical simulations of fuel ignition. The impacts of the truncation order in the Carleman linearization and the polynomial order in the Taylor expansion are systematically examined. The results demonstrate that higher-order approximations enhance the accuracy but may also introduce numerical stiffness. Overall, the findings confirm the validity and potential of the proposed framework for quantum-assisted reacting flow computations.
Quantum algorithms to integrate nonlinear PDEs governing flow problems are challenging to discover but critical to enhancing the practical usefulness of quantum computing. We present a near-optimal, robust, and end-to-end quantum algorithm to solve time-dependent, dissipative, nonlinear PDEs. We embed the PDEs in a truncated, high-dimensional linear space on the basis of quantum homotopy analysis. The linearized system is discretized and integrated using finite-difference methods with a compact quantum algorithm. The present approach can adapt its input to the nature of nonlinearity and underlying physics. The complexity estimates improve existing approaches in terms of the time-marching system size, simulation time, accuracy parameters, and post-selection parameters. We provide a general embedding strategy, bounds on stability criteria, accuracy, gate counts, and query complexity. A physically motivated measure of nonlinearity is connected to a parameter similar to the flow Reynolds number ReHRe_{\textrm{H}}ReH​, whose inverse marks the allowed integration window, for given accuracy and complexity. We illustrate the embedding scheme with numerical simulations of Burgers, Fisher--KPP, damped Kuramoto--Sivashinsky, and real Ginzburg--Landau/Allen--Cahn equations. Together, these examples encompass cubic nonlinearity and saturation, quadratic transport, and fourth-order dissipative stiffness. This work shows the potential of hybrid quantum algorithms for simulating nonlinear problems on near-term and fault-tolerant devices.
This research introduces a novel approach toward integrating quantum computing into reactive flow analysis in combustion science, addressing the challenges posed by the nonlinear behavior of Arrhenius reaction rates. Combustion systems are described by nonlinear equations. Quantum computers, however, work based on linear algebra and are good at solving linear systems, necessitating a method to bridge this disparity. The study utilizes Carleman linearization, a technique that transforms nonlinear equations into linear ones, making them suitable for quantum algorithms. To address the exponential temperature dependence of Arrhenius rate constants, Taylor series expansions are employed. The method is validated through numerical simulations of ignition in H 2 /air and CH 4 /air mixtures. By examining the impact of truncation order in Carleman linearization and fitting order in the Taylor expansion, the study balances computational accuracy and cost. Results reveal that higher-order approximations improve accuracy but can introduce numerical stiffness, particularly in systems with high activation energies, such as CH 4 /air in this study. The findings highlight the trade-offs between computational feasibility and solution precision, emphasizing the importance of optimizing fitting and truncation parameters. This work establishes a critical foundation for applying quantum computing to combustion research.
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.
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 uuu to a new field ψψψ, we apply a sequence of quantum gates to solve the resulting linear equation and obtain the quantum state ∣ψ⟩\vertψ\rangle∣ψ⟩ that encodes the solution ψψψ. We also propose an efficient way to extract stochastic properties of uuu, namely the multi-point functions of uuu, from the quantum state of ∣ψ⟩\vertψ\rangle∣ψ⟩. 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.
For quantum computing (QC) to emerge as a practically indispensable computational tool, there is a need for quantum protocols with end-to-end practical applications-in this instance, fluid dynamics. We debut here a high-performance quantum simulator which we term QFlowS (Quantum Flow Simulator), designed for fluid flow simulations using QC. Solving nonlinear flows by QC generally proceeds by solving an equivalent infinite dimensional linear system as a result of linear embedding. Thus, we first choose to simulate two well-known flows using QFlowS and demonstrate a previously unseen, full gate-level implementation of a hybrid and high precision Quantum Linear Systems Algorithms (QLSA) for simulating such flows at low Reynolds numbers. The utility of this simulator is demonstrated by extracting error estimates and power law scaling that relates [Formula: see text] (a parameter crucial to Hamiltonian simulations) to the condition number [Formula: see text] of the simulation matrix and allows the prediction of an optimal scaling parameter for accurate eigenvalue estimation. Further, we include two speedup preserving algorithms for a) the functional form or sparse quantum state preparation and b) in situ quantum postprocessing tool for computing nonlinear functions of the velocity field. We choose the viscous dissipation rate as an example, for which the end-to-end complexity is shown to be [Formula: see text], where [Formula: see text] is the size of the linear system of equations, [Formula: see text] is the solution error, and [Formula: see text] is the error in postprocessing. This work suggests a path toward quantum simulation of fluid flows and highlights the special considerations needed at the gate-level implementation of QC.