Strategies for solving the Fermi-Hubbard model on near-term quantum computers

Abstract

The Fermi-Hubbard model is of fundamental importance in condensed-matter physics, yet is extremely challenging to solve numerically. Finding the ground state of the Hubbard model using variational methods has been predicted to be one of the first applications of near-term quantum computers. Here we carry out a detailed analysis and optimisation of the complexity of variational quantum algorithms for finding the ground state of the Hubbard model, including costs associated with mapping to a real-world hardware platform. The depth complexities we find are substantially lower than previous work. We performed extensive numerical experiments for systems with up to 12 sites. The results suggest that the variational ansätze we used -- an efficient variant of the Hamiltonian Variational ansatz and a novel generalisation thereof -- will be able to find the ground state of the Hubbard model with high fidelity in relatively low quantum circuit depth. Our experiments include the effect of realistic measurements and depolarising noise. If our numerical results on small lattice sizes are representative of the somewhat larger lattices accessible to near-term quantum hardware, they suggest that optimising over quantum circuits with a gate depth less than a thousand could be sufficient to solve instances of the Hubbard model beyond the capacity of classical exact diagonalisation.

arXiv comment14+11 pages, 19 figures, 5 tables; v3: publication version

References in corpus (51)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• A variational eigenvalue solver on a quantum processor
• Correlated Electrons in High Temperature Superconductors
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Quantum Simulation
• The theory of variational hybrid quantum-classical algorithms
• Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• Fermionic quantum computation
• Scalable Quantum Simulation of Molecular Energies
• Towards Practical Quantum Variational Algorithms
• Quantum optimization using variational algorithms on near-term quantum devices
• Quantum Simulators: Architectures and Opportunities
• Toward the first quantum simulation with quantum speedup
• Fermi-Hubbard physics with atoms in an optical lattice
• Solutions of the Two Dimensional Hubbard Model: Benchmarks and Results from a Wide Range of Numerical Algorithms
• Generalized Unitary Coupled Cluster Wavefunctions for Quantum Computation
• Quantum chemistry calculations on a trapped-ion quantum simulator
• Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• Quantum algorithms for electronic structure calculations: particle/hole Hamiltonian and optimized wavefunction expansions
• Quantum simulation of a Fermi-Hubbard model using a semiconductor quantum dot array
• Realizing Rapid, High-Fidelity, Single-Shot Dispersive Readout of Superconducting Qubits
• Quantum Implementation of Unitary Coupled Cluster for Simulating Molecular Electronic Structure
• Gate count estimates for performing quantum chemistry on small quantum computers
• QuEST and High Performance Simulation of Quantum Computers
• Efficient and Noise Resilient Measurements for Quantum Chemistry on Near-Term Quantum Computers
• Efficient Symmetry-Preserving State Preparation Circuits for the Variational Quantum Eigensolver Algorithm
• Mapping local Hamiltonians of fermions to local Hamiltonians of spins
• Sequential minimal optimization for quantum-classical hybrid algorithms
• Quantum circuits for strongly correlated quantum systems
• Quantum algorithms to simulate many-body physics of correlated fermions
• Quantum Hamiltonian Complexity
• Gate-efficient simulation of molecular eigenstates on a quantum computer
• An Adaptive Optimizer for Measurement-Frugal Variational Algorithms
• Operator Locality in Quantum Simulation of Fermionic Models
• Minimizing State Preparations in Variational Quantum Eigensolver by Partitioning into Commuting Families
• Learning to learn with quantum neural networks via classical neural networks
• Fermions without fermi fields
• Local spin operators for fermion simulations
• Resource Estimation for Quantum Variational Simulations of the Hubbard Model
• Finding the ground state of the Hubbard model by variational methods on a quantum computer with gate errors
• Low cost quantum circuits for classically intractable instances of the Hamiltonian dynamics simulation problem
• Toward convergence of effective field theory simulations on digital quantum computers
• Quantum gates and architecture for the quantum simulation of the Fermi-Hubbard model
• A method to efficiently simulate the thermodynamical properties of the Fermi-Hubbard model on a quantum computer
• The Hubbard model with smooth boundary conditions
• Effects of gate errors in digital quantum simulations of fermionic systems
• A Jacobi Diagonalization and Anderson Acceleration Algorithm For Variational Quantum Algorithm Parameter Optimization
• Numerical Studies of the 2D Hubbard Model

Cited by in corpus (118)

