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

Provable Quantum Speedups for Reaction-Rate Estimation in High-Dimensional Fokker-Planck Dynamics

Tyler Kharazi, Ahmad M. Alkadri, Kranthi K. Mandadapu, K. Birgitta Whaley

quant-phSubmitted Jan 21, 2026• Announced Jan 23, 2026• 0 citations• Revised Jun 18, 2026 (v2)
v1 · Jan 21, 2026v2 · Jun 18, 2026
arXivHTMLPDF

Abstract

The Fokker-Planck equation models rare events across sciences, but blue{direct solution of the PDE is intractable for classical computers due to } its high-dimensional nature. Classical stochastic methods circumvent this curse-of-dimensionality, and serve as the de facto standard for practicing computational scientists. Quantum algorithms for such non-unitary dynamics often suffer from exponential decay in success probability. We introduce a quantum algorithm that overcomes this bottleneck for estimating reaction rates {and dynamical correlation functions more generally}. Using a sum-of-squares representation, we develop a Gaussian linear combination of Hamiltonian simulations (Gaussian-LCHS) to represent the non-unitary propagator with $O\left(\sqrt{t\|H\|\log(1/ε)}\right)$ queries to its block encoding. Crucially, we pair this with {a} novel technique to directly estimate matrix elements without exponential decay. For $η$ pairwise interacting particles discretized with $N$ plane waves per degree of freedom, we estimate reactive flux to error $ε$ using $\widetilde{O}\left((η^{5/2}\sqrt{tβ}α_V + η^{3/2}\sqrt{t/β}N)/ε\right)$ quantum gates, where $α_V = \max_{r}|V'(r)/r|$. We further prove that under comparable worst-case analytical guarantees, the sharpest classical bounds for estimating reaction rates via simulation of the associated overdamped Langevin dynamics scale as $O(tη^2 e^{Ω(η)}/ε^4)$, yielding an exponential improvement in $η$, a quartic speedup in $ε$, and quadratic speedup in the time horizon $t$. While classical algorithms may outperform these bounds in practice, this work demonstrates a rigorous route toward quantum advantage for high-dimensional dissipative dynamics.

Comments
Updated version, includes detailed resource analysis, planewave convergence results, and a construction for non-polynomial potentials. 79 pages, 14 figures

Related papers

Quantum Algorithms for Stochastic Differential Equations: Achieving Polynomial and Super-Polynomial Speedups for High-Dimensional Systems

Yalla Jnan Devi Satya Prasad

Stochastic differential equations (SDEs) model noisy dynamical systems across quantitative finance, chemistry, physics, and climate science. Classical solvers-Euler-Maruyama schemes, Monte Carlo methods, and finite-difference PDE solvers for Fokker-Planck equations-suffer from exponential growth in computational cost with dimension and accuracy requirements. We present a family of quantum algorithms for simulating and solving SDEs with improved scaling. Our approach combines Hamiltonian simulation for drift terms, quantum random number generation for noise increments, and quantum amplitude estimation for computing expectations. For linear and semilinear SDEs with Lipschitz coefficients, we prove that relevant quantities (option prices, expected hitting times, moments) can be estimated to accuracy ε in time Õ(poly(d)polylog(1/ε)), versus classical O(poly(d)/ε 2). For nonlinear SDEs, we introduce variational quantum schemes leveraging parameterized circuits, with a priori error bounds and trainability analysis avoiding barren plateaus. We analyze multi-asset Black-Scholes models, Heston stochastic volatility, and Langevin dynamics for molecular coarse-graining, quantifying resource requirements (qubits, gate depth, oracle calls). Numerical simulations on small instances demonstrate polynomial-to-super-polynomial empirical speedups in accuracy for fixed runtime, establishing SDE solving as a promising quantum-accelerated task with practical applications.

•Jan 5, 2026•0 citations

Efficient quantum algorithm for linear matrix differential equations and applications to open quantum systems

Sophia Simon, Dominic W. Berry, Rolando D. Somma

