| Home > Publications database > Quantum speedup for solving the one-dimensional Hubbard model using quantum annealin |
| Typ | Amount | VAT | Currency | Share | Status | Cost centre |
| APC | 2445.61 | 0.00 | EUR | 100.00 % | (Zahlung erfolgt) | ZB |
| Sum | 2445.61 | 0.00 | EUR | |||
| Total | 2445.61 |
| Journal Article | FZJ-2026-02257 |
; ; ;
2026
APS
College Park, MD, USA
This record in other databases:
Please use a persistent id in citations: doi:10.1103/bj6c-t252 doi:10.34734/FZJ-2026-02257
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 that 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 polynomial quantum speedup over algorithms based on the Bethe-ansatz equations.
|
The record appears in these collections: |