Iterative quantum phase estimation with optimized sample complexity Article Swipe
YOU?
·
· 2020
· Open Access
·
· DOI: https://doi.org/10.1109/qce49297.2020.00011
· OA: W3110491466
In this work we consider practical implementations of Kitaev's algorithm for\nquantum phase estimation. We analyze the use of phase shifts that simplify the\nestimation of successive bits in the estimation of unknown phase $\\varphi$. By\nusing increasingly accurate shifts we reduce the number of measurements to the\npoint where only a single measurements in needed for each additional bit. This\nresults in an algorithm that can estimate $\\varphi$ to an accuracy of\n$2^{-(m+2)}$ with probability at least $1-\\epsilon$ using $N_{\\epsilon} + m$\nmeasurements, where $N_{\\epsilon}$ is a constant that depends only on\n$\\epsilon$ and the particular sampling algorithm. We present different sampling\nalgorithms and study the exact number of measurements needed through careful\nnumerical evaluation, and provide theoretical bounds and numerical values for\n$N_{\\epsilon}$.\n