We present an efficient, nearly optimal quantum algorithm for solving linear matrix differential equations, with applications to the simulation of open quantum systems and beyond. For unitary or dissipative dynamics, the algorithm computes an entry of the solution matrix with query complexity $\widetilde{\mathcal{O}}(ν\mathcal{L} t/ε)$, where the constant $ν$ depends on the problem parameters, $\mathcal{L}$ involves a time integral of upper bounds on the norms of evolution operators, and $ε$ is the error. In particular, $ν\mathcal{L}$ is linear in $t$ for unitary dynamics and can be a constant for dissipative dynamics. Our result contrasts prior quantum approaches for differential equations that typically require exponential time for this problem due to the encoding in a quantum state, which can lead to exponentially small amplitudes. We demonstrate the utility of the algorithm through an end-to-end application, namely the simulation of dissipative dynamics for non-interacting fermions, which can be extended to other quantum and classical systems. We compare with classical algorithms and give evidence of polynomial quantum speedups for systems in a lattice, which become more pronounced for systems with long-range interactions and can be shown to be exponential in general. We also provide a lower bound of $Ω(ν\mathcal{L} t/ε)$ for unitary or dissipative dynamics that proves our algorithm is optimal up to logarithmic factors.

quant-pharXiv:2605.16195•May 18, 2026•0 citations

Quantum Algorithm for Subcellular Multiscale Reaction-Diffusion Systems

Lockwood, Margot, Nathan Wiebe, Connah Johnson +5 more

Computational modeling of cellular systems, where reactants are governed by biochemical equations and physical representations, requires extensive classical computing resources. These limitations significantly constrain the system size and spatiotemporal scales of simulations. A key challenge lies in the "curse of dimensionality", where the number of possible reaction terms grows exponentially with the number of species, and the computation of reaction rates involving many-body interactions becomes intractable in polynomial time on classical computers. In this work, we introduce a quantum algorithmic framework designed to overcome these challenges, leveraging the architecture of quantum computing to simultaneously compute reaction rates and track the spatiotemporal dynamical evolutions of subcellular systems. We generalize the reaction-diffusion equation (RDE) for multiscale systems with arbitrary species count, encompassing higher-order interactions. Our approach achieves two principal quantum advantages: (i) an exponential quantum speedup in reaction-rate computation, contingent on the efficient preparation of polynomially accurate ground states on a quantum computer, and (ii)) a quadratic scaling in spatial grid points and polynomial scaling in the number of species for solving nonlinear RDEs, contrasting sharply with classical methods that scale exponentially with the system's degrees of freedom. To our knowledge, this represents the first efficient quantum algorithm for solving multiscale reaction-diffusion systems. This framework opens the door to simulations of biologically relevant subcellular processes across previously inaccessible spatial and temporal scales, with profound implications for computational biology, soft matter physics, and biophysical modeling.

arXiv:2509.20668•Sep 25, 2025•0 citations

Quantum Simulation of Dissipative Non-Markovian Coupled Classical Oscillators

Malte Schade, Sophia Simon, Nathan Wiebe +3 more

We present a quantum algorithm for simulating classical oscillator networks characterized by non-Markovian dissipation and time-varying material properties, extending recent speedups for undamped harmonic systems to viscoacoustic and viscoelastic media. We embed the history-dependent dynamics into a Markovian state space governed by a non-Hermitian operator by approximating memory kernels through a Prony series. We then use linear combination of Hamiltonian simulation to estimate the instantaneous kinetic and potential energy for a subset of oscillators at time $t$ within error $ε$ using a number of queries to the oscillator system that scales as $\widetilde{\mathcal{O}}(α_{\rm tot} t/ε)$, where $α_{\rm tot}$ is polynomial in the strength of the dissipation, spring constants, inverse masses, and sparsity of the connections in the network. We further show that this energy estimation task is in the worst-case classically hard (i.e., a corresponding decision problem is $\mathsf{BQP}$-complete), even in the presence of strong dissipation. For time-dependent materials, we show that changes in material properties appear as effective dissipation or growth in the energy representation. Additionally, we prove the infeasibility of exponential quantum advantages in locally coupled topologies through a novel form of Lieb-Robinson-like bounds that apply to differential equations. This allows our quantum algorithms to provide quartic speedups for locally coupled damped oscillator systems in three dimensions, raising the possibility of practical quantum speedups for realistically damped oscillator networks and approximated wave equations.

