Quantum Langevin Dynamics for Optimization
Not on the map. Why?
Abstract (arXiv)
We initiate the study of utilizing Quantum Langevin Dynamics (QLD) to solve optimization problems, particularly those non-convex objective functions that present substantial obstacles for traditional gradient descent algorithms. Specifically, we examine the dynamics of a system coupled with an infinite heat bath. This interaction induces both random quantum noise and a deterministic damping effect to the system, which nudge the system towards a steady state that hovers near the global minimum of objective functions. We theoretically prove the convergence of QLD in convex landscapes, demonstrating that the average energy of the system can approach zero in the low temperature limit with an exponential decay rate correlated with the evolution time. Numerically, we first show the energy dissipation capability of QLD by retracing its origins to spontaneous emission. Furthermore, we conduct detailed discussion of the impact of each parameter. Finally, based on the observations when comparing QLD with classical Fokker-Plank-Smoluchowski equation, we propose a time-dependent QLD by making temperature and hbar time-dependent parameters, which can be theoretically proven to converge better than the time-independent case and also outperforms a series of state-of-the-art quantum and classical optimization algorithms in many non-convex landscapes.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 28 of its 83 references that are in the map. First posted on arXiv 27 Nov 2023.
Builds on
28 of 83 references.
References · 28
- 2016An overview of gradient descent optimization algorithmscited by 1,033
- 2014Stochastic Gradient Hamiltonian Monte Carlocited by 343
- 2015A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insightscited by 206
- 2017Non-convex Optimization for Machine Learningcited by 133
- 2018Log-concave sampling: Metropolis-Hastings algorithms are fastcited by 118
- 2016A Variational Perspective on Accelerated Methods in Optimizationcited by 110
- 2013A Literature Survey of Benchmark Functions For Global Optimization Problemscited by 77
- 2017A Hitting Time Analysis of Stochastic Gradient Langevin Dynamicscited by 71
- 2018Understanding the Acceleration Phenomenon via High-Resolution Differential Equationscited by 69
- 2020On Learning Rates and Schr"odinger Operatorscited by 33
- 2017Quantum SDP-Solvers: Better upper and lower boundscited by 27
- 2018Convex optimization using quantum oraclescited by 19
16 more
- 2019Sublinear quantum algorithms for training linear and kernel-based classifierscited by 19
- 2018A Quantum Interior Point Method for LPs and SDPscited by 17
- 2020Adiabatic Quantum Linear Regressioncited by 17
- 2018Quantum algorithms and lower bounds for convex optimizationcited by 15
- 2020Quantum algorithms for escaping from saddle pointscited by 10
- 2021On the Hyperparameters in Stochastic Gradient Descent with Momentumcited by 9
- 2022On Quantum Speedups for Nonconvex Optimization via Quantum Tunneling Walkscited by 9
- 2022Quantum simulation of real-space dynamicscited by 8
- 2022Quantum Algorithms for Sampling Log-Concave Distributions and Estimating Normalizing Constantscited by 8
- 2019Time-dependent Hamiltonian simulation with L1-norm scalingcited by 7
- 2023Quantum Speedups for Zero-Sum Games via Improved Dynamic Gibbs Samplingcited by 7
- 2023Quantum Hamiltonian Descentcited by 7
- 2021Quantum Interior Point Methods for Semidefinite Optimizationcited by 6
- 2023Logarithmic-Regret Quantum Learning Algorithms for Zero-Sum Gamescited by 6
- 2022New hard benchmark functions for global optimizationcited by 2
- 2023A quantum-classical performance separation in nonconvex optimizationcited by 2
Built on by
Citing papers per year: 2024: 1; 2025: 6.
7 papers.
- 2025Quantum Non-Linear Bandit Optimizationcited by 2
- 2025Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexitiescited by 2
- 2025Operator-Level Quantum Acceleration of Non-Logconcave Samplingcited by 1
- 2025A Spin Glass Characterization of Neural Networkscited by 1
- 2024Gradient Testing and Estimation by Comparisonscited by 0
- 2025Quantum Optimization via Gradient-Based Hamiltonian Descentcited by 0
- 2025Quantum Algorithms for Projection-Free Sparse Convex Optimizationcited by 0
- 2025A Spin Glass Characterization of Neural Networks10 Aug 2025
- 2025Quantum Algorithms for Projection-Free Sparse Convex Optimization11 Jul 2025
- 2025Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities6 Jul 2025
- 2025Quantum Optimization via Gradient-Based Hamiltonian Descent20 May 2025
- 2025Operator-Level Quantum Acceleration of Non-Logconcave Sampling8 May 2025
- 2025Quantum Non-Linear Bandit Optimization4 Mar 2025
- 2024Gradient Testing and Estimation by Comparisons19 May 2024