Resource estimate for quantum many-body ground-state preparation on a quantum computer

Abstract

We estimate the resources required to prepare the ground state of a quantum many-body system on a quantum computer of intermediate size. This estimate is made possible using a combination of quantum many-body methods and analytic upper bounds. Our routine can also be used to optimize certain design parameters for specific problem instances. Lastly, we propose and benchmark an improved quantum state preparation procedure. We find that it reduces the circuit T-depth by a factor as large as $10^6$ for intermediate-size lattices.

arXiv comment9 pages, 7 figures

References in corpus (32)

• The density-matrix renormalization group in the age of matrix product states
• A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• A Quantum Approximate Optimization Algorithm
• Quantum Chemistry in the Age of Quantum Computing
• Quantum Algorithms Revisited
• Hamiltonian Simulation by Qubitization
• A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Defining and detecting quantum speedup
• Toward the first quantum simulation with quantum speedup
• Quantum Computation by Adiabatic Evolution
• Quantum Algorithms for Quantum Field Theories
• Quantum measurements and the Abelian Stabilizer Problem
• Simulation of Electronic Structure Hamiltonians Using Quantum Computers
• Studying Two Dimensional Systems With the Density Matrix Renormalization Group
• A random compiler for fast Hamiltonian simulation
• Quantum Metropolis Sampling
• Gate count estimates for performing quantum chemistry on small quantum computers
• Solving strongly correlated electron models on a quantum computer
• Nearly optimal lattice simulation by product formulas
• How Powerful is Adiabatic Quantum Computation?
• Improved Fault-Tolerant Quantum Simulation of Condensed-Phase Correlated Electrons via Trotterization
• A Quantum-Quantum Metropolis Algorithm
• Improved Techniques for Preparing Eigenstates of Fermionic Hamiltonians
• Exponentially more precise quantum simulation of fermions I: Quantum chemistry in second quantization
• Preparing ground states of quantum many-body systems on a quantum computer
• Quantum Algorithm for Spectral Measurement with Lower Gate Count
• Exponentially More Precise Quantum Simulation of Fermions in the Configuration Interaction Representation
• Quantum-circuit design for efficient simulations of many-body quantum dynamics
• Efficient Quantum Walk Circuits for Metropolis-Hastings Algorithm

Cited by in corpus (17)

• Quantum algorithms for quantum chemistry and quantum materials science
• Exponential suppression of bit or phase flip errors with repetitive error correction
• Focus beyond quadratic speedups for error-corrected quantum advantage
• Benchmarking quantum computers
• Efficient Quantum Walk Circuits for Metropolis-Hastings Algorithm
• Optimizing resource efficiencies for scalable full-stack quantum computers
• Quantum digital cooling
• Self-healing of Trotter error in digital adiabatic state preparation
• Lanczos recursion on a quantum computer for the Green's function and ground state
• Fragmented imaginary-time evolution for early-stage quantum signal processors
• Parameter Estimation of Gravitational Waves with a Quantum Metropolis Algorithm
• ERASER: Towards Adaptive Leakage Suppression for Fault-Tolerant Quantum Computing
• Quantifying $T$-gate-count improvements for ground-state-energy estimation with near-optimal state preparation
• LILLIPUT: A Lightweight Low-Latency Lookup-Table Based Decoder for Near-term Quantum Error Correction
• Resource-optimized fault-tolerant simulation of the Fermi-Hubbard model and high-temperature superconductor models
• Block Lanczos method for excited states on a quantum computer
• Reflection-Based Adiabatic State Preparation