Practical sampling schemes for quantum phase estimation
arXiv:1902.11168 · doi:10.1109/QCE49297.2020.00011
Abstract
In this work we consider practical implementations of Kitaev's algorithm for quantum phase estimation. We analyze the use of phase shifts that simplify the estimation of successive bits in the estimation of unknown phase . By using increasingly accurate shifts we reduce the number of measurements to the point where only a single measurements in needed for each additional bit. This results in an algorithm that can estimate to an accuracy of with probability at least using measurements, where is a constant that depends only on and the particular sampling algorithm. We present different sampling algorithms and study the exact number of measurements needed through careful numerical evaluation, and provide theoretical bounds and numerical values for .
References in corpus (12)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Simulated Quantum Computation of Molecular Energies
- Quantum Algorithms Revisited
- Scalable Quantum Simulation of Molecular Energies
- Simulation of Electronic Structure Hamiltonians Using Quantum Computers
- Quantum measurements and the Abelian Stabilizer Problem
- Quantum Metropolis Sampling
- Arbitrary accuracy iterative phase estimation algorithm as a two qubit benchmark
- Optimal Quantum Measurements of Expectation Values of Observables
- Quantum information and precision measurement
- Robust Calibration of a Universal Single-Qubit Gate-Set via Robust Phase Estimation
- Floating Point Representations in Quantum Circuit Synthesis