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

Physical Review Letters

Stochastic Gradient Approximation: An Efficient Method to Optimize Many-Body Wave Functions

Ari Harju, B. Barbiellini, Sami Siljamaki, R. M. Nieminen, Gerardo Ortíz

Published Aug 18, 1997• 75 citations
Publisher

Abstract

A novel, efficient optimization method for physical problems is presented. The method utilizes the noise inherent in stochastic functions. As an application, an algorithm for the variational optimization of quantum many-body wave functions is derived. The numerical results indicate superior performance when compared to traditional techniques.

DOI
10.1103/physrevlett.79.1173

Related papers

The Steepest Slope toward a Quantum Few-Body Solution: Gradient Variational Methods for the Quantum Few-Body Problem

Paolo Recchia, Debabrota Basu, M. Gattobigio +2 more

Abstract Quantum few-body systems are deceptively simple. Indeed, with the notable exception of a few special cases, their associated Schrödinger equation cannot be solved analytically for more than two particles. One has to resort to approximation methods to tackle quantum few-body problems. In particular, variational methods have been proposed to ease numerical calculations and obtain precise solutions. One such method is the Stochastic Variational Method, which employs a stochastic search to determine the number and parameters of correlated Gaussian basis functions used to construct an ansatz of the wave function. Stochastic methods, however, face numerical and optimization challenges as the number of particles increases. We introduce a family of gradient variational methods that replace stochastic search with gradient optimization. We comparatively and empirically evaluate the performance of the baseline Stochastic Variational Method, several instances of the gradient variational method family, and some hybrid methods for selected few-body problems. We show that gradient and hybrid methods can be more efficient and effective than the Stochastic Variational Method. We discuss the role of singularities, oscillations, and gradient optimization strategies in the performance of the respective methods.

arXiv:2408.08522•Few-Body Systems•Nov 18, 2024•1 citation

Title: Quantum-Inspired Optimization via Stochastic Gradient Descent

Jincheng Zhang

Quantum-inspired optimization represents a promising avenue for addressing computationally challenging optimization problems. This paper investigates the application of stochastic gradient descent (SGD) to emulate the quantum annealing process, aiming to improve the speed and accuracy of complex optimization tasks. We propose a novel algorithm that iteratively refines a solution based on the gradient of the objective function, mimicking the probabilistic exploration inherent in quantum annealing. This approach offers a potentially more efficient and scalable method compared to traditional optimization techniques, leveraging the strengths of stochasticity. The core mechanism centers around utilizing SGD to dynamically adjust the solution trajectory, effectively mimicking the quantum annealing process.

•Aug 31, 2026•0 citations

Stochastic gradient approximation method applied to Hubbard model

Ari Harju

The two-dimensional Hubbard model is studied using the variational quantum Monte Carlo technique with Gutzwiller-type variational wave functions. In addition to the simple one-site correlated Gutzwiller wave function, we use a form with correlation between electrons on nearest- and next-nearest-neighbor sites. We show that the stochastic gradient approximation method suits very well for the optimization of the free parameters of the variational wave functions.

arXiv:cond-mat/0101465•Jan 31, 2001•1 citation

Title: Quantum Gradient Descent for Optimization

Jincheng Zhang

Quantum Gradient Descent for Optimization Quantum optimization is a rapidly growing field that seeks to utilize quantum mechanical phenomena to improve the efficiency of optimization algorithms. This paper investigates the application of quantum gradient descent to complex systems, proposing a hybrid approach that combines the strengths of both quantum and classical computation. We explore the potential of quantum annealing and quantum error correction to enhance gradient calculations, thereby accelerating the search for optimal solutions. The core mechanism involves leveraging quantum properties to perform gradient computations with significantly reduced computational complexity compared to traditional classical methods. This research aims to provide a novel algorithm that demonstrates substantial performance gains for challenging optimization problems, particularly those exhibiting inherent quantum behavior. The paper details the design of the algorithm, its implementation within a simulated environment, and preliminary results demonstrating improved convergence speed and solution quality. Further work will focus on refining the quantum-enhanced gradient calculation to maximize efficiency and scalability.

•Sep 3, 2026•0 citations

Stochastic optimization algorithms for quantum applications

Jorge A. Gidi, B. Candia, Andrés D. Muñoz-Moller +5 more

Hybrid classical quantum optimization methods have become an important tool for efficiently solving problems in the current generation of noisy intermediate-scale quantum computers. These methods use an optimization algorithm executed in a classical computer, fed with values of the objective function obtained in a quantum processor. A proper choice of optimization algorithm is essential to achieve good performance. Here, we review the use of first-order, second-order, and quantum natural gradient stochastic optimization methods, which are defined in the field of real numbers, and propose stochastic algorithms defined in the field of complex numbers. The performance of all methods is evaluated by means of their application to variational quantum eigensolver, quantum control of quantum states, and quantum state estimation. In general, complex number optimization algorithms perform best, with first-order complex algorithms consistently achieving the best performance, closely followed by complex quantum natural algorithms, which do not require expensive hyperparameter calibration. In particular, the scalar formulation of the complex quantum natural algorithm allows to achieve good performance with low classical computational cost.

arXiv:2203.06044•Physical Review A•Sep 8, 2023•22 citations

Quantum Optimization Algorithms for Strongly Correlated Many-Body Systems

G. E. L. Pexe, L. A. M. Rattighieri, P. M. Prado +2 more

