Observing ground-state properties of the Fermi-Hubbard model using a scalable algorithm on a quantum computer

Abstract

The famous, yet unsolved, Fermi-Hubbard model for strongly-correlated electronic systems is a prominent target for quantum computers. However, accurately representing the Fermi-Hubbard ground state for large instances may be beyond the reach of near-term quantum hardware. Here we show experimentally that an efficient, low-depth variational quantum algorithm with few parameters can reproduce important qualitative features of medium-size instances of the Fermi-Hubbard model. We address 1x8 and 2x4 instances on 16 qubits on a superconducting quantum processor, substantially larger than previous work based on less scalable compression techniques, and going beyond the family of 1D Fermi-Hubbard instances, which are solvable classically. Consistent with predictions for the ground state, we observe the onset of the metal-insulator transition and Friedel oscillations in 1D, and antiferromagnetic order in both 1D and 2D. We use a variety of error-mitigation techniques, including symmetries of the Fermi-Hubbard model and a recently developed technique tailored to simulating fermionic systems. We also introduce a new variational optimisation algorithm based on iterative Bayesian updates of a local surrogate model. Our scalable approach is a first step to using near-term quantum computers to determine low-energy properties of strongly-correlated electronic systems that cannot be solved exactly by classical computers.

26 pages, 13 figures

References in corpus (7)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• The Hubbard model: A computational perspective
• Observing ground-state properties of the Fermi-Hubbard model using a scalable algorithm on a quantum computer
• Stochastic Gradient Line Bayesian Optimization for Efficient Noise-Robust Optimization of Parameterized Quantum Circuits
• Variational quantum algorithm with information sharing
• Simulating a ring-like Hubbard system with a quantum computer
• A Classically Efficient Quantum Scalable Fermi-Hubbard Benchmark

Cited by in corpus (62)

• The Variational Quantum Eigensolver: a review of methods and best practices
• Quantum Error Mitigation
• Observing ground-state properties of the Fermi-Hubbard model using a scalable algorithm on a quantum computer
• Purification-based quantum error mitigation of pair-correlated electron simulations
• Towards near-term quantum simulation of materials
• Quantum computing for chemistry and physics applications from a Monte Carlo perspective
• Measuring the Loschmidt amplitude for finite-energy properties of the Fermi-Hubbard model on an ion-trap quantum computer
• Tight and Efficient Gradient Bounds for Parameterized Quantum Circuits
• Accelerating the variational quantum eigensolver using parallelism
• Diagonalization of large many-body Hamiltonians on a quantum processor
• Group-theoretic error mitigation enabled by classical shadows and symmetries
• Using Differential Evolution to avoid local minima in Variational Quantum Algorithms
• Fermionic Quantum Approximate Optimization Algorithm
• Quantum algorithms for scientific computing
• Quantum Simulation of the N flavor Gross-Neveu Model
• What can we learn from quantum convolutional neural networks?
• Low-depth simulations of fermionic systems on square-grid quantum hardware
• Digital-analog quantum simulation of fermionic models
• Improved simulation of quantum circuits dominated by free fermionic operations
• Fixing detailed balance in ancilla-based dissipative state engineering
• Fermionic Simulators for Enhanced Scalability of Variational Quantum Simulation
• Experimental Demonstration of Break-Even for the Compact Fermionic Encoding
• Quantum Computed Green's Functions using a Cumulant Expansion of the Lanczos Method
• A Hybrid Quantum-Classical Method for Electron-Phonon Systems
• Unveiling quantum phase transitions from traps in variational quantum algorithms
• Quantum simulation costs for Suzuki-Trotter decomposition of quantum many-body lattice models
• Sketching phase diagrams using low-depth variational quantum algorithms
• Digital quantum simulation of lattice fermion theories with local encoding
• A Quantum Annealing Protocol to Solve the Nuclear Shell Model
• Exploring Ground States of Fermi-Hubbard Model on Honeycomb Lattices with Counterdiabaticity
• Quantum computing quantum Monte Carlo algorithm
• Efficiently measuring $d$-wave pairing and beyond in quantum gas microscopes
• Error mitigation and circuit division for early fault-tolerant quantum phase estimation
• Efficient Quantum Cooling Algorithm for Fermionic Systems
• Exploring thermal equilibria of the Fermi-Hubbard model with variational quantum algorithms
• The Role of Quantum Computing in Advancing Scientific High-Performance Computing: A perspective from the ADAC Institute
• Hilbert subspace ergodicity
• Recursive relations and quantum eigensolver algorithms within modified Schrieffer--Wolff transformations for the Hubbard dimer
• Classical Benchmarks for Variational Quantum Eigensolver Simulations of the Hubbard Model
• Approximating dynamical correlation functions with constant depth quantum circuits
• Demonstration of a variational quantum eigensolver with a solid-state spin system under ambient conditions
• Tangent Space Excitation Ansatz for Quantum Circuits
• The Lie Algebra of XY-mixer Topologies and Warm Starting QAOA for Constrained Optimization
• Extracting the spin excitation spectrum of a fermionic system using a quantum processor
• Simulating the Fermi-Hubbard model with long-range hopping on a quantum computer
• Learning Density Functionals from Noisy Quantum Data
• High-precision and low-depth quantum algorithm design for eigenstate problems
• Simulating quantum field theories on gate-based quantum computers
• Purity-Assisted Zero-Noise Extrapolation for Quantum Error Mitigation
• Realizing non-trivial doublon formation using a quantum computer
• Efficient Fermi-Hubbard model ground-state preparation by coupling to a classical reservoir in the instantaneous-response limit
• Modularized and Scalable Compilation for Double Quantum Dot Quatum Computing
• Arbitrary Ground State Observables from Quantum Computed Moments
• Entropy density benchmarking of near-term quantum circuits
• Near-Term Fermionic Simulation with Subspace Noise Tailored Quantum Error Mitigation
• Scalable Simulation of Fermionic Encoding Performance on Noisy Quantum Computers
• Digital quantum simulation of squeezed states via enhanced bosonic encoding in a superconducting quantum processor
• Ground state energy and phase transitions of Long-range XXZ using VQE
• Nonadiabatic Self-Healing of Trotter Errors in Digitized Counterdiabatic Dynamics
• Noise-resilient and resource-efficient hybrid algorithm for robust quantum gap estimation
• Thermodynamics of a Modified Fermi-Hubbard Model
• A Soluble Modified Fermi-Hubbard Model