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

Bulletin of the American Physical Society

Stochastic Gradient Descent for Hybrid Quantum-Classical Optimization

Frederik Wilde, Ryan Sweke, Johannes Jakob Meyer, Maria Schuld, Paul Fährmann, Barthelemy Meynard-Piganeau, Jens Eisert

Published Mar 2, 2020• 7 citations
OpenAlex

Related papers

Quantum-Inspired Stochastic Gradient Descent for Deep Learning

Jincheng Zhang

Stochastic Gradient Descent (SGD) is a cornerstone algorithm in deep learning, widely employed for optimizing model parameters. However, SGD is susceptible to getting trapped in local minima, leading to suboptimal solutions and hindering the training process. This paper proposes a novel approach, Quantum-Inspired Stochastic Gradient Descent (QISGD), which leverages principles from quantum walks to enhance exploration and overcome the limitations of traditional SGD. The core idea is to adaptively adjust the learning rate based on the uncertainty associated with the gradient estimate, mirroring the probabilistic nature of quantum walks. Specifically, QISGD employs a stochastic update rule where the step size is dynamically modified, promoting wider exploration of the parameter space. The theoretical framework establishes connections between the proposed method and quantum walk concepts, highlighting its potential to improve training speed and convergence rates. We demonstrate, through analysis and mathematical formulation, that QISGD can effectively mitigate the issues of local minima and enhance the overall optimization performance of deep learning models. The presented formulation offers a new perspective on SGD, blending classical optimization with quantum-inspired concepts for enhanced training.

•Aug 31, 2026•0 citations

Quantum Optimization via Gradient-Based Hamiltonian Descent

Jiaqi Leng, Bin Shi

arXiv:2505.14670•Communications in computer and information science•Jan 1, 2026•1 citation

Quantum-Inspired Stochastic Gradient Descent for Large-Scale Neural Networks

Jincheng Zhang

Training large-scale neural networks with traditional stochastic gradient descent (SGD) methods often faces significant challenges, including slow convergence rates and high computational costs. This paper proposes a novel approach, Quantum-Inspired Stochastic Gradient Descent (QISGD), designed to address these limitations. QISGD leverages principles inspired by quantum measurement processes, specifically employing a random projection operator to approximate the gradient. This technique aims to provide a more efficient and potentially faster way to update the network's parameters during training. The theoretical underpinnings of QISGD are presented, along with a detailed explanation of the algorithm's components. We demonstrate the potential benefits of QISGD through a conceptual analysis and outline a framework for future research and implementation. The core innovation lies in translating quantum measurement intuition into a practical optimization strategy for classical neural networks. The goal is to improve the training efficiency of large networks while retaining the benefits of SGD.

•Aug 28, 2026•0 citations

From Quantum Tunneling to Classical Optimization through Instantons

Jiayu Shen, Dylan Herman, Guneykan Ozgul +5 more

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.

quant-pharXiv:2610.06797•Oct 6, 2026•0 citations

First Steps towards Hybrid Quantum-Classical Optimization

Dapeng Wang

•Jan 1, 2020•0 citations

Quantum stochastic optimization

Bruno Apolloni, C. Carvalho, D. de Falco

Stochastic Processes and their Applications•Dec 1, 1989•211 citations
Stochastic Gradient Descent (SGD) is a cornerstone algorithm in deep learning, widely employed for optimizing model parameters. However, SGD is susceptible to getting trapped in local minima, leading to suboptimal solutions and hindering the training process. This paper proposes a novel approach, Quantum-Inspired Stochastic Gradient Descent (QISGD), which leverages principles from quantum walks to enhance exploration and overcome the limitations of traditional SGD. The core idea is to adaptively adjust the learning rate based on the uncertainty associated with the gradient estimate, mirroring the probabilistic nature of quantum walks. Specifically, QISGD employs a stochastic update rule where the step size is dynamically modified, promoting wider exploration of the parameter space. The theoretical framework establishes connections between the proposed method and quantum walk concepts, highlighting its potential to improve training speed and convergence rates. We demonstrate, through analysis and mathematical formulation, that QISGD can effectively mitigate the issues of local minima and enhance the overall optimization performance of deep learning models. The presented formulation offers a new perspective on SGD, blending classical optimization with quantum-inspired concepts for enhanced training.
Training large-scale neural networks with traditional stochastic gradient descent (SGD) methods often faces significant challenges, including slow convergence rates and high computational costs. This paper proposes a novel approach, Quantum-Inspired Stochastic Gradient Descent (QISGD), designed to address these limitations. QISGD leverages principles inspired by quantum measurement processes, specifically employing a random projection operator to approximate the gradient. This technique aims to provide a more efficient and potentially faster way to update the network's parameters during training. The theoretical underpinnings of QISGD are presented, along with a detailed explanation of the algorithm's components. We demonstrate the potential benefits of QISGD through a conceptual analysis and outline a framework for future research and implementation. The core innovation lies in translating quantum measurement intuition into a practical optimization strategy for classical neural networks. The goal is to improve the training efficiency of large networks while retaining the benefits of SGD.
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.