Hybrid quantum gap estimation algorithm using a filtered time series
arXiv:2212.14039 · doi:10.1103/PhysRevA.109.052403
Abstract
Quantum simulation advantage over classical memory limitations would allow compact quantum circuits to yield insight into intractable quantum many-body problems, but the interrelated obstacles of large circuit depth in quantum time evolution and noise seem to rule out unbiased quantum simulation in the near term. We prove that classical post-processing, i.e., long-time filtering of an offline time series, exponentially improves the circuit depth needed for quantum time evolution. We apply the filtering method to the construction of a hybrid quantum-classical algorithm to estimate energy gap, an important observable not governed by the variational theorem. We demonstrate, within an operating range of filtering, the success of the algorithm in proof-of-concept simulation for finite-size scaling of a minimal spin model. Our findings set the stage for unbiased quantum simulation to offer memory advantage in the near term.
12 pages, 8 figures
References in corpus (31)
- A variational eigenvalue solver on a quantum processor
- Barren plateaus in quantum neural network training landscapes
- The theory of variational hybrid quantum-classical algorithms
- Quantum Error Correction for Quantum Memories
- The Variational Quantum Eigensolver: a review of methods and best practices
- A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
- Towards Practical Quantum Variational Algorithms
- Toward the first quantum simulation with quantum speedup
- A Theory of Trotter Error
- Simulating Physical Phenomena by Quantum Networks
- Even more efficient quantum computations of chemistry through tensor hypercontraction
- Solving strongly correlated electron models on a quantum computer
- Hybrid quantum-classical approach to correlated materials
- Efficient Bayesian Phase Estimation
- Heisenberg-limited ground state energy estimation for early fault-tolerant quantum computers
- Nearly optimal lattice simulation by product formulas
- Review of Decoherence Free Subspaces, Noiseless Subsystems, and Dynamical Decoupling
- Quantum phase estimation of multiple eigenvalues for small-scale (noisy) experiments
- Quantum localization bounds Trotter errors in digital quantum simulation
- Exploiting locality in quantum computation for quantum chemistry
- Even shorter quantum circuit for phase estimation on early fault-tolerant quantum computers with applications to ground-state energy estimation
- Error mitigation via verified phase estimation
- Fixed Depth Hamiltonian Simulation via Cartan Decomposition
- Quantum algorithm for ground state energy estimation using circuit depth with exponentially improved dependence on precision
- Evaluating energy differences on a quantum computer with robust phase estimation
- Quantum-classical simulation of two-site dynamical mean-field theory on noisy quantum hardware
- Destructive Error Interference in Product-Formula Lattice Simulation
- Simultaneous estimation of multiple eigenvalues with short-depth quantum circuit on early fault-tolerant quantum computers
- Optimized Lie-Trotter-Suzuki decompositions for two and three non-commuting terms
- Randomized gap and amplitude estimation
- Measurement-Based Time Evolution for Quantum Simulation of Fermionic Systems