This perspective article analyzes the potential and critical challenges of employing quantum optimization algorithms to investigate phase transitions in quantum many-body systems during the Noisy Intermediate-Scale Quantum era. The simulation of strongly correlated systems is frequently intractable on classical computers due to the exponential growth of the Hilbert space and the fermionic sign problem. In this context, we review and compare the performance of traditional Variational Quantum Algorithms, such as the Variational Quantum Eigensolver and the Quantum Approximate Optimization Algorithm, against emerging heuristic approaches, specifically Feedback-based Quantum Algorithms, such as FALQON. We explore the applicability of these methods in the study of open phenomena in condensed matter physics, including Deconfined Quantum Criticality, strange metals, Many-Body Localization, topological phase transitions, and quantum spin liquids. We discuss how fundamental operational bottlenecks, notably expressibility- and noise-induced barren plateaus, severely compromise gradient-based optimization. We conclude that deterministic feedback-guided methods provide geometrically more robust trajectories for navigating the energy landscape of these systems, arguing that further advancement in the field will rely on deep hybridization and physics-informed circuit co-design towards fault tolerance.

quant-pharXiv:2606.03147•Journal of Physics Condensed Matter•Jun 3, 2026•1 citation
A novel, efficient optimization method for physical problems is presented. The method utilizes the noise inherent in stochastic functions. As an application, an algorithm for the variational optimization of quantum many-body wave functions is derived. The numerical results indicate superior performance when compared to traditional techniques.
Abstract Quantum few-body systems are deceptively simple. Indeed, with the notable exception of a few special cases, their associated Schrödinger equation cannot be solved analytically for more than two particles. One has to resort to approximation methods to tackle quantum few-body problems. In particular, variational methods have been proposed to ease numerical calculations and obtain precise solutions. One such method is the Stochastic Variational Method, which employs a stochastic search to determine the number and parameters of correlated Gaussian basis functions used to construct an ansatz of the wave function. Stochastic methods, however, face numerical and optimization challenges as the number of particles increases. We introduce a family of gradient variational methods that replace stochastic search with gradient optimization. We comparatively and empirically evaluate the performance of the baseline Stochastic Variational Method, several instances of the gradient variational method family, and some hybrid methods for selected few-body problems. We show that gradient and hybrid methods can be more efficient and effective than the Stochastic Variational Method. We discuss the role of singularities, oscillations, and gradient optimization strategies in the performance of the respective methods.
Quantum-inspired optimization represents a promising avenue for addressing computationally challenging optimization problems. This paper investigates the application of stochastic gradient descent (SGD) to emulate the quantum annealing process, aiming to improve the speed and accuracy of complex optimization tasks. We propose a novel algorithm that iteratively refines a solution based on the gradient of the objective function, mimicking the probabilistic exploration inherent in quantum annealing. This approach offers a potentially more efficient and scalable method compared to traditional optimization techniques, leveraging the strengths of stochasticity. The core mechanism centers around utilizing SGD to dynamically adjust the solution trajectory, effectively mimicking the quantum annealing process.
Quantum Gradient Descent for Optimization Quantum optimization is a rapidly growing field that seeks to utilize quantum mechanical phenomena to improve the efficiency of optimization algorithms. This paper investigates the application of quantum gradient descent to complex systems, proposing a hybrid approach that combines the strengths of both quantum and classical computation. We explore the potential of quantum annealing and quantum error correction to enhance gradient calculations, thereby accelerating the search for optimal solutions. The core mechanism involves leveraging quantum properties to perform gradient computations with significantly reduced computational complexity compared to traditional classical methods. This research aims to provide a novel algorithm that demonstrates substantial performance gains for challenging optimization problems, particularly those exhibiting inherent quantum behavior. The paper details the design of the algorithm, its implementation within a simulated environment, and preliminary results demonstrating improved convergence speed and solution quality. Further work will focus on refining the quantum-enhanced gradient calculation to maximize efficiency and scalability.
Hybrid classical quantum optimization methods have become an important tool for efficiently solving problems in the current generation of noisy intermediate-scale quantum computers. These methods use an optimization algorithm executed in a classical computer, fed with values of the objective function obtained in a quantum processor. A proper choice of optimization algorithm is essential to achieve good performance. Here, we review the use of first-order, second-order, and quantum natural gradient stochastic optimization methods, which are defined in the field of real numbers, and propose stochastic algorithms defined in the field of complex numbers. The performance of all methods is evaluated by means of their application to variational quantum eigensolver, quantum control of quantum states, and quantum state estimation. In general, complex number optimization algorithms perform best, with first-order complex algorithms consistently achieving the best performance, closely followed by complex quantum natural algorithms, which do not require expensive hyperparameter calibration. In particular, the scalar formulation of the complex quantum natural algorithm allows to achieve good performance with low classical computational cost.
This perspective article analyzes the potential and critical challenges of employing quantum optimization algorithms to investigate phase transitions in quantum many-body systems during the Noisy Intermediate-Scale Quantum era. The simulation of strongly correlated systems is frequently intractable on classical computers due to the exponential growth of the Hilbert space and the fermionic sign problem. In this context, we review and compare the performance of traditional Variational Quantum Algorithms, such as the Variational Quantum Eigensolver and the Quantum Approximate Optimization Algorithm, against emerging heuristic approaches, specifically Feedback-based Quantum Algorithms, such as FALQON. We explore the applicability of these methods in the study of open phenomena in condensed matter physics, including Deconfined Quantum Criticality, strange metals, Many-Body Localization, topological phase transitions, and quantum spin liquids. We discuss how fundamental operational bottlenecks, notably expressibility- and noise-induced barren plateaus, severely compromise gradient-based optimization. We conclude that deterministic feedback-guided methods provide geometrically more robust trajectories for navigating the energy landscape of these systems, arguing that further advancement in the field will rely on deep hybridization and physics-informed circuit co-design towards fault tolerance.