High-precision and low-depth quantum algorithm design for eigenstate problems
Jinzhao Sun, Pei Zeng, Tom Gur, M. S. Kim

TL;DR
This paper introduces a quantum algorithm that efficiently estimates eigenstates and eigenenergies with high precision, low circuit depth, and robustness to noise, suitable for practical quantum hardware implementations.
Contribution
It presents a full-stack quantum algorithm design with logarithmic precision dependence and near-optimal system-size scaling, improving practical eigenstate estimation on quantum devices.
Findings
Achieves $ ilde{O} ( ext{log} rac{1}{ ext{precision}})$ gate complexity per circuit.
Demonstrates high-precision eigenenergy estimation on IBM quantum devices.
Shows robustness to noise in practical quantum computations.
Abstract
Estimating the eigenstate properties of quantum systems is a long-standing, challenging problem for both classical and quantum computing. Existing universal quantum algorithms typically rely on ideal and efficient query models (e.g. time evolution operator or block encoding of the Hamiltonian), which, however, become suboptimal for actual implementation at the quantum circuit level. Here, we present a full-stack design of quantum algorithms for estimating the eigenenergy and eigenstate properties, which can achieve high precision and good scaling with system size. The gate complexity per circuit for estimating generic Hamiltonians' eigenstate properties is , which has a logarithmic dependence on the inverse precision . For lattice Hamiltonians, the circuit depth of our design achieves near-optimal system-size scaling, even with local qubit…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
