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:2207.01818 · Scientific Reports

Carleman linearization approach for chemical kinetics integration toward quantum computation

Takaki Akiba, Youhi Morii, Kaoru Maruta

Published Mar 9, 2023• 21 citations
arXivHTMLPDF

Abstract

Abstract The Harrow, Hassidim, Lloyd (HHL) algorithm, known as the pioneering algorithm for solving linear equations in quantum computers, is expected to accelerate solving large-scale linear ordinary differential equations (ODEs). To efficiently combine classical and quantum computers for high-cost chemical problems, non-linear ODEs (e.g., chemical reactions) must be linearized to the highest possible accuracy. However, the linearization approach has not been fully established yet. In this study, Carleman linearization was examined to transform nonlinear first-order ODEs of chemical reactions into linear ODEs. Although this linearization theoretically requires the generation of an infinite matrix, the original nonlinear equations can be reconstructed. For the practical use, the linearized system should be truncated with finite size and the extent of the truncation determines analysis precision. Matrix should be sufficiently large so that the precision is satisfied because quantum computers can treat such huge matrix. Our method was applied to a one-variable nonlinear $$\dot{y}=-{y}^{2}$$ y ˙ = - y 2 system to investigate the effect of truncation orders and time step sizes on the computational error. Subsequently, two zero-dimensional homogeneous ignition problems for H 2 –air and CH 4 –air gas mixtures were solved. The results revealed that the proposed method could accurately reproduce reference data. Furthermore, an increase in the truncation order improved accuracy with large time-step sizes. Thus, our approach can provide accurate numerical simulations rapidly for complex combustion systems.

DOI
10.1038/s41598-023-31009-9

Related papers

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

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 algorithm for high-dimensional nonlinear stochastic differential equations based on Carleman linearization

Koichi Miyamoto

Addressing nonlinear numerical problems in quantum computing remains challenging, but several approaches, including Carleman linearization (CL), have been proposed to construct quantum algorithms for such problems. In this work, we develop a CL-based method for a high-dimensional nonlinear stochastic differential equation (SDE) $\mathrm{d} \mathbf{X}_t = \left(A(t) \mathbf{X}_t + F(t) \mathbf{X}_t^{\otimes s}\right) \mathrm{d} t + B(t) \mathrm{d} \mathbf{W}_t$ for an $\mathbb{R}^N$-valued random process $\mathbf{X}_t$, aiming at quantum speed-up with respect to the dimension $N$. We introduce auxiliary processes $\mathbf{Y}^j_t$ that approximate $\mathbf{X}_t^{\otimes j}$, derive a linearized system of SDEs for them, and obtain the linear ordinary differential equation (ODE) governing their expectations. We then apply a quantum ODE solver to it and, from the resulting quantum state, extract an estimate for the expectation of a linear function of $\mathbf{X}_t$ by overlap estimation. We show that, provided the nonlinear and noise terms in the SDE are sufficiently small relative to the linear term, the CL error decreases exponentially with the truncation order $J$ in CL, and we can estimate the target expectation with a ${\rm polylog}(N)$ number of queries to unitaries encoding coefficient matrices $A$, $F$, and $B$. Finally, we also run a numerical demonstration for an SDE related to Langevin dynamics, observing the exponential decay of the CL error as $J$ increases.

quant-pharXiv:2610.27416•Oct 21, 2026•0 citations

Two Quantum Algorithms for Nonlinear Reaction-Diffusion Equation using Chebyshev Approximation Method

Manish Kumar

We present two new quantum algorithms for reaction-diffusion equations that employ the truncated Chebyshev polynomial approximation. This method is employed to numerically solve the ordinary differential equation emerging from the linearization of the associated nonlinear differential equation. In the first algorithm, we use the matrix exponentiation method (Patel et al., 2018), while in the second algorithm, we repurpose the quantum spectral method (Childs et al., 2020). Our main technical contribution is to derive the sufficient conditions for the diagonalization of the Carleman embedding matrix, which is indispensable for designing both quantum algorithms. We supplement this with an efficient iterative algorithm to diagonalize the Carleman matrix. Our first algorithm has gate complexity of O(d$\cdot$log(d)+T$\cdot$polylog(T/$\varepsilon$)). Here $d$ is the size of the Carleman matrix, $T$ is the simulation time, and $\varepsilon$ is the approximation error. The second algorithm is polynomial in $log(d)$, $T$, and $log(1/\varepsilon)$ - the gate complexity scales as O(polylog(d)$\cdot$T$\cdot$polylog(T/$\varepsilon$)). In terms of $T$ and $\varepsilon$, this is comparable to the speedup gained by the current best known quantum algorithm for this problem, the truncated Taylor series method (Costa et.al., 2025). Our approach has two shortcomings. First, we have not provided an upper bound, in terms of d, on the condition number of the Carleman matrix. Second, the success of the diagonalization is based on a conjecture that a specific trigonometric equation has no integral solution. However, we provide strategies to mitigate these shortcomings in most practical cases.

