Even shorter quantum circuit for phase estimation on early fault-tolerant quantum computers with applications to ground-state energy estimation

Abstract

We develop a phase estimation method with a distinct feature: its maximal runtime (which determines the circuit depth) is $\delta /\epsilon$, where $\epsilon$ is the target precision, and the preconstant $\delta$ can be arbitrarily close to $0$ as the initial state approaches the target eigenstate. The total cost of the algorithm satisfies the Heisenberg-limited scaling $\tilde{\mathcal{O}}({\epsilon }^{-1})$. As a result, our algorithm may significantly reduce the circuit depth for performing phase estimation tasks on early fault-tolerant quantum computers. The key technique is a simple subroutine called quantum complex exponential least squares (QCELS). Our algorithm can be readily applied to reduce the circuit depth for estimating the ground-state energy of a quantum Hamiltonian, when the overlap between the initial state and the ground state is large. If this initial overlap is small, we can combine our method with the Fourier filtering method developed in [Lin, Tong, PRX Quantum 3, 010318, 2022], and the resulting algorithm provably reduces the circuit depth in the presence of a large relative overlap compared to $\epsilon$. The relative overlap condition is similar to a spectral gap assumption, but it is aware of the information in the initial state and is therefore applicable to certain Hamiltonians with small spectral gaps. We observe that the circuit depth can be reduced by around two orders of magnitude in numerical experiments under various settings.

References in corpus (12)

• Entanglement-free Heisenberg-limited phase estimation
• QuSpin: a Python Package for Dynamics and Exact Diagonalisation of Quantum Many Body Systems part I: spin chains
• General optimality of the Heisenberg limit for quantum metrology
• The power of quantum systems on a line
• Optimal Quantum Measurements of Expectation Values of Observables
• Heisenberg-limited ground state energy estimation for early fault-tolerant quantum computers
• Ground state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices
• A randomized quantum algorithm for statistical phase estimation
• Error mitigation via verified phase estimation
• A theory of quantum subspace diagonalization
• Evaluating energy differences on a quantum computer with robust phase estimation
• Computing Ground State Properties with Early Fault-Tolerant Quantum Computers

Cited by in corpus (46)

• Early Fault-Tolerant Quantum Computing
• Quantum algorithm for ground state energy estimation using circuit depth with exponentially improved dependence on precision
• On low-depth algorithms for quantum phase estimation
• Simultaneous estimation of multiple eigenvalues with short-depth quantum circuit on early fault-tolerant quantum computers
• Rapid initial state preparation for the quantum simulation of strongly correlated molecules
• Measuring the Loschmidt amplitude for finite-energy properties of the Fermi-Hubbard model on an ion-trap quantum computer
• Quantum Multiple Eigenvalue Gaussian filtered Search: an efficient and versatile quantum phase estimation method
• Quantum simulation of battery materials using ionic pseudopotentials
• Fault-tolerant quantum algorithms for quantum molecular systems: A survey
• Phase-Sensitive Quantum Measurement without Controlled Operations
• High ground state overlap via quantum embedding methods
• Modeling the Performance of Early Fault-Tolerant Quantum Algorithms
• Compilation of a simple chemistry application to quantum error correction primitives
• Early Fault-Tolerant Quantum Algorithms in Practice: Application to Ground-State Energy Estimation
• Efficient Quantum Algorithm for Filtering Product States
• Double-bracket quantum algorithms for quantum imaginary-time evolution
• Efficient ground-state energy estimation and certification on early fault-tolerant quantum computers
• Quantum techniques for eigenvalue problems
• Accelerating two-dimensional electronic spectroscopy simulations with a probe qubit protocol
• Molecular Properties from Quantum Krylov Subspace Diagonalization
• Optimal Low-Depth Quantum Signal-Processing Phase Estimation
• Error mitigation and circuit division for early fault-tolerant quantum phase estimation
• Subspace-Based Local Compilation of Variational Quantum Circuits for Large-Scale Quantum Many-Body Simulation
• Encoded probabilistic imaginary-time evolution on a trapped-ion quantum computer for ground and excited states of spin qubits
• Quantum Phase Estimation by Compressed Sensing
• Estimating Eigenenergies from Quantum Dynamics: A Unified Noise-Resilient Measurement-Driven Approach
• Ground state energy and magnetization curve of a frustrated magnetic system from real-time evolution on a digital quantum processor
• Optimal Coherent Quantum Phase Estimation via Tapering
• Phase estimation with partially randomized time evolution
• Adaptive measurement strategy for quantum subspace methods
• High-precision and low-depth quantum algorithm design for eigenstate problems
• Channel-based framework for phase esimation of multiple eigenvalues
• Quantum many-body simulation of finite-temperature systems with sampling a series expansion of a quantum imaginary-time evolution
• Stabilizer configuration interaction: Finding molecular subspaces with error detection properties
• Accelerating Quantum Eigensolver Algorithms With Machine Learning
• Enhancing Scalability of Quantum Eigenvalue Transformation of Unitary Matrices for Ground State Preparation through Adaptive Finer Filtering
• Dissipative ground state preparation in ab initio electronic structure theory
• Quantum State Preparation Of Multiconfigurational States For Quantum Chemistry
• Averaging gate approximation error and performance of Unitary Coupled Cluster ansatz in Pre-FTQC Era
• Hybrid quantum gap estimation algorithm using a filtered time series
• Noise-resilient and resource-efficient hybrid algorithm for robust quantum gap estimation
• Quantum Imaginary-Time Evolution with Polynomial Resources in Evolution Time
• A quantum eigenvalue solver based on tensor networks
• Transversal architecture for megaquop-scale quantum simulation with neutral atoms
• Tensor-based phase difference estimation on time series analysis
• Numerical investigation of the quantum inverse algorithm on small molecules