A quantum algorithm estimates Fokker-Planck reaction rates with sublinear-time, polynomial-in-particle-number cost, giving an exponential-in-particle-number separation from the sharpest classical worst-case Langevin bounds.
Tight quantum depth lower bound for solving systems of linear equations
1 Pith paper cite this work, alongside 2 external citations. Polarity classification is still indexing.
1
Pith paper citing it
2
external citations · OpenAlex
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Provable Quantum Speedups for Reaction-Rate Estimation in High-Dimensional Fokker-Planck Dynamics
A quantum algorithm estimates Fokker-Planck reaction rates with sublinear-time, polynomial-in-particle-number cost, giving an exponential-in-particle-number separation from the sharpest classical worst-case Langevin bounds.