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

Quantum Science and Technology

Benchmarking a wide range of optimisers for solving the Fermi–Hubbard model using the variational quantum eigensolver

Benjamin D. M. Jones, Lana Mineh, Ashley Montanaro

Published Aug 21, 2025• 4 citations
Publisher

Abstract

Abstract We numerically benchmark 30 optimisers on 372 instances of the variational quantum eigensolver for solving the Fermi–Hubbard system with the Hamiltonian variational ansatz. We rank the optimisers with respect to metrics such as final energy achieved and function calls needed to get within a certain tolerance level, and find that the best-performing optimisers are variants of gradient descent such as Momentum and ADAM (using finite difference), SPSA, CMAES, and BayesMGD. We perform gradient analysis, and observe that the step size for finite difference has a very significant impact. We also consider using simultaneous perturbation (inspired by SPSA) as a gradient subroutine: here finite difference can lead to a more precise estimate of the ground state but uses more calls, whereas simultaneous perturbation can converge quicker but may be less precise in the later stages. Finally, we study the quantum natural gradient algorithm: we implement this method for one-dimensional Fermi–Hubbard systems, and find that whilst it can reach a lower energy with fewer iterations, this improvement is typically lost when taking total function calls into account. Our method involves performing careful hyperparameter sweeping on 4 instances. We present a variety of analysis and figures, detailed optimiser notes, and discuss future directions.

DOI
10.1088/2058-9565/adfe15

Related papers

Variational Quantum Eigensolver: A Comparative Analysis of Classical and Quantum Optimizer Methods

Duc-Truyen Le, Vu-Linh Nguyen, Ha C. Nguyen +2 more

In this study, we investigated the Variational Quantum Eigensolver (VQE) application for the Ising model as a testbed model, in which we thoroughly delved into several optimizers, both classical and quantum, and analyzed the extent to which each of these methods would offer a benefit. We then investigated a new combinatorial optimization scheme, termed QN-SPSA+PSR, in which the Fubini-Study metric is approximated within the Quantum Natural Gradient (QN) framework, with its inner gradient estimated by the Simultaneous Perturbation Stochastic Approximation (SPSA), while the outer gradient of the cost function is evaluated exactly by the Parameter-Shift Rule (PSR). The QN-SPSA+PSR method integrates the QN-SPSA computational efficiency with the precise gradient computation of the PSR, improving the stability of QN-SPSA-based and convergence speed per parameter update while maintaining low computational consumption. Our results provide a potential performance improvement in the VQAs' optimization subroutine, even in Quantum Machine Learning's optimization section, and enhance viable paths toward efficient quantum simulations on Noisy Intermediate-Scale Quantum Computing (NISQ) devices. Additionally, we also conducted a detailed study of quantum circuit ansatz structures in order to find the one that would work best with the Ising model and NISQ, in which we utilized the properties of the investigated model.

arXiv:2412.19176•IEEE Transactions on Quantum Engineering•Jan 1, 2026•2 citations

Quantum Simulation of 1D & 2D Lattice-based Fermi Hubbard Model using Variational Quantum Algorithms

D Shalini, Srinjoy Ganguly, Prateek Jain

Quantum simulation and near-term quantum algorithms have gained significant momentum over the past few years, with researchers exploring quantum-based approaches to solve classically intractable problems. Out of many research problems, certain problems are well suited for quantum algorithms. Fermi Hubbard model based on lattice structures is one of the quantum-mechanical models used in many-body and condensed matter physics to capture the essence of electron-correlated systems. In this work, we show one of the first kinds of experiments on simulating the ground state properties of 1D and 2D Fermi Hubbard-based lattice models compared with the reference ground state energy values using Qiskit Nature. We utilize the Variational Quantum Eigensolver (VQE) and different gradient-based optimizers to achieve results that closely converge towards the exact values, showcasing the potential of variational quantum algorithms.

International Conference on Trends in Quantum Computing and Emerging Business Technologies (TQCEBT)•Mar 22, 2024•2 citations

Adaptive variational preparation of the Fermi-Hubbard eigenstates

Gaurav Gyawali, Michael J. Lawler

