Exponential distillation of dominant eigenproperties

Abstract

Estimating observable expectation values in eigenstates of quantum systems has a broad range of applications and is an area where early fault-tolerant quantum computers may provide practical quantum advantage. We develop a hybrid quantum-classical algorithm that enables the estimation of an arbitrary observable expectation value in an eigenstate, given an initial state is supplied that has dominant overlap with the targeted eigenstate -- but may overlap with any other eigenstates. Our approach builds on and is conceptually similar to purification-based error mitigation techniques; however, it achieves exponential suppression of algorithmic errors using only a single copy of the quantum state. The key innovation is that random time evolution is applied in the quantum computer to create an average mixed quantum state, which is then virtually purified with exponential efficacy. We prove rigorous performance guarantees and conclude that the complexity of our approach depends directly on the energy gap in the problem Hamiltonian and remarkably, can be compared to phase estimation combined with amplitude estimation in terms of its scaling with respect to a target precision. We demonstrate in a broad range of numerical simulations the applicability of our framework in near-term and early fault-tolerant settings. Furthermore, we demonstrate in a 100-qubit example that direct classical simulation of our approach enables the prediction of ground and excited state properties of quantum systems using tensor-network techniques, which we recognize as a quantum-inspired classical approach.

24 pages, 15 figures

References in corpus (59)

• A variational eigenvalue solver on a quantum processor
• Variational Quantum Algorithms
• Noisy intermediate-scale quantum (NISQ) algorithms
• Efficient simulation of one-dimensional quantum many-body systems
• Quantum computational chemistry
• Quantum Chemistry in the Age of Quantum Computing
• Matrix Product Density Operators: Simulation of finite-T and dissipative systems
• Quantum algorithms for quantum chemistry and quantum materials science
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
• Efficient variational quantum simulator incorporating active error minimisation
• Variational ansatz-based quantum simulation of imaginary time evolution
• Hybrid quantum-classical algorithms and quantum error mitigation
• Variational Quantum Computation of Excited States
• Theory of variational quantum simulation
• Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• A random compiler for fast Hamiltonian simulation
• QuEST and High Performance Simulation of Quantum Computers
• Is there evidence for exponential quantum advantage in quantum chemistry?
• Beyond Barren Plateaus: Quantum Variational Algorithms Are Swamped With Traps
• Barren Plateaus in Variational Quantum Computing
• Heisenberg-limited ground state energy estimation for early fault-tolerant quantum computers
• Emerging quantum computing algorithms for quantum chemistry
• Near-optimal ground state preparation
• Quantum circuits for strongly correlated quantum systems
• The methodology of resonant equiangular composite quantum gates
• Exponential Error Suppression for Near-Term Quantum Devices
• Hamiltonian Simulation Using Linear Combinations of Unitary Operations
• Algorithms for quantum simulation at finite energies
• Quantum Krylov subspace algorithms for ground and excited state energy estimation
• Error mitigation via verified phase estimation
• Quantum algorithm for ground state energy estimation using circuit depth with exponentially improved dependence on precision
• Mitigating Coherent Noise Using Pauli Conjugation
• Resource Estimation for Quantum Variational Simulations of the Hubbard Model
• Quantum natural gradient generalised to noisy and non-unitary circuits
• Spectral Gap Amplification
• QuESTlink -- Mathematica embiggened by a hardware-optimised quantum emulator
• Quantum Virtual Cooling
• Quantum computing for chemistry and physics applications from a Monte Carlo perspective
• Quantum Error Mitigated Classical Shadows
• Rapid initial state preparation for the quantum simulation of strongly correlated molecules
• Accelerated quantum Monte Carlo with mitigated error on noisy quantum computer
• Shorter quantum circuits via single-qubit gate approximation
• Training variational quantum circuits with CoVaR: covariance root finding with classical shadows
• Loschmidt Echo and the Local Density of States
• Error-resilient Monte Carlo quantum simulation of imaginary time
• Improved Accuracy for Trotter Simulations Using Chebyshev Interpolation
• Probabilistic Interpolation of Quantum Rotation Angles
• Quantum-assisted Monte Carlo algorithms for fermions
• Algorithmic Shadow Spectroscopy
• Hamiltonian simulation for low-energy states with optimal time dependence
• Early Fault-Tolerant Quantum Algorithms in Practice: Application to Ground-State Energy Estimation
• Fast quantum simulation of electronic structure by spectrum amplification
• Efficient ground-state energy estimation and certification on early fault-tolerant quantum computers
• TE-PAI: Exact Time Evolution by Sampling Random Circuits
• Sparse Probabilistic Synthesis of Quantum Operations
• Biased Estimator Channels for Classical Shadows
• Space-time tradeoff in networked virtual distillation