Lower bound for quantum phase estimation

  title={Lower bound for quantum phase estimation},
  author={Arvid J. Bessen},
  journal={Physical Review A},
  • A. J. Bessen
  • Published 1 December 2004
  • Computer Science
  • Physical Review A
We obtain a query lower bound for quantum algorithms solving the phase estimation problem. Our analysis generalizes existing lower-bound approaches to the case where the oracle $Q$ is given by controlled powers ${Q}^{p}$ of $Q$, as it is, for example, in Shor's order-finding algorithm. In this setting we will prove a $\ensuremath{\Omega}(\mathrm{log}\phantom{\rule{0.2em}{0ex}}1∕ϵ)$ lower bound for the number of applications of ${Q}^{{p}_{1}}$, ${Q}^{{p}_{2}},\dots{}$. This bound is tight due to… 

Figures from this paper

Optimizing quantum optimization algorithms via faster quantum gradient computation

A quantum algorithm that computes the gradient of a multi-variate real-valued function by evaluating it at only a logarithmic number of points in superposition is developed, and it is shown that for low-degree multivariate polynomials the algorithm can provide exponential speedups compared to Jordan's algorithm in terms of the dimension $d.

Improvements in Quantum SDP-Solving with Applications

This paper improves on all previous quantum SDP-solvers and applies their results to the problem of shadow tomography to simultaneously improve the best known upper bounds on sample complexity due to Aaronson and complexity due Brandao et al.

The Quantum Setting with Randomized Queries for Continuous Problems

It is proved that for path integration the authors have an exponential improvement for the qubit complexity over the quantum setting with deterministic queries, which limits the power of quantum computation for continuous problems.

Near-optimal ground state preparation

A hybrid quantum-classical algorithm to estimate the ground energy, where the dependence of the number of queries to the initial state on the desired precision is exponentially improved compared to the current state-of-the-art algorithm proposed in [Ge et al. 2019].

Classical and Quantum Complexity of the Sturm–Liouville Eigenvalue Problem

A formula is derived that relates the Sturm–Liouville eigenvalue problem to a weighted integration problem, which allows us to solve them with a polylog number of power queries and the lower bound on the number of quantum queries is proven.

Optimal phase estimation in quantum networks

We address the problem of estimating the phase ϕ given N copies of the phase rotation uϕ within an array of quantum operations in finite dimensions. We first consider the special case where the array

Quantum lower bounds by entropy numbers

  • S. Heinrich
  • Mathematics, Computer Science
    J. Complex.
  • 2007

Continuous Quantum Computation

New algorithms and quantum speedups were obtained for a number of important problems such as path integration, eigenvalues of Hermitian operators, Feynman-Kac path Integration, high-dimensional approximation, and the Sturm-Liouville eigenvalue problem.

General quantum phase estimation and calibration of a timepiece in a quantum dot system

We present a physical scheme for implementing quantum phase estimation via weakly coupled double-quantum-dot molecules embedded in a microcavity. During the same process of implementation, we can



Quantum computation and quantum information

This chapter discusses quantum information theory, public-key cryptography and the RSA cryptosystem, and the proof of Lieb's theorem.

Monte Carlo and quasi-Monte Carlo methods

Monte Carlo is one of the most versatile and widely used numerical methods. Its convergence rate, O(N−1/2), is independent of dimension, which shows Monte Carlo to be very robust but also slow. This


  • C. Ross
  • Medicine
    The Dental register
  • 1869


  • Rev. Lett. 83, 5162
  • 1999

in Proc

  • of the 18th IEEE Conference on Computational Complexity
  • 2003

Quantum Information Processing 1

  • 365
  • 2002

in Proc

  • of the 32nd annual ACM symposium on Theory of computing
  • 2000

Journal of Complexity 19

  • 19
  • 2003

Journal of Complexity 20

  • 699
  • 2004