From Quantum Tunneling to Classical Optimization through Instantons
Abstract
We use an instanton-based analysis to show that Path Integral Stochastic Gradient Descent (PISGD), a classical optimization algorithm instantiated from path integral Monte Carlo (PIMC), can inherit the quantum tunneling mechanism. Quantum tunneling is the phenomenon in which a quantum particle passes through a potential barrier that a classical trajectory cannot cross in the same way. This mechanism can contribute to the performance of quantum optimization algorithms, since a common bottleneck in optimization is that the solution becomes trapped in a local minimum, separated from better solutions by a potential barrier. Classical noise-driven optimizers, such as stochastic gradient descent (SGD), have escape times that scale exponentially with the potential barrier height. For quantum tunneling, the escape time is instead exponential in the bounce action, which equals twice the Agmon distance between the two basins. When the barrier is tall but thin, quantum tunneling can allow escaping local minima faster than such classical methods. Remarkably, this scaling is not exclusive to algorithms with genuine quantum dynamics. For PISGD applied to classical nonconvex global optimization, we adapt Kramers' escape-rate theory to path space and obtain the same exponential scaling as quantum tunneling, in terms of the bounce action rather than the barrier height. We confirm this scaling numerically by implementing PISGD for both separable and nonseparable potentials. That said, PISGD retains only incoherent tunneling, since coherence among multiple tunneling paths is absent. Our analysis therefore does not rule out a potential quantum advantage for quantum-tunneling-based algorithms over classical ones in general.
Related
- Quantum Tunneling and the Emergence of Classical Spacetime in Einstein-Æther Quantum Cosmology
- Extracting the anyonic exchange phase from co-tunneling through an open quantum dot
- Creation of an inflationary epoch from an Emergent Universe through quantum tunneling
- Quantum-Classical Hybrid Methods for Optimization: Lessons from Classical Decomposition
- Hybrid Quantum-Classical Optimization for Emergency-Priority Traffic Signal Control
BibTeX
@misc{shen2026from,
title = {{From Quantum Tunneling to Classical Optimization through Instantons}},
author = {Jiayu Shen and Dylan Herman and Guneykan Ozgul and Akshay Seshadri and Junhyung Lyle Kim and Shree Hari Sureshbabu and Shouvanik Chakrabarti and Niraj Kumar},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.06797},
eprint = {2610.06797},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.06797},
}
RIS
TY - UNPB
TI - From Quantum Tunneling to Classical Optimization through Instantons
AU - Jiayu Shen
AU - Dylan Herman
AU - Guneykan Ozgul
AU - Akshay Seshadri
AU - Junhyung Lyle Kim
AU - Shree Hari Sureshbabu
AU - Shouvanik Chakrabarti
AU - Niraj Kumar
PY - 2026
DA - 2026/10/05
PB - arXiv
DO - 10.48550/arxiv.2610.06797
UR - https://arxiv.org/abs/2610.06797
AB - We use an instanton-based analysis to show that Path Integral Stochastic Gradient Descent (PISGD), a classical optimization algorithm instantiated from path integral Monte Carlo (PIMC), can inherit the quantum tunneling mechanism. Quantum tunneling is the phenomenon in which a quantum particle passes through a potential barrier that a classical trajectory cannot cross in the same way. This mechanism can contribute to the performance of quantum optimization algorithms, since a common bottleneck in optimization is that the solution becomes trapped in a local minimum, separated from better solutions by a potential barrier. Classical noise-driven optimizers, such as stochastic gradient descent (SGD), have escape times that scale exponentially with the potential barrier height. For quantum tunneling, the escape time is instead exponential in the bounce action, which equals twice the Agmon distance between the two basins. When the barrier is tall but thin, quantum tunneling can allow escaping local minima faster than such classical methods. Remarkably, this scaling is not exclusive to algorithms with genuine quantum dynamics. For PISGD applied to classical nonconvex global optimization, we adapt Kramers' escape-rate theory to path space and obtain the same exponential scaling as quantum tunneling, in terms of the bounce action rather than the barrier height. We confirm this scaling numerically by implementing PISGD for both separable and nonseparable potentials. That said, PISGD retains only incoherent tunneling, since coherence among multiple tunneling paths is absent. Our analysis therefore does not rule out a potential quantum advantage for quantum-tunneling-based algorithms over classical ones in general.
ER -