Quantum speed-up for solving the one-dimensional Hubbard model using quantum annealing
arXiv:2510.02141 · doi:10.1103/bj6c-t252
Abstract
The Hubbard model has occupied the minds of condensed matter physicists for most part of the last century. This model provides insight into a range of phenomena in correlated electron systems. We wish to examine the paradigm of quantum algorithms for solving such many-body problems. The focus of our current work is on the one-dimensional model which is integrable, meaning that there exist analytical results for determining its ground state. In particular, we demonstrate how to perform a gate-based quantum computer simulation of quantum annealing for the Hubbard Hamiltonian. We perform simulations for systems with up to 40 qubits to study the scaling of required annealing time for obtaining the ground state. We find that for the half-filled cases considered, there is a substantial quantum speed-up over algorithms based on the Bethe-ansatz equations.
References in corpus (21)
- A variational eigenvalue solver on a quantum processor
- Probing many-body dynamics on a 51-atom quantum simulator
- Towards Practical Quantum Variational Algorithms
- Fermi-Hubbard physics with atoms in an optical lattice
- Mathematical Foundation of Quantum Annealing
- Bounds for the adiabatic approximation with applications to quantum computation
- Quantum simulation of a Fermi-Hubbard model using a semiconductor quantum dot array
- Solving strongly correlated electron models on a quantum computer
- Simulating quantum many-body dynamics on a current digital quantum computer
- Massive Parallel Quantum Computer Simulator
- Demonstration of a scaling advantage for a quantum annealer over simulated annealing
- Quantum annealing of the Traveling Salesman Problem
- Strategies for solving the Fermi-Hubbard model on near-term quantum computers
- Quantum Speedup by Quantum Annealing
- Quantum algorithms to simulate many-body physics of correlated fermions
- Massively parallel quantum computer simulator, eleven years later
- Adiabatic Preparation of a Heisenberg Antiferromagnet Using an Optical Superlattice
- Digital Quantum Simulation of the Statistical Mechanics of a Frustrated Magnet
- Scaling Advantage in Approximate Optimization with Quantum Annealing
- Bethe states on a quantum computer: success probability and correlation functions
- Quantum annealing for hard 2-SAT problems : Distribution and scaling of minimum energy gap and success probability