quant-pharXiv:2609.20721•Sep 18, 2026•0 citations

Efficient Quantum Algorithms for Nonlinear Stochastic Dynamical Systems

Abeynaya Gnanasekaran, Amit Surana, Tuhin Sahai

In this paper, we propose efficient quantum algorithms for solving nonlinear stochastic differential equations (SDE) via the associated Fokker-Planck equation (FPE). We discretize the FPE in space and time using two well-known numerical schemes, namely Chang-Cooper and implicit finite difference. We then compute the solution of the resulting system of linear equations using the quantum linear systems algorithm. We present detailed error and complexity analyses for both these schemes and demonstrate that our proposed algorithms, under certain conditions, provably compute the solution to the FPE within prescribed$\epsilon$error bounds with polynomial dependence on state dimension$d$. Classical numerical methods scale exponentially with dimension, thus, our approach, under the aforementioned conditions, provides an exponential speed-up over traditional approaches.

arXiv:2303.02463•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•4 citations

Efficient Quantum Simulation for Nonlinear Stochastic Differential Equations

Xiangyu Li, Ahmet Burak Catli, Ho Kiat Lim +4 more

Nonlinear stochastic differential equations (NSDEs) are a pillar of mathematical modeling for scientific and engineering applications. Accurate and efficient simulation of large-scale NSDEs is prohibitive on classical computers due to the large number of degrees of freedom, and it is challenging on quantum computers due to the linear and unitary nature of quantum mechanics. We develop a quantum algorithm to tackle nonlinear differential equations driven by the Ornstein-Uhlenbeck (OU) stochastic process. The query complexity of our algorithm scales logarithmically with the error tolerance and nearly quadratically with the simulation time. Our algorithmic framework comprises probabilistic Carleman linearization (PCL) to tackle nonlinearity coupled with stochasticity, and stochastic linear combination of Hamiltonian simulations (SLCHS) to simulate stochastic non-unitary dynamics. We obtain probabilistic exponential convergence for the Carleman linearization of Liu et al. [1], provided the NSDE is stable and reaches a steady state. We extend deterministic LCHS to stochastic linear differential equations, retaining near-optimal parameter scaling from An et al. [2] except for the nearly quadratic time scaling. This is achieved by using Monte Carlo integration for time discretization of both the stochastic inhomogeneous term in LCHS and the truncated Dyson series for each Hamiltonian simulation.

