Computing Ground State Properties with Early Fault-Tolerant Quantum Computers

Abstract

Significant effort in applied quantum computing has been devoted to the problem of ground state energy estimation for molecules and materials. Yet, for many applications of practical value, additional properties of the ground state must be estimated. These include Green's functions used to compute electron transport in materials and the one-particle reduced density matrices used to compute electric dipoles of molecules. In this paper, we propose a quantum-classical hybrid algorithm to efficiently estimate such ground state properties with high accuracy using low-depth quantum circuits. We provide an analysis of various costs (circuit repetitions, maximal evolution time, and expected total runtime) as a function of target accuracy, spectral gap, and initial ground state overlap. This algorithm suggests a concrete approach to using early fault tolerant quantum computers for carrying out industry-relevant molecular and materials calculations.

References in corpus (40)

• A variational eigenvalue solver on a quantum processor
• Quantum algorithm for solving linear systems of equations
• The theory of variational hybrid quantum-classical algorithms
• Quantum Chemistry in the Age of Quantum Computing
• Simulated Quantum Computation of Molecular Energies
• Hamiltonian Simulation by Qubitization
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
• Toward the first quantum simulation with quantum speedup
• The Bravyi-Kitaev transformation for quantum computation of electronic structure
• Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
• Optimal Quantum Measurements of Expectation Values of Observables
• Variational Quantum Linear Solver
• Heisenberg-limited ground state energy estimation for early fault-tolerant quantum computers
• Quantum algorithms for systems of linear equations inspired by adiabatic quantum computing
• Near-optimal ground state preparation
• Focus beyond quadratic speedups for error-corrected quantum advantage
• Preparing ground states of quantum many-body systems on a quantum computer
• Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems
• Digital quantum simulation of molecular vibrations
• Calculating energy derivatives for quantum chemistry on a quantum computer
• Fast-forwarding of Hamiltonians and Exponentially Precise Measurements
• Fast inversion, preconditioned quantum linear system solvers, and fast evaluation of matrix functions
• Early fault-tolerant simulations of the Hubbard model
• The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation
• Minimizing estimation runtime on noisy quantum computers
• Quantum Chemistry Simulations of Dominant Products in Lithium-Sulfur Batteries
• Near-term quantum algorithms for linear systems of equations
• Quantum Algorithms for Estimating Physical Quantities using Block-Encodings
• Spectral Gap Amplification
• First-Order Trotter Error from a Second-Order Perspective
• QMA-complete problems for stoquastic Hamiltonians and Markov matrices
• Computational Difficulty of Computing the Density of States
• Ground state connectivity of local Hamiltonians
• Quantum linear system solver based on time-optimal adiabatic quantum computing and quantum approximate optimization algorithm
• Quantum-accelerated constraint programming
• The complexity of simulating local measurements on quantum systems
• The Complexity of Translationally Invariant Problems beyond Ground State Energies
• Phase Estimation of Local Hamiltonians on NISQ Hardware

Cited by in corpus (35)

• Early Fault-Tolerant Quantum Computing
• Even shorter quantum circuit for phase estimation on early fault-tolerant quantum computers with applications to ground-state energy estimation
• Quantum algorithm for ground state energy estimation using circuit depth with exponentially improved dependence on precision
• On low-depth algorithms for quantum phase estimation
• Implementing any Linear Combination of Unitaries on Intermediate-term Quantum Computers
• Rapid initial state preparation for the quantum simulation of strongly correlated molecules
• Quantum Multiple Eigenvalue Gaussian filtered Search: an efficient and versatile quantum phase estimation method
• Qubit-Efficient Randomized Quantum Algorithms for Linear Algebra
• State Preparation Boosters for Early Fault-Tolerant Quantum Computation
• Fault-tolerant quantum algorithms for quantum molecular systems: A survey
• Certified algorithms for equilibrium states of local quantum Hamiltonians
• Fault-tolerant quantum computation of molecular observables
• Optimal scheduling in probabilistic imaginary-time evolution on a quantum computer
• Quantum Gaussian filter for exploring ground-state properties
• Modeling the Performance of Early Fault-Tolerant Quantum Algorithms
• Simple and high-precision Hamiltonian simulation by compensating Trotter error with linear combination of unitary operations
• Option pricing under stochastic volatility on a quantum computer
• On proving the robustness of algorithms for early fault-tolerant quantum computers
• Sequential optimal selection of a single-qubit gate and its relation to barren plateau in parameterized quantum circuits
• TFermion: A non-Clifford gate cost assessment library of quantum phase estimation algorithms for quantum chemistry
• Virtual quantum error detection
• Efficient Strategies for Reducing Sampling Error in Quantum Krylov Subspace Diagonalization
• Efficient ground-state energy estimation and certification on early fault-tolerant quantum computers
• Noise-aware variational eigensolvers: a dissipative route for lattice gauge theories
• Error mitigation and circuit division for early fault-tolerant quantum phase estimation
• Classical variational optimization of PREPARE circuit for quantum phase estimation of quantum chemistry Hamiltonians
• Double-bracket algorithm for quantum signal processing without post-selection
• Measuring Correlation and Entanglement between Molecular Orbitals on a Trapped-Ion Quantum Computer
• Stabilizer configuration interaction: Finding molecular subspaces with error detection properties
• High-precision and low-depth quantum algorithm design for eigenstate problems
• Towards Practical Quantum Phase Estimation: A Modular, Scalable, and Adaptive Approach
• Arbitrary Ground State Observables from Quantum Computed Moments
• Classical post-processing approach for quantum amplitude estimation
• Calculating potential energy surfaces with quantum computers by measuring only the density along adiabatic transitions
• Nonadiabatic Self-Healing of Trotter Errors in Digitized Counterdiabatic Dynamics