arXiv:2510.19855•Oct 21, 2025•1 citation

Quantum Algorithms for Nonlinear Differential Equations via Pivot-Shifted Carleman Linearization

Ke Wang, Zikang Jia, Shravan Veerapaneni +1 more

We develop a pivot-shifted Carleman linearization framework for quantum algorithms solving quadratic nonlinear ordinary differential equations. By shifting the dynamics by a pivot state prior to Carleman lifting, and combining this with a Lyapunov transform and rescaling, we enlarge the class of nonlinear systems that can be efficiently simulated on quantum computers. For systems that exhibit stability in the shifted coordinates, we establish long time convergence of the truncated Carleman embedding. We prove that the truncation order scales only logarithmically with the simulation time and target precision, and we derive end-to-end quantum query complexity bounds for preparing a state proportional to the final solution. By introducing a modified nonlinearity condition, this framework entirely removes the conventional lower bound requirement on the initial condition. For more general systems that remain unstable after shifting, we provide short time convergence guarantees that are similarly free from the initial condition constraints. Numerical experiments on the logistic and the Lotka-Volterra equations demonstrate that an appropriate pivot choice improves stability and accuracy, and yields exponential error decay with truncation order. These results show that pivot shifting provides a practical and theoretically justified route for extending Carleman-based quantum algorithms to a broader class of nonlinear dynamical systems.

quant-pharXiv:2605.20071•May 20, 2026•5 citations

Quantum Solution for Nonlinear Differential Equations: Carleman and Liouville Linearization

Alexander Habel, Nils Klement, Veronika Eyring +1 more

Nonlinear differential equations underlie many scientific fields, yet classical solvers scale poorly with increasing resolution. Quantum linear systems algorithms (QLSAs), such as Harrow-Hassidim-Lloyd (HHL), can offer asymptotic advantages for sparse, well-conditioned linear systems. However, they do not directly treat nonlinear dynamics. We study two linearization techniques—Carleman linearization and Liouville linearization—as preprocessors for prospective QLSA use. We assess the stability of the linearization step on two models with bounded phase spaces and single- or multi-attractor dynamics. Carleman linearization tracks single trajectories until truncation error dominates. The Liouville ensemble formulation, especially with narrow initial distributions, captures multi-basin splitting and trajectory statistics while providing built-in uncertainty quantification. These results suggest that Liouville may offer broader practical applicability as a QLSA preprocessor, particularly in regimes not covered by existing efficiency guarantees for Carleman linearization.