quant-pharXiv:2603.12398•Mar 16, 2026•0 citations
The Fokker-Planck equation models rare events across sciences, but blue{direct solution of the PDE is intractable for classical computers due to } its high-dimensional nature. Classical stochastic methods circumvent this curse-of-dimensionality, and serve as the de facto standard for practicing computational scientists. Quantum algorithms for such non-unitary dynamics often suffer from exponential decay in success probability. We introduce a quantum algorithm that overcomes this bottleneck for estimating reaction rates {and dynamical correlation functions more generally}. Using a sum-of-squares representation, we develop a Gaussian linear combination of Hamiltonian simulations (Gaussian-LCHS) to represent the non-unitary propagator with O(t∥H∥log⁡(1/ε))O\left(\sqrt{t\|H\|\log(1/ε)}\right)O(t∥H∥log(1/ε)​) queries to its block encoding. Crucially, we pair this with {a} novel technique to directly estimate matrix elements without exponential decay. For ηηη pairwise interacting particles discretized with NNN plane waves per degree of freedom, we estimate reactive flux to error εεε using O~((η5/2tβαV+η3/2t/βN)/ε)\widetilde{O}\left((η^{5/2}\sqrt{tβ}α_V + η^{3/2}\sqrt{t/β}N)/ε\right)O((η5/2tβ​αV​+η3/2t/β​N)/ε) quantum gates, where αV=max⁡r∣V′(r)/r∣α_V = \max_{r}|V'(r)/r|αV​=maxr​∣V′(r)/r∣. We further prove that under comparable worst-case analytical guarantees, the sharpest classical bounds for estimating reaction rates via simulation of the associated overdamped Langevin dynamics scale as O(tη2eΩ(η)/ε4)O(tη^2 e^{Ω(η)}/ε^4)O(tη2eΩ(η)/ε4), yielding an exponential improvement in ηηη, a quartic speedup in εεε, and quadratic speedup in the time horizon ttt. While classical algorithms may outperform these bounds in practice, this work demonstrates a rigorous route toward quantum advantage for high-dimensional dissipative dynamics.
Stochastic differential equations (SDEs) model noisy dynamical systems across quantitative finance, chemistry, physics, and climate science. Classical solvers-Euler-Maruyama schemes, Monte Carlo methods, and finite-difference PDE solvers for Fokker-Planck equations-suffer from exponential growth in computational cost with dimension and accuracy requirements. We present a family of quantum algorithms for simulating and solving SDEs with improved scaling. Our approach combines Hamiltonian simulation for drift terms, quantum random number generation for noise increments, and quantum amplitude estimation for computing expectations. For linear and semilinear SDEs with Lipschitz coefficients, we prove that relevant quantities (option prices, expected hitting times, moments) can be estimated to accuracy ε in time Õ(poly(d)polylog(1/ε)), versus classical O(poly(d)/ε 2). For nonlinear SDEs, we introduce variational quantum schemes leveraging parameterized circuits, with a priori error bounds and trainability analysis avoiding barren plateaus. We analyze multi-asset Black-Scholes models, Heston stochastic volatility, and Langevin dynamics for molecular coarse-graining, quantifying resource requirements (qubits, gate depth, oracle calls). Numerical simulations on small instances demonstrate polynomial-to-super-polynomial empirical speedups in accuracy for fixed runtime, establishing SDE solving as a promising quantum-accelerated task with practical applications.
We present an efficient, nearly optimal quantum algorithm for solving linear matrix differential equations, with applications to the simulation of open quantum systems and beyond. For unitary or dissipative dynamics, the algorithm computes an entry of the solution matrix with query complexity O~(νLt/ε)\widetilde{\mathcal{O}}(ν\mathcal{L} t/ε)O(νLt/ε), where the constant ννν depends on the problem parameters, L\mathcal{L}L involves a time integral of upper bounds on the norms of evolution operators, and εεε is the error. In particular, νLν\mathcal{L}νL is linear in ttt for unitary dynamics and can be a constant for dissipative dynamics. Our result contrasts prior quantum approaches for differential equations that typically require exponential time for this problem due to the encoding in a quantum state, which can lead to exponentially small amplitudes. We demonstrate the utility of the algorithm through an end-to-end application, namely the simulation of dissipative dynamics for non-interacting fermions, which can be extended to other quantum and classical systems. We compare with classical algorithms and give evidence of polynomial quantum speedups for systems in a lattice, which become more pronounced for systems with long-range interactions and can be shown to be exponential in general. We also provide a lower bound of Ω(νLt/ε)Ω(ν\mathcal{L} t/ε)Ω(νLt/ε) for unitary or dissipative dynamics that proves our algorithm is optimal up to logarithmic factors.
Computational modeling of cellular systems, where reactants are governed by biochemical equations and physical representations, requires extensive classical computing resources. These limitations significantly constrain the system size and spatiotemporal scales of simulations. A key challenge lies in the "curse of dimensionality", where the number of possible reaction terms grows exponentially with the number of species, and the computation of reaction rates involving many-body interactions becomes intractable in polynomial time on classical computers. In this work, we introduce a quantum algorithmic framework designed to overcome these challenges, leveraging the architecture of quantum computing to simultaneously compute reaction rates and track the spatiotemporal dynamical evolutions of subcellular systems. We generalize the reaction-diffusion equation (RDE) for multiscale systems with arbitrary species count, encompassing higher-order interactions. Our approach achieves two principal quantum advantages: (i) an exponential quantum speedup in reaction-rate computation, contingent on the efficient preparation of polynomially accurate ground states on a quantum computer, and (ii)) a quadratic scaling in spatial grid points and polynomial scaling in the number of species for solving nonlinear RDEs, contrasting sharply with classical methods that scale exponentially with the system's degrees of freedom. To our knowledge, this represents the first efficient quantum algorithm for solving multiscale reaction-diffusion systems. This framework opens the door to simulations of biologically relevant subcellular processes across previously inaccessible spatial and temporal scales, with profound implications for computational biology, soft matter physics, and biophysical modeling.
We present a quantum algorithm for simulating classical oscillator networks characterized by non-Markovian dissipation and time-varying material properties, extending recent speedups for undamped harmonic systems to viscoacoustic and viscoelastic media. We embed the history-dependent dynamics into a Markovian state space governed by a non-Hermitian operator by approximating memory kernels through a Prony series. We then use linear combination of Hamiltonian simulation to estimate the instantaneous kinetic and potential energy for a subset of oscillators at time ttt within error εεε using a number of queries to the oscillator system that scales as O~(αtott/ε)\widetilde{\mathcal{O}}(α_{\rm tot} t/ε)O(αtot​t/ε), where αtotα_{\rm tot}αtot​ is polynomial in the strength of the dissipation, spring constants, inverse masses, and sparsity of the connections in the network. We further show that this energy estimation task is in the worst-case classically hard (i.e., a corresponding decision problem is BQP\mathsf{BQP}BQP-complete), even in the presence of strong dissipation. For time-dependent materials, we show that changes in material properties appear as effective dissipation or growth in the energy representation. Additionally, we prove the infeasibility of exponential quantum advantages in locally coupled topologies through a novel form of Lieb-Robinson-like bounds that apply to differential equations. This allows our quantum algorithms to provide quartic speedups for locally coupled damped oscillator systems in three dimensions, raising the possibility of practical quantum speedups for realistically damped oscillator networks and approximated wave equations.
In this paper, we propose efficient quantum algorithms for solving nonlinear stochastic differential equations (SDE) via the associated Fokker-Planck equation (FPE). We discretize the FPE in space and time using two well-known numerical schemes, namely Chang-Cooper and implicit finite difference. We then compute the solution of the resulting system of linear equations using the quantum linear systems algorithm. We present detailed error and complexity analyses for both these schemes and demonstrate that our proposed algorithms, under certain conditions, provably compute the solution to the FPE within prescribedϵ\epsilonϵerror bounds with polynomial dependence on state dimensionddd. Classical numerical methods scale exponentially with dimension, thus, our approach, under the aforementioned conditions, provides an exponential speed-up over traditional approaches.
Nonlinear stochastic differential equations (NSDEs) are a pillar of mathematical modeling for scientific and engineering applications. Accurate and efficient simulation of large-scale NSDEs is prohibitive on classical computers due to the large number of degrees of freedom, and it is challenging on quantum computers due to the linear and unitary nature of quantum mechanics. We develop a quantum algorithm to tackle nonlinear differential equations driven by the Ornstein-Uhlenbeck (OU) stochastic process. The query complexity of our algorithm scales logarithmically with the error tolerance and nearly quadratically with the simulation time. Our algorithmic framework comprises probabilistic Carleman linearization (PCL) to tackle nonlinearity coupled with stochasticity, and stochastic linear combination of Hamiltonian simulations (SLCHS) to simulate stochastic non-unitary dynamics. We obtain probabilistic exponential convergence for the Carleman linearization of Liu et al. [1], provided the NSDE is stable and reaches a steady state. We extend deterministic LCHS to stochastic linear differential equations, retaining near-optimal parameter scaling from An et al. [2] except for the nearly quadratic time scaling. This is achieved by using Monte Carlo integration for time discretization of both the stochastic inhomogeneous term in LCHS and the truncated Dyson series for each Hamiltonian simulation.