Diagonalization of large many-body Hamiltonians on a quantum processor

Abstract

The estimation of low energies of many-body systems is a cornerstone of computational quantum sciences. Variational quantum algorithms can be used to prepare ground states on pre-fault-tolerant quantum processors, but their lack of convergence guarantees and impractical number of cost function estimations prevent systematic scaling of experiments to large systems. Alternatives to variational approaches are needed for large-scale experiments on pre-fault-tolerant devices. Here, we use a superconducting quantum processor to compute eigenenergies of quantum many-body systems on two-dimensional lattices of up to 56 sites, using the Krylov quantum diagonalization algorithm, an analog of the well-known classical diagonalization technique. We construct subspaces of the many-body Hilbert space using Trotterized unitary evolutions executed on the quantum processor, and classically diagonalize many-body interacting Hamiltonians within those subspaces. These experiments show that quantum diagonalization algorithms are poised to complement their classical counterpart at the foundation of computational methods for quantum systems.

25 pages, 13 figures

References in corpus (39)

• A variational eigenvalue solver on a quantum processor
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Towards Quantum Chemistry on a Quantum Computer
• Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
• Entanglement-free Heisenberg-limited phase estimation
• Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States
• Robust determination of molecular spectra on a quantum processor
• Probabilistic error cancellation with sparse Pauli-Lindblad models on noisy quantum processors
• Unbiasing Fermionic Quantum Monte Carlo with a Quantum Computer
• Heisenberg-limited ground state energy estimation for early fault-tolerant quantum computers
• Experimental Bayesian Quantum Phase Estimation on a Silicon Photonic Chip
• Model-free readout-error mitigation for quantum expectation values
• Increasing the representation accuracy of quantum simulations of chemistry without extra quantum resources
• Ground state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices
• A Non-Orthogonal Variational Quantum Eigensolver
• Quantum Krylov subspace algorithms for ground and excited state energy estimation
• 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
• Chemistry Beyond the Scale of Exact Diagonalization on a Quantum-Centric Supercomputer
• Real time evolution for ultracompact Hamiltonian eigenstates on quantum hardware
• Generalized quantum subspace expansion
• Exact and efficient Lanczos method on a quantum computer
• Quantum Filter Diagonalization with Double-Factorized Hamiltonians
• Quantum Filter Diagonalization: Quantum Eigendecomposition without Full Quantum Phase Estimation
• A theory of quantum subspace diagonalization
• Iterative Quantum Assisted Eigensolver
• Solving Quasiparticle Band Spectra of Real Solids using Neural-Network Quantum States
• Chemistry on quantum computers with virtual quantum subspace expansion
• Real-Time Krylov Theory for Quantum Computing Algorithms
• Lanczos recursion on a quantum computer for the Green's function and ground state
• Quantum Assisted Eigensolver
• Analysis of quantum Krylov algorithms with errors
• Sampling Error Analysis in Quantum Krylov Subspace Diagonalization
• Measurement-efficient quantum Krylov subspace diagonalisation
• Exponential challenges in unbiasing quantum Monte Carlo algorithms with quantum computers
• Quantum subspace expansion algorithm for Green's functions
• Response to "Exponential challenges in unbiasing quantum Monte Carlo algorithms with quantum computers"
• Leveraging hardware-control imperfections for error mitigation via generalized quantum subspace
• Shadow-based quantum subspace algorithm for the nuclear shell model

Cited by in corpus (15)

• Analysis of quantum Krylov algorithms with errors
• Efficient Strategies for Reducing Sampling Error in Quantum Krylov Subspace Diagonalization
• Quantum Computing Beyond Ground State Electronic Structure: A Review of Progress Toward Quantum Chemistry Out of the Ground State
• Bridging Quantum Computing and Nuclear Structure: Atomic Nuclei on a Trapped-Ion Quantum Computer
• Scalable Quantum Computational Science: A Perspective from Block-Encodings and Polynomial Transformations
• High-precision and low-depth quantum algorithm design for eigenstate problems
• Rovibrational energy levels of H${}_2$O by quantum computing
• Sampling (noisy) quantum circuits through randomized rounding
• Disambiguating Pauli noise in quantum computers
• Anomalous transport in U(1)-symmetric quantum circuits
• Moments-based quantum computation of the electric dipole moment of molecular systems
• Double-bracket quantum algorithms for high-fidelity ground state preparation
• Evaluating Sample-Based Krylov Quantum Diagonalization for Heisenberg Models with Applications to Materials Science
• Towards Compact Wavefunctions from Quantum-Selected Configuration Interaction
• Transversal architecture for megaquop-scale quantum simulation with neutral atoms