Simulating a ring-like Hubbard system with a quantum computer
arXiv:2104.06428 · doi:10.1103/PhysRevResearch.4.013165
Abstract
We develop a workflow to use current quantum computing hardware for solving quantum many-body problems, using the example of the fermionic Hubbard model. Concretely, we study a four-site Hubbard ring that exhibits a transition from a product state to an intrinsically interacting ground state as hopping amplitudes are changed. We locate this transition and solve for the ground state energy with high quantitative accuracy using a variational quantum algorithm executed on an IBM quantum computer. Our results are enabled by a variational ansatz that takes full advantage of the maximal set of commuting symmetries of the problem and a Lanczos-inspired error mitigation algorithm. They are a benchmark on the way to exploiting near term quantum simulators for quantum many-body problems.
References in corpus (6)
- Many-body physics in the NISQ era: quantum programming a discrete time crystal
- Quantum-optimal-control-inspired ansatz for variational quantum algorithms
- Algorithmic Error Mitigation Scheme for Current Quantum Processors
- Probing many-body localization on a noisy quantum computer
- Determining quantum phase diagrams of topological Kitaev-inspired models on NISQ quantum hardware
- Möbius molecules and fragile Mott insulators
Cited by in corpus (8)
- Observing ground-state properties of the Fermi-Hubbard model using a scalable algorithm on a quantum computer
- Using Differential Evolution to avoid local minima in Variational Quantum Algorithms
- Gutzwiller wave function on a quantum computer using a discrete Hubbard-Stratonovich transformation
- A Quantum Computing Implementation of Nuclear-Electronic Orbital (NEO) Theory: Towards an Exact pre-Born-Oppenheimer Formulation of Molecular Quantum Systems
- A Hybrid Quantum-Classical Method for Electron-Phonon Systems
- Quantum simulation costs for Suzuki-Trotter decomposition of quantum many-body lattice models
- Optimization strategies in WAHTOR algorithm for quantum computing empirical ansatz: a comparative study
- Recursive relations and quantum eigensolver algorithms within modified Schrieffer--Wolff transformations for the Hubbard dimer