Approximating the ground states of strongly interacting electron systems in quantum chemistry and condensed matter physics is expected to be one of the earliest applications of quantum computers. In this paper, we prepare highly accurate ground states of the Fermi-Hubbard model for small grids of up to six sites (12 qubits) by using an interpretable, adaptive variational quantum eigensolver (VQE) called ADAPT-VQE [H. R. Grimsley et al., Nat. Commun. 10, 3007 (2019)]. In contrast with nonadaptive VQE, this algorithm builds a system-specific ansatz by adding an optimal gate built from one-body or two-body fermionic operators at each step. We show this adaptive method outperforms the nonadaptive counterpart in terms of fewer variational parameters, short gate depth, and scaling with the system size. The fidelity and energy of the prepared state appear to improve asymptotically with ansatz depth. We also demonstrate the application of adaptive variational methods by preparing excited states and Green's functions using a proposed ADAPT-SSVQE algorithm. Lower depth, asymptotic convergence, noise tolerance of a variational approach [A. Peruzzo et al., Nat. Commun. 5, 4213 (2014); J. R. McLean et al., New J. Phys. 18, 023023 (2016); K. Sharma et al., New J. Phys. 22, 043006 (2020)], and a highly controllable, system-specific ansatz make the adaptive variational methods particularly well suited for noisy intermediate-scale quantum devices.

arXiv:2109.12126•Physical Review A•Jan 6, 2022•19 citations

Efficient Hamiltonian-aware Quantum Natural Gradient Descent for Variational Quantum Eigensolvers

Chenyu Shi, Hao Wang

The Variational Quantum Eigensolver (VQE) is one of the most promising algorithms for current quantum devices. It employs a classical optimizer to iteratively update the parameters of a variational quantum circuit in order to search for the ground state of a given Hamiltonian. The efficacy of VQEs largely depends on the optimizer employed. Recent studies suggest that Quantum Natural Gradient Descent (QNG) can achieve faster convergence than vanilla gradient descent (VG), but at the cost of additional quantum resources to estimate Fubini-Study metric tensor in each optimization step. The Fubini-Study metric tensor used in QNG is related to the entire quantum state space and does not incorporate information about the target Hamiltonian. To take advantage of the structure of the Hamiltonian and address the limitation of additional computational cost in QNG, we propose Hamiltonian-aware Quantum Natural Gradient Descent (H-QNG). In H-QNG, we propose to use the Riemannian pullback metric induced from the lower-dimensional subspace spanned by the Hamiltonian terms onto the parameter space. We show that H-QNG inherits the desirable features of both approaches: the low quantum computational cost of VG and the reparameterization-invariance of QNG. We also validate its performance through numerical experiments on molecular Hamiltonians, showing that H-QNG achieves faster convergence to chemical accuracy while requiring fewer quantum computational resources.

quant-pharXiv:2511.14511•Quantum Machine Intelligence•Nov 19, 2025•1 citation

Variational Quantum Eigensolver: A Comparative Analysis of Classical and Quantum Optimization Methods

Duc-Truyen Le, Vu-Linh Nguyen, Ha C. Nguyen +2 more

Abstract In this study, we study the Variational Quantum Eigensolver (VQE) application for the Ising model as a test bed model, in which we pivotally delved into several optimization methods, both classical and quantum, and analyzed the quantum advantage that each of these methods offered, and then we proposed a new combinatorial optimization scheme, deemed as QN-SPSA+PSR which combines calculating approximately Fubini-study metric (QN-SPSA) and the exact evaluation of gradient by Parameter-Shift Rule (PSR). The QN-SPSA+PSR method integrates the QN-SPSA computational efficiency with the precise gradient computation of the PSR, improving both stability and convergence speed while maintaining low computational consumption. Our results provide a new potential quantum supremacy in the VQAs's optimization subroutine, even in Quantum Machine Learning's optimization section, and enhance viable paths toward efficient quantum simulations on Noisy Intermediate-Scale Quantum Computing (NISQ) devices. Additionally, we also conducted a detailed study of quantum circuit ansatz structures in order to find the one that would work best with the Ising model and NISQ, in which we utilized the properties of the investigated model.

•May 6, 2025•2 citations

Classical Benchmarks for Variational Quantum Eigensolver Simulations of the Hubbard Model

Antonios M. Alvertis, Abid Khan, Thomas Iadecola +2 more

Simulating the Hubbard model is of great interest to a wide range of applications within condensed matter physics, however its solution on classical computers remains challenging in dimensions larger than one. The relative simplicity of this model, embodied by the sparseness of the Hamiltonian matrix, allows for its efficient implementation on quantum computers, and for its approximate solution using variational algorithms such as the variational quantum eigensolver. While these algorithms have been shown to reproduce the qualitative features of the Hubbard model, their quantitative accuracy in terms of producing true ground state energies and other properties, and the dependence of this accuracy on the system size and interaction strength, the choice of variational ansatz, and the degree of spatial inhomogeneity in the model, remains unknown. Here we present a rigorous classical benchmarking study, demonstrating the potential impact of these factors on the accuracy of the variational solution of the Hubbard model on quantum hardware, for systems with up to 32 qubits. We find that even when using the most accurate wavefunction ansätze for the Hubbard model, the error in its ground state energy and wavefunction plateaus for larger lattices, while stronger electronic correlations magnify this issue. Concurrently, spatially inhomogeneous parameters and the presence of off-site Coulomb interactions only have a small effect on the accuracy of the computed ground state energies. Our study highlights the capabilities and limitations of current approaches for solving the Hubbard model on quantum hardware, and we discuss potential future avenues of research.

arXiv:2408.00836•Quantum•May 20, 2025•14 citations
Abstract We numerically benchmark 30 optimisers on 372 instances of the variational quantum eigensolver for solving the Fermi–Hubbard system with the Hamiltonian variational ansatz. We rank the optimisers with respect to metrics such as final energy achieved and function calls needed to get within a certain tolerance level, and find that the best-performing optimisers are variants of gradient descent such as Momentum and ADAM (using finite difference), SPSA, CMAES, and BayesMGD. We perform gradient analysis, and observe that the step size for finite difference has a very significant impact. We also consider using simultaneous perturbation (inspired by SPSA) as a gradient subroutine: here finite difference can lead to a more precise estimate of the ground state but uses more calls, whereas simultaneous perturbation can converge quicker but may be less precise in the later stages. Finally, we study the quantum natural gradient algorithm: we implement this method for one-dimensional Fermi–Hubbard systems, and find that whilst it can reach a lower energy with fewer iterations, this improvement is typically lost when taking total function calls into account. Our method involves performing careful hyperparameter sweeping on 4 instances. We present a variety of analysis and figures, detailed optimiser notes, and discuss future directions.
In this study, we investigated the Variational Quantum Eigensolver (VQE) application for the Ising model as a testbed model, in which we thoroughly delved into several optimizers, both classical and quantum, and analyzed the extent to which each of these methods would offer a benefit. We then investigated a new combinatorial optimization scheme, termed QN-SPSA+PSR, in which the Fubini-Study metric is approximated within the Quantum Natural Gradient (QN) framework, with its inner gradient estimated by the Simultaneous Perturbation Stochastic Approximation (SPSA), while the outer gradient of the cost function is evaluated exactly by the Parameter-Shift Rule (PSR). The QN-SPSA+PSR method integrates the QN-SPSA computational efficiency with the precise gradient computation of the PSR, improving the stability of QN-SPSA-based and convergence speed per parameter update while maintaining low computational consumption. Our results provide a potential performance improvement in the VQAs' optimization subroutine, even in Quantum Machine Learning's optimization section, and enhance viable paths toward efficient quantum simulations on Noisy Intermediate-Scale Quantum Computing (NISQ) devices. Additionally, we also conducted a detailed study of quantum circuit ansatz structures in order to find the one that would work best with the Ising model and NISQ, in which we utilized the properties of the investigated model.
Quantum simulation and near-term quantum algorithms have gained significant momentum over the past few years, with researchers exploring quantum-based approaches to solve classically intractable problems. Out of many research problems, certain problems are well suited for quantum algorithms. Fermi Hubbard model based on lattice structures is one of the quantum-mechanical models used in many-body and condensed matter physics to capture the essence of electron-correlated systems. In this work, we show one of the first kinds of experiments on simulating the ground state properties of 1D and 2D Fermi Hubbard-based lattice models compared with the reference ground state energy values using Qiskit Nature. We utilize the Variational Quantum Eigensolver (VQE) and different gradient-based optimizers to achieve results that closely converge towards the exact values, showcasing the potential of variational quantum algorithms.
Approximating the ground states of strongly interacting electron systems in quantum chemistry and condensed matter physics is expected to be one of the earliest applications of quantum computers. In this paper, we prepare highly accurate ground states of the Fermi-Hubbard model for small grids of up to six sites (12 qubits) by using an interpretable, adaptive variational quantum eigensolver (VQE) called ADAPT-VQE [H. R. Grimsley et al., Nat. Commun. 10, 3007 (2019)]. In contrast with nonadaptive VQE, this algorithm builds a system-specific ansatz by adding an optimal gate built from one-body or two-body fermionic operators at each step. We show this adaptive method outperforms the nonadaptive counterpart in terms of fewer variational parameters, short gate depth, and scaling with the system size. The fidelity and energy of the prepared state appear to improve asymptotically with ansatz depth. We also demonstrate the application of adaptive variational methods by preparing excited states and Green's functions using a proposed ADAPT-SSVQE algorithm. Lower depth, asymptotic convergence, noise tolerance of a variational approach [A. Peruzzo et al., Nat. Commun. 5, 4213 (2014); J. R. McLean et al., New J. Phys. 18, 023023 (2016); K. Sharma et al., New J. Phys. 22, 043006 (2020)], and a highly controllable, system-specific ansatz make the adaptive variational methods particularly well suited for noisy intermediate-scale quantum devices.
The Variational Quantum Eigensolver (VQE) is one of the most promising algorithms for current quantum devices. It employs a classical optimizer to iteratively update the parameters of a variational quantum circuit in order to search for the ground state of a given Hamiltonian. The efficacy of VQEs largely depends on the optimizer employed. Recent studies suggest that Quantum Natural Gradient Descent (QNG) can achieve faster convergence than vanilla gradient descent (VG), but at the cost of additional quantum resources to estimate Fubini-Study metric tensor in each optimization step. The Fubini-Study metric tensor used in QNG is related to the entire quantum state space and does not incorporate information about the target Hamiltonian. To take advantage of the structure of the Hamiltonian and address the limitation of additional computational cost in QNG, we propose Hamiltonian-aware Quantum Natural Gradient Descent (H-QNG). In H-QNG, we propose to use the Riemannian pullback metric induced from the lower-dimensional subspace spanned by the Hamiltonian terms onto the parameter space. We show that H-QNG inherits the desirable features of both approaches: the low quantum computational cost of VG and the reparameterization-invariance of QNG. We also validate its performance through numerical experiments on molecular Hamiltonians, showing that H-QNG achieves faster convergence to chemical accuracy while requiring fewer quantum computational resources.
Abstract In this study, we study the Variational Quantum Eigensolver (VQE) application for the Ising model as a test bed model, in which we pivotally delved into several optimization methods, both classical and quantum, and analyzed the quantum advantage that each of these methods offered, and then we proposed a new combinatorial optimization scheme, deemed as QN-SPSA+PSR which combines calculating approximately Fubini-study metric (QN-SPSA) and the exact evaluation of gradient by Parameter-Shift Rule (PSR). The QN-SPSA+PSR method integrates the QN-SPSA computational efficiency with the precise gradient computation of the PSR, improving both stability and convergence speed while maintaining low computational consumption. Our results provide a new potential quantum supremacy in the VQAs's optimization subroutine, even in Quantum Machine Learning's optimization section, and enhance viable paths toward efficient quantum simulations on Noisy Intermediate-Scale Quantum Computing (NISQ) devices. Additionally, we also conducted a detailed study of quantum circuit ansatz structures in order to find the one that would work best with the Ising model and NISQ, in which we utilized the properties of the investigated model.
Simulating the Hubbard model is of great interest to a wide range of applications within condensed matter physics, however its solution on classical computers remains challenging in dimensions larger than one. The relative simplicity of this model, embodied by the sparseness of the Hamiltonian matrix, allows for its efficient implementation on quantum computers, and for its approximate solution using variational algorithms such as the variational quantum eigensolver. While these algorithms have been shown to reproduce the qualitative features of the Hubbard model, their quantitative accuracy in terms of producing true ground state energies and other properties, and the dependence of this accuracy on the system size and interaction strength, the choice of variational ansatz, and the degree of spatial inhomogeneity in the model, remains unknown. Here we present a rigorous classical benchmarking study, demonstrating the potential impact of these factors on the accuracy of the variational solution of the Hubbard model on quantum hardware, for systems with up to 32 qubits. We find that even when using the most accurate wavefunction ansätze for the Hubbard model, the error in its ground state energy and wavefunction plateaus for larger lattices, while stronger electronic correlations magnify this issue. Concurrently, spatially inhomogeneous parameters and the presence of off-site Coulomb interactions only have a small effect on the accuracy of the computed ground state energies. Our study highlights the capabilities and limitations of current approaches for solving the Hubbard model on quantum hardware, and we discuss potential future avenues of research.