Tapered Quantum Phase Estimation

ORAL

Abstract

The quantum phase estimation (QPE) algorithm has been used in algorithmic settings to determine the phase of an input state, solve systems of linear equations, estimate quantum amplitudes, and for quantum principal component analysis. In standard QPE, ancilla qubits are prepared in an equal superposition state. In tapered quantum phase estimation (tQPE) we allow for an arbitrary initial ancilla state and optimize this state using modern signal analysis methods. In particular, given a number of ancilla qubits, we minimize the probability of outputting an estimate that deviates from the true phase by a certain amount in the worst-case and average error settings. Using frequency- (equivalently, phase-) concentrated tapered estimates, we show that the number of extra qubits in tQPE required to guarantee that the output of the algorithm is $delta$-close to the true phase with probability at least $1 - epsilon$ can be reduced asymptotically to $m =O(loglog(1/epsilon))$, which is optimal. We then show that the worst-case success probability for QPE (with no extra qubits, $m = 0$) can be improved by approximately $20\%$ using an optimal taper. Finally, we demonstrate that the mean success probability can be improved, relative to standard QPE, in all cases.

* ATS acknowledges initial support from the LANL ASC Beyond Moore's Law project and subsequent support from the Laboratory Directed Research and Development program of Los Alamos National Laboratory (LANL) under project number 20230049DR. YS acknowledges support from the Quantum Science Center (QSC), a National Quantum Information Science Research Center of the U.S. Department of Energy (DOE). This work was partially supported by the U.S. DOE through a quantum computing program sponsored by the Los Alamos National Laboratory (LANL) Information Science & Technology Institute. SJST and DP acknowledge support from the U.S. DOE, Office of Science, Office of Advanced Scientific Computing Research, under the Accelerated Research in Quantum Computing (ARQC) program.

Presenters

  • Andrew T Sornborger

    Los Alamos National Laboratory (LANL)

Authors

  • Andrew T Sornborger

    Los Alamos National Laboratory (LANL)

  • Dhrumil Patel

    Cornell University

  • Shi Jie Samuel Tan

    University of Maryland

  • Yigit Subasi

    Los Alamos National Laboratory