IEEE International Conference on Quantum Artificial Intelligence (QAI)•Nov 2, 2025•0 citations
Abstract The Harrow, Hassidim, Lloyd (HHL) algorithm, known as the pioneering algorithm for solving linear equations in quantum computers, is expected to accelerate solving large-scale linear ordinary differential equations (ODEs). To efficiently combine classical and quantum computers for high-cost chemical problems, non-linear ODEs (e.g., chemical reactions) must be linearized to the highest possible accuracy. However, the linearization approach has not been fully established yet. In this study, Carleman linearization was examined to transform nonlinear first-order ODEs of chemical reactions into linear ODEs. Although this linearization theoretically requires the generation of an infinite matrix, the original nonlinear equations can be reconstructed. For the practical use, the linearized system should be truncated with finite size and the extent of the truncation determines analysis precision. Matrix should be sufficiently large so that the precision is satisfied because quantum computers can treat such huge matrix. Our method was applied to a one-variable nonlinear y˙=−y2\dot{y}=-{y}^{2}y˙​=−y2 y ˙ = - y 2 system to investigate the effect of truncation orders and time step sizes on the computational error. Subsequently, two zero-dimensional homogeneous ignition problems for H 2 –air and CH 4 –air gas mixtures were solved. The results revealed that the proposed method could accurately reproduce reference data. Furthermore, an increase in the truncation order improved accuracy with large time-step sizes. Thus, our approach can provide accurate numerical simulations rapidly for complex combustion systems.
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.
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.
Addressing nonlinear numerical problems in quantum computing remains challenging, but several approaches, including Carleman linearization (CL), have been proposed to construct quantum algorithms for such problems. In this work, we develop a CL-based method for a high-dimensional nonlinear stochastic differential equation (SDE) dXt=(A(t)Xt+F(t)Xt⊗s)dt+B(t)dWt\mathrm{d} \mathbf{X}_t = \left(A(t) \mathbf{X}_t + F(t) \mathbf{X}_t^{\otimes s}\right) \mathrm{d} t + B(t) \mathrm{d} \mathbf{W}_tdXt​=(A(t)Xt​+F(t)Xt⊗s​)dt+B(t)dWt​ for an RN\mathbb{R}^NRN-valued random process Xt\mathbf{X}_tXt​, aiming at quantum speed-up with respect to the dimension NNN. We introduce auxiliary processes Ytj\mathbf{Y}^j_tYtj​ that approximate Xt⊗j\mathbf{X}_t^{\otimes j}Xt⊗j​, derive a linearized system of SDEs for them, and obtain the linear ordinary differential equation (ODE) governing their expectations. We then apply a quantum ODE solver to it and, from the resulting quantum state, extract an estimate for the expectation of a linear function of Xt\mathbf{X}_tXt​ by overlap estimation. We show that, provided the nonlinear and noise terms in the SDE are sufficiently small relative to the linear term, the CL error decreases exponentially with the truncation order JJJ in CL, and we can estimate the target expectation with a polylog(N){\rm polylog}(N)polylog(N) number of queries to unitaries encoding coefficient matrices AAA, FFF, and BBB. Finally, we also run a numerical demonstration for an SDE related to Langevin dynamics, observing the exponential decay of the CL error as JJJ increases.
We present two new quantum algorithms for reaction-diffusion equations that employ the truncated Chebyshev polynomial approximation. This method is employed to numerically solve the ordinary differential equation emerging from the linearization of the associated nonlinear differential equation. In the first algorithm, we use the matrix exponentiation method (Patel et al., 2018), while in the second algorithm, we repurpose the quantum spectral method (Childs et al., 2020). Our main technical contribution is to derive the sufficient conditions for the diagonalization of the Carleman embedding matrix, which is indispensable for designing both quantum algorithms. We supplement this with an efficient iterative algorithm to diagonalize the Carleman matrix. Our first algorithm has gate complexity of O(d⋅\cdot⋅log(d)+T⋅\cdot⋅polylog(T/ε\varepsilonε)). Here ddd is the size of the Carleman matrix, TTT is the simulation time, and ε\varepsilonε is the approximation error. The second algorithm is polynomial in log(d)log(d)log(d), TTT, and log(1/ε)log(1/\varepsilon)log(1/ε) - the gate complexity scales as O(polylog(d)⋅\cdot⋅T⋅\cdot⋅polylog(T/ε\varepsilonε)). In terms of TTT and ε\varepsilonε, this is comparable to the speedup gained by the current best known quantum algorithm for this problem, the truncated Taylor series method (Costa et.al., 2025). Our approach has two shortcomings. First, we have not provided an upper bound, in terms of d, on the condition number of the Carleman matrix. Second, the success of the diagonalization is based on a conjecture that a specific trigonometric equation has no integral solution. However, we provide strategies to mitigate these shortcomings in most practical cases.
We develop a pivot-shifted Carleman linearization framework for quantum algorithms solving quadratic nonlinear ordinary differential equations. By shifting the dynamics by a pivot state prior to Carleman lifting, and combining this with a Lyapunov transform and rescaling, we enlarge the class of nonlinear systems that can be efficiently simulated on quantum computers. For systems that exhibit stability in the shifted coordinates, we establish long time convergence of the truncated Carleman embedding. We prove that the truncation order scales only logarithmically with the simulation time and target precision, and we derive end-to-end quantum query complexity bounds for preparing a state proportional to the final solution. By introducing a modified nonlinearity condition, this framework entirely removes the conventional lower bound requirement on the initial condition. For more general systems that remain unstable after shifting, we provide short time convergence guarantees that are similarly free from the initial condition constraints. Numerical experiments on the logistic and the Lotka-Volterra equations demonstrate that an appropriate pivot choice improves stability and accuracy, and yields exponential error decay with truncation order. These results show that pivot shifting provides a practical and theoretically justified route for extending Carleman-based quantum algorithms to a broader class of nonlinear dynamical systems.
Nonlinear differential equations underlie many scientific fields, yet classical solvers scale poorly with increasing resolution. Quantum linear systems algorithms (QLSAs), such as Harrow-Hassidim-Lloyd (HHL), can offer asymptotic advantages for sparse, well-conditioned linear systems. However, they do not directly treat nonlinear dynamics. We study two linearization techniques—Carleman linearization and Liouville linearization—as preprocessors for prospective QLSA use. We assess the stability of the linearization step on two models with bounded phase spaces and single- or multi-attractor dynamics. Carleman linearization tracks single trajectories until truncation error dominates. The Liouville ensemble formulation, especially with narrow initial distributions, captures multi-basin splitting and trajectory statistics while providing built-in uncertainty quantification. These results suggest that Liouville may offer broader practical applicability as a QLSA preprocessor, particularly in regimes not covered by existing efficiency guarantees for Carleman linearization.