Some Error Analysis for the Quantum Phase Estimation Algorithms

Abstract

This paper is concerned with the phase estimation algorithm in quantum computing algorithms, especially the scenarios where (1) the input vector is not an eigenvector; (2) the unitary operator is not exactly implemented; (3) random approximations are used for the unitary operator, e.g., the QDRIFT method. We characterize the probability of computing the phase values in terms of the consistency error, including the residual error, Trotter splitting error, or statistical mean-square error. In the first two cases, we show that in order to obtain the phase value with {error less or equal to $2^{-n}$ } and probability at least $1-\epsilon$, the required number of qubits is $t\ge n+\log (2+\frac{{\delta }^2}{2\epsilon \Delta E^2}).$ The parameter $\delta$ quantifies the error associated with the inexact eigenvector and/or the unitary operator, and $\Delta E$ characterizes the spectral gap, i.e., the separation from the rest of the phase values. For the third case, we found a similar estimate, but the number of random steps has to be sufficiently large.

References in corpus (39)

• Quantum algorithm for solving linear systems of equations
• Quantum Amplitude Amplification and Estimation
• Quantum Algorithms Revisited
• Hamiltonian Simulation by Qubitization
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• A Theory of Trotter Error
• Simulation of Electronic Structure Hamiltonians Using Quantum Computers
• Quantum measurements and the Abelian Stabilizer Problem
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• Hamiltonian simulation with nearly optimal dependence on all parameters
• A random compiler for fast Hamiltonian simulation
• Quantum Metropolis Sampling
• Chemical Basis of Trotter-Suzuki Errors in Quantum Chemistry Simulation
• Heisenberg-limited ground state energy estimation for early fault-tolerant quantum computers
• Nearly optimal lattice simulation by product formulas
• Near-optimal ground state preparation
• Faster quantum simulation by randomization
• Improved Fault-Tolerant Quantum Simulation of Condensed-Phase Correlated Electrons via Trotterization
• Ab-initio Quantum Enhanced Optical Phase Estimation Using Real-time Feedback Control
• Fault-Tolerant Quantum Simulations of Chemistry in First Quantization
• Quantum Algorithm for Spectral Measurement with Lower Gate Count
• Time-dependent Hamiltonian simulation with $L^1$-norm scaling
• A randomized quantum algorithm for statistical phase estimation
• Early fault-tolerant simulations of the Hubbard model
• Time-dependent unbounded Hamiltonian simulation with vector norm scaling
• Hamiltonian Simulation in the Interaction Picture
• Compilation by stochastic Hamiltonian sparsification
• Quantum computing methods for electronic states of the water molecule
• Quantum algorithm for time-dependent Hamiltonian simulation by permutation expansion
• An optimal quantum algorithm to approximate the mean and its application for approximating the median of a set of points over an arbitrary distance
• Effects of Cosine Tapering Window on Quantum Phase Estimation
• Direct Application of the Phase Estimation Algorithm to Find the Eigenvalues of the Hamiltonians
• Improving Quantum Algorithms for Quantum Chemistry
• TFermion: A non-Clifford gate cost assessment library of quantum phase estimation algorithms for quantum chemistry
• Statistical Approach to Quantum Phase Estimation
• Time Dependent Hamiltonian Simulation Using Discrete Clock Constructions
• A Precise Error Bound for Quantum Phase Estimation
• A Partially Random Trotter Algorithm for Quantum Hamiltonian Simulations
• Quantum Phase Estimation Algorithm for Finding Polynomial Roots