Simulating strongly interacting Hubbard chains with the Variational Hamiltonian Ansatz on a quantum computer

Abstract

Hybrid quantum-classical algorithms have been proposed to circumvent noise limitations in quantum computers. Such algorithms delegate only a calculation of the expectation value to the quantum computer. Among them, the Variational Quantum Eigensolver (VQE) has been implemented to study molecules and condensed matter systems on small size quantum computers. Condensed matter systems described by the Hubbard model exhibit a rich phase diagram alongside exotic states of matter. In this manuscript, we try to answer the question: how much of the underlying physics of a 1D Hubbard chain is described by a problem-inspired Variational Hamiltonian Ansatz (VHA) in a broad range of parameter values ? We start by probing how much does the solution increases fidelity with increasing ansatz complexity. Our findings suggest that even low fidelity solutions capture energy and number of doubly occupied sites well, while spin-spin correlations are not well captured even when the solution is of high fidelity. Our powerful simulation platform allows us to incorporate a realistic noise model and shows a successful implementation of noise-mitigation strategies - post-selection and the Richardson extrapolation. Finally, we compare our results with an experimental realization of the algorithm on IBM Quantum's ibmq_quito device.

References in corpus (36)

• SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
• Quantum Computing in the NISQ era and beyond
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• A variational eigenvalue solver on a quantum processor
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Barren plateaus in quantum neural network training landscapes
• A Quantum Approximate Optimization Algorithm
• Error mitigation for short-depth quantum circuits
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
• Extending the computational reach of a noisy superconducting quantum processor
• A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
• Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
• Towards Practical Quantum Variational Algorithms
• Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
• Variational ansatz-based quantum simulation of imaginary time evolution
• Characterizing Quantum Gates via Randomized Benchmarking
• Solutions of the Two Dimensional Hubbard Model: Benchmarks and Results from a Wide Range of Numerical Algorithms
• Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
• qubit-ADAPT-VQE: An adaptive algorithm for constructing hardware-efficient ansatze on a quantum processor
• Solving strongly correlated electron models on a quantum computer
• A universal quantum circuit for two-qubit transformations with three CNOT gates
• Efficient Symmetry-Preserving State Preparation Circuits for the Variational Quantum Eigensolver Algorithm
• Exploring entanglement and optimization within the Hamiltonian Variational Ansatz
• From high temperature supercondutivity to quantum spin liquid: progress in strong correlation physics
• Strategies for solving the Fermi-Hubbard model on near-term quantum computers
• Quantum algorithms to simulate many-body physics of correlated fermions
• Symmetry-adapted variational quantum eigensolver
• Penalty methods for variational quantum eigensolver
• Resource Estimation for Quantum Variational Simulations of the Hubbard Model
• Symmetry assisted preparation of entangled many-body states on a quantum computer
• Finding the ground state of the Hubbard model by variational methods on a quantum computer with gate errors
• Exact and approximate symmetry projectors for the electronic structure problem on a quantum computer
• Spatial, spin, and charge symmetry projections for a Fermi-Hubbard model on a quantum computer
• Gutzwiller wave function on a digital quantum computer
• Gutzwiller wave function on a quantum computer using a discrete Hubbard-Stratonovich transformation

Cited by in corpus (12)

• Using Differential Evolution to avoid local minima in Variational Quantum Algorithms
• Applicability of Measurement-based Quantum Computation towards Physically-driven Variational Quantum Eigensolver
• Hybrid quantum-classical algorithm for the transverse-field Ising model in the thermodynamic limit
• Equivariant Variational Quantum Eigensolver to detect Phase Transitions through Energy Level Crossings
• Compressing Hamiltonians with ab initio downfolding for simulating strongly-correlated materials on quantum computers
• Exploiting subspace constraints and ab initio variational methods for quantum chemistry
• Classical Benchmarks for Variational Quantum Eigensolver Simulations of the Hubbard Model
• Recursive relations and quantum eigensolver algorithms within modified Schrieffer--Wolff transformations for the Hubbard dimer
• Simulating the Fermi-Hubbard model with long-range hopping on a quantum computer
• Realizing non-trivial doublon formation using a quantum computer
• A low-circuit-depth quantum computing approach to the nuclear shell model
• Quantum algorithm for one-quasiparticle excitations in the thermodynamic limit via cluster-additive block diagonalization