Classical Benchmarks for Variational Quantum Eigensolver Simulations of the Hubbard Model
Antonios M. Alvertis, Abid Khan, Thomas Iadecola, Peter P. Orth, Norm Tubman

TL;DR
This study benchmarks the accuracy of variational quantum algorithms for simulating the Hubbard model on classical computers, revealing limitations in energy accuracy for larger systems and the effects of correlations and inhomogeneity.
Contribution
It provides a comprehensive classical benchmarking of variational quantum eigensolvers applied to the Hubbard model, analyzing factors affecting accuracy and system size dependence.
Findings
Error plateaus for larger lattices even with optimal ansatzes
Stronger correlations increase energy errors
Inhomogeneity and off-site interactions have minimal impact
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
