• Corpus ID: 244478140

Some Error Analysis for the Quantum Phase Estimation Algorithms

@article{Li2021SomeEA,
  title={Some Error Analysis for the Quantum Phase Estimation Algorithms},
  author={Xiantao Li},
  journal={ArXiv},
  year={2021},
  volume={abs/2111.10430}
}
  • Xiantao Li
  • Published 19 November 2021
  • Computer Science
  • ArXiv
This paper is concerned with the phase estimation algorithm in quantum computing, 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 [6]. 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. 

References

SHOWING 1-10 OF 39 REFERENCES
A Precise Error Bound for Quantum Phase Estimation
TLDR
It is found that this formula is useful in validating computer simulations of the phase estimation procedure and in avoiding the overestimation of the number of qubits required in order to achieve a given reliability, which brings improved precision in the design of quantum computers.
Effects of Cosine Tapering Window on Quantum Phase Estimation
TLDR
An upper bound in the cost that implies a cubic improvement with respect to the algorithm’s error rate is obtained and an iterative projective measurement method for ground state preparation that gives an exponential improvement over previous bounds using QPEA is detailed.
A Partially Random Trotter Algorithm for Quantum Hamiltonian Simulations
TLDR
A hybrid approach is presented, where Hamiltonians with large amplitude are evaluated at each time step, while the remaining terms are evaluation at random, and the bound for the mean square error is obtained, together with a concentration bound.
Quantum Phase Estimation Algorithm for Finding Polynomial Roots
TLDR
A quantum circuit is constructed representing the companion matrix and eigenvalue estimation technique is used to find roots of polynomial in a quantum algorithm for finding the roots of nth degree polynomials.
Quantum algorithms revisited
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantum
Quantum computation and quantum information
  • T. Paul
  • Physics
    Mathematical Structures in Computer Science
  • 2007
This special issue of Mathematical Structures in Computer Science contains several contributions related to the modern field of Quantum Information and Quantum Computing. The first two papers deal
Quantum computing methods for electronic states of the water molecule
TLDR
The second-order direct method provides the most efficient circuit implementations in terms of the gate complexity and the analytical analyses of the error and the gate-complexity for each method are presented.
T-Fermion: A non-Clifford gate cost assessment library of quantum phase estimation algorithms for quantum chemistry
TLDR
T-Fermion is introduced, a library designed to estimate the T-gate cost of quantum Phase Estimation algorithms, for an arbitrary molecule, and it is found that näıve Taylorization techniques can be surprisingly efficient when used in plane waves and combined with QROM techniques.
On the Chemical Basis of Trotter-Suzuki Errors in Quantum Chemistry Simulation
TLDR
It is argued that chemical properties, such as the maximum nuclear charge in a molecule and the filling fraction of orbitals, can be decisive for determining the cost of a quantum simulation.
...
1
2
3
4
...