Quantifying $T$-gate-count improvements for ground-state-energy estimation with near-optimal state preparation

Abstract

We study the question of when investing additional quantum resources in preparing a ground state will improve the aggregate runtime associated with estimating its energy. We analyze Lin and Tong's near-optimal state preparation algorithm and show that it can reduce a proxy for the runtime, the $T$-gate count, of ground state energy estimation near quadratically. Resource estimates are provided that specify the conditions under which the added cost of state preparation is worthwhile.

References in corpus (36)

• A variational eigenvalue solver on a quantum processor
• Surface codes: Towards practical large-scale quantum computation
• Adiabatic Quantum Computing
• Simulated Quantum Computation of Molecular Energies
• Scalable Quantum Simulation of Molecular Energies
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Elucidating Reaction Mechanisms on Quantum Computers
• Toward the first quantum simulation with quantum speedup
• Quantum Algorithms for Quantum Field Theories
• t$|$ket$⟩$ : A Retargetable Compiler for NISQ Devices
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• Even more efficient quantum computations of chemistry through tensor hypercontraction
• Quantum computing enhanced computational catalysis
• Magic State Distillation: Not as Costly as You Think
• Efficient Bayesian Phase Estimation
• Heisenberg-limited ground state energy estimation for early fault-tolerant quantum computers
• Nearly optimal lattice simulation by product formulas
• Near-optimal ground state preparation
• Digitization of Scalar Fields for Quantum Computing
• General Methods for Digital Quantum Simulation of Gauge Theories
• Efficient phase-factor evaluation in quantum signal processing
• Quantum Algorithms for Simulating the Lattice Schwinger Model
• Improved Techniques for Preparing Eigenstates of Fermionic Hamiltonians
• Robust Calibration of a Universal Single-Qubit Gate-Set via Robust Phase Estimation
• Fault-Tolerant Quantum Simulations of Chemistry in First Quantization
• Preparing ground states of quantum many-body systems on a quantum computer
• Hamiltonian Simulation Using Linear Combinations of Unitary Operations
• Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems
• Quantum Simulation of Chemistry with Sublinear Scaling in Basis Size
• Faster Digital Quantum Simulation by Symmetry Protection
• Error mitigation via verified phase estimation
• Nearly tight Trotterization of interacting electrons
• Evaluating energy differences on a quantum computer with robust phase estimation
• Simulating key properties of lithium-ion batteries with a fault-tolerant quantum computer
• Resource estimate for quantum many-body ground-state preparation on a quantum computer
• TFermion: A non-Clifford gate cost assessment library of quantum phase estimation algorithms for quantum chemistry

Cited by in corpus (7)

• Early Fault-Tolerant Quantum Computing
• Benchmarking quantum computers
• Exponential improvements in the simulation of lattice gauge theories using near-optimal techniques
• Beyond MP2 initialization for unitary coupled cluster quantum circuits
• Non-unitary Coupled Cluster Enabled by Mid-circuit Measurements on Quantum Computers
• OnionVQE Optimization Strategy for Ground State Preparation on NISQ Devices
• Calculating potential energy surfaces with quantum computers by measuring only the density along adiabatic transitions