• Variational Quantum Algorithms
• Noisy intermediate-scale quantum (NISQ) algorithms
• The Variational Quantum Eigensolver: a review of methods and best practices
• Noise-Induced Barren Plateaus in Variational Quantum Algorithms
• Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
• Exponential Error Suppression for Near-Term Quantum Devices
• Digitized-counterdiabatic quantum approximate optimization algorithm
• Performance comparison of optimization methods on variational quantum algorithms
• A Compact Fermion to Qubit Mapping
• Observing ground-state properties of the Fermi-Hubbard model using a scalable algorithm on a quantum computer
• Quantum Power Method by a Superposition of Time-Evolved States
• Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
• Quantum-optimal-control-inspired ansatz for variational quantum algorithms
• Simulating Quantum Materials with Digital Quantum Computers
• Multi-exponential Error Extrapolation and Combining Error Mitigation Techniques for NISQ Applications
• Early fault-tolerant simulations of the Hubbard model
• Multicore Quantum Computing
• Nearly tight Trotterization of interacting electrons
• Towards near-term quantum simulation of materials
• Variational quantum eigensolver for the Heisenberg antiferromagnet on the kagome lattice
• Building spatial symmetries into parameterized quantum circuits for faster training
• Variational Quantum Simulation for Periodic Materials
• Nuclear shell-model simulation in digital quantum computers
• Modeling and mitigation of cross-talk effects in readout noise with applications to the Quantum Approximate Optimization Algorithm
• Partially Fault-tolerant Quantum Computing Architecture with Error-corrected Clifford Gates and Space-time Efficient Analog Rotations
• Quantum Phase Recognition via Quantum Kernel Methods
• Measuring the Loschmidt amplitude for finite-energy properties of the Fermi-Hubbard model on an ion-trap quantum computer
• Benchmarking variational quantum eigensolvers for the square-octagon-lattice Kitaev model
• Tight and Efficient Gradient Bounds for Parameterized Quantum Circuits
• One-particle Green's functions from the quantum equation of motion algorithm
• Accelerating the variational quantum eigensolver using parallelism
• Training variational quantum algorithms with random gate activation
• Recurrent Quantum Neural Networks
• A systematic variational approach to band theory in a quantum computer
• Lie-algebraic classical simulations for quantum computing
• Simulating strongly interacting Hubbard chains with the Variational Hamiltonian Ansatz on a quantum computer
• Fault-tolerant quantum algorithms for quantum molecular systems: A survey
• Networked Quantum Services
• Fermionic Quantum Approximate Optimization Algorithm
• Spatial, spin, and charge symmetry projections for a Fermi-Hubbard model on a quantum computer
• Quantum many-body states and Green functions of nonequilibrium electron-magnon systems: Localized spin operators vs. their mapping to Holstein-Primakoff bosons
• Quantum algorithms for scientific computing
• Variational dynamics as a ground-state problem on a quantum computer
• Variational Quantum Eigensolver for SU($N$) Fermions
• FLIP: A flexible initializer for arbitrarily-sized parametrized quantum circuits
• Estimating Quantum Hamiltonians via Joint Measurements of Noisy Non-Commuting Observables
• Error mitigation by training with fermionic linear optics
• Gutzwiller wave function on a digital quantum computer
• Low-depth simulations of fermionic systems on square-grid quantum hardware
• EHA: Entanglement-variational Hardware-efficient Ansatz for Eigensolvers
• Complexity of Supersymmetric Systems and the Cohomology Problem
• Adaptive variational preparation of the Fermi-Hubbard eigenstates
• A Quantum Computing Implementation of Nuclear-Electronic Orbital (NEO) Theory: Towards an Exact pre-Born-Oppenheimer Formulation of Molecular Quantum Systems
• Simulating a ring-like Hubbard system with a quantum computer
• Adiabatic quantum algorithm for artificial graphene
• Measurement-induced entanglement phase transitions in variational quantum circuits
• Characterization of variational quantum algorithms using free fermions
• Experimental Demonstration of Break-Even for the Compact Fermionic Encoding
• Computation of Green's function by local variational quantum compilation
• Quantum Computed Green's Functions using a Cumulant Expansion of the Lanczos Method
• A Hybrid Quantum-Classical Method for Electron-Phonon Systems
• Evaluating the Resilience of Variational Quantum Algorithms to Leakage Noise
• Improving the performance of quantum approximate optimization for preparing non-trivial quantum states without translational symmetry
• Convergence and Quantum Advantage of Trotterized MERA for Strongly-Correlated Systems
• Double-bracket quantum algorithms for quantum imaginary-time evolution
• Parameter-Parallel Distributed Variational Quantum Algorithm
• Fundamental charges for dual-unitary circuits
• Photonic counterdiabatic quantum optimization algorithm
• Estimating Gibbs partition function with quantumClifford sampling
• Unlocking early fault-tolerant quantum computing with mitigated magic dilution
• A Classically Efficient Quantum Scalable Fermi-Hubbard Benchmark
• Quantum simulation costs for Suzuki-Trotter decomposition of quantum many-body lattice models
• Quantum neural compressive sensing for ghost imaging
• Compressed variational quantum eigensolver for the Fermi-Hubbard model
• Sketching phase diagrams using low-depth variational quantum algorithms
• Compressing Hamiltonians with ab initio downfolding for simulating strongly-correlated materials on quantum computers
• Exploring Ground States of Fermi-Hubbard Model on Honeycomb Lattices with Counterdiabaticity
• Optimization strategies in WAHTOR algorithm for quantum computing empirical ansatz: a comparative study
• Quantum computing quantum Monte Carlo algorithm
• Efficient Quantum Cooling Algorithm for Fermionic Systems
• Exploiting subspace constraints and ab initio variational methods for quantum chemistry
• Quantifying Grover speed-ups beyond asymptotic analysis
• From Heisenberg to Hubbard: An initial state for the shallow quantum simulation of correlated electrons
• Quantum-assisted variational Monte Carlo
• The Weak, the Strong and the Long Correlation Regimes of the Two-Dimensional Hubbard Model at Finite Temperature
• A Simple and Efficient Joint Measurement Strategy for Estimating Fermionic Observables and Hamiltonians
• Parallelization techniques for quantum simulation of fermionic systems
• Classical Benchmarks for Variational Quantum Eigensolver Simulations of the Hubbard Model
• Compact Multi-Threshold Quantum Information Driven Ansatz For Strongly Interactive Lattice Spin Models
• Recursive relations and quantum eigensolver algorithms within modified Schrieffer--Wolff transformations for the Hubbard dimer
• Survey on Computational Applications of Tensor Network Simulations
• Non-local resources for error correction in quantum LDPC codes
• Simulating quantum field theories on gate-based quantum computers
• Solving the Hubbard model using density matrix embedding theory and the variational quantum eigensolver
• Prospects for NMR Spectral Prediction on Fault-Tolerant Quantum Computers
• Learning Density Functionals from Noisy Quantum Data
• Simulating the Fermi-Hubbard model with long-range hopping on a quantum computer
• Extracting the spin excitation spectrum of a fermionic system using a quantum processor
• Preparation Circuits for Matrix Product States by Classical Variational Disentanglement
• Concurrent Fermionic Simulation Gate
• Efficient Fermi-Hubbard model ground-state preparation by coupling to a classical reservoir in the instantaneous-response limit
• Local fermion-to-qudit mappings: a practical recipe for four-level systems
• Encoding strongly-correlated many-boson wavefunctions on a photonic quantum computer: application to the attractive Bose-Hubbard model
• Quantum Algorithm for Green's Functions Measurements in the Fermi-Hubbard Model
• Orbital Expansion Variational Quantum Eigensolver: Enabling Efficient Simulation of Molecules with Shallow Quantum Circuit
• Near-Term Fermionic Simulation with Subspace Noise Tailored Quantum Error Mitigation
• Simplifying errors by symmetry and randomisation
• Scalable Simulation of Fermionic Encoding Performance on Noisy Quantum Computers
• Slice-Wise Initial State Optimization to Improve Cost and Accuracy of the VQE on Lattice Models
• Quantum speed-up for solving the one-dimensional Hubbard model using quantum annealing
• Hidden local adiabatic ramp in the modulated time evolution and the quantum approximate optimization algorithm
• An occupation number quantum subspace expansion approach to compute the single-particle Green function: an opportunity for noise filtering
• Efficient quantum simulation for translationally invariant systems
• Quantum Computing Demonstration of the Polaron-Molecule Transition on a NISQ Device
• Schmidt quantum compressor
• Tucker iterative quantum state preparation
• Effective non-local parity-dependent couplings in qubit chains
• Majorana string simulation of nonequilibrium dynamics in two-dimensional lattice fermion systems