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

arXiv:2411.13742

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 Nov 20, 2024• 5 citations
arXivHTMLPDF

Abstract

Data used in the paper "Benchmarking a wide range of optimisers for solving the Fermi-Hubbard model using the variational quantum eigensolver" by Benjamin D.M. Jones, Lana Mineh, and Ashley Montanaro, available here: https://arxiv.org/abs/2411.13742. See the README.md file for details on how the data is organised, and data.zip for the full data (~37GB when uncompressed).

DOI
10.48550/arxiv.2411.13742

Related papers

Data from "Probing ground state properties of the kagome antiferromagnetic Heisenberg model using the Variational Quantum Eigensolver"

Ashley Montanaro, Jan Lukas Bosse

Simulation data generated for the paper "Probing ground state properties of the kagome antiferromagnetic Heisenberg model using the Variational Quantum Eigensolver" by Jan Lukas Bosse and Ashley Montanaro.

•Jan 1, 2021•3 citations

Solvable Nonequilibrium Bose Hubbard

Tessa Cookmeyer, Zhenhao Song

The code used for solving the nonequilibrium Bose Hubbard model described in https://arxiv.org/abs/2412.03641

•Feb 24, 2025•0 citations

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

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.

Quantum Science and Technology•Aug 21, 2025•4 citations

Data from "Solving the Hubbard model using density matrix embedding theory and the variational quantum eigensolver"/2D/frag2x2/U4/depth4_max/occ0.5

Ashley Montanaro, Lana Mineh

•Aug 18, 2021•0 citations

Strategies for solving the Fermi-Hubbard model on near-term quantum computers

Chris Cade, Lana Mineh, Ashley Montanaro +1 more

One of the main applications of near-term quantum computers is expected to be solving many-body quantum systems. The present study reports on extensive optimization and numerical investigation of the Variational Quantum Eigensolver method for the iconic Fermi-Hubbard model, including the effect of realistic measurements and noise. The presented optimized circuits use up to an order of magnitude fewer gates than previously reported, suggesting that quantum circuits with a gate depth substantially below 1000 could be sufficient to solve instances beyond the capacity of classical exact diagonalization.

arXiv:1912.06007•Physical review. B./Physical review. B•Dec 10, 2020•206 citations

Solving the Hubbard model using the variational quantum eigensolver

Lana Mineh

•Mar 1, 2022•0 citations
Data used in the paper "Benchmarking a wide range of optimisers for solving the Fermi-Hubbard model using the variational quantum eigensolver" by Benjamin D.M. Jones, Lana Mineh, and Ashley Montanaro, available here: https://arxiv.org/abs/2411.13742. See the README.md file for details on how the data is organised, and data.zip for the full data (~37GB when uncompressed).
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.
One of the main applications of near-term quantum computers is expected to be solving many-body quantum systems. The present study reports on extensive optimization and numerical investigation of the Variational Quantum Eigensolver method for the iconic Fermi-Hubbard model, including the effect of realistic measurements and noise. The presented optimized circuits use up to an order of magnitude fewer gates than previously reported, suggesting that quantum circuits with a gate depth substantially below 1000 could be sufficient to solve instances beyond the capacity of classical exact diagonalization.