A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
The quantum query complexity of approximating the median and related statistics
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Quantum complexity of integration
Journal of Complexity
Quantum computation and quantum information
Quantum computation and quantum information
Quantum summation with an application to integration
Journal of Complexity
Path Integration on a Quantum Computer
Quantum Information Processing
Quantum Lower Bounds by Polynomials
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Quantum approximation I. Embeddings of finite-dimensional Lp spaces
Journal of Complexity
Quantum approximation II. Sobolev embeddings
Journal of Complexity
The power of various real-valued quantum queries
Journal of Complexity
Classical and Quantum Complexity of the Sturm--Liouville Eigenvalue Problem
Quantum Information Processing
Quantum lower bounds by entropy numbers
Journal of Complexity
On the complexity of the multivariate Sturm--Liouville eigenvalue problem
Journal of Complexity
Hi-index | 0.00 |
We study the complexity of approximating the smallest eigenvalue of a univariate Sturm-Liouville problem on a quantum computer. This general problem includes the special case of solving a one-dimensional Schrödinger equation with a given potential for the ground state energy.The Sturm-Liouville problem depends on a function q, which, in the case of the Schrödinger equation, can be identified with the potential function V. Recently Papageorgiou and Wozniakowski proved that quantum computers achieve an exponential reduction in the number of queries over the number needed in the classical worst-case and randomized settings for smooth functions q. Their method uses the (discretized) unitary propagator and arbitrary powers of it as a query ("power queries"). They showed that the Sturm-Liouville equation can be solved with O(log(1/ε)) power queries, while the number of queries in the worst-case and randomized settings on a classical computer is polynomial in 1/ε. This proves that a quantum computer with power queries achieves an exponential reduction in the number of queries compared to a classical computer.In this paper we show that the number of queries in Papageorgiou's and Wozniakowski's algorithm is asymptotically optimal. In particular we prove a matching lower bound of Ω(log(1/ε)) power queries, therefore showing that Θ(log(1/ε)) power queries are sufficient and necessary. Our proof is based on a frequency analysis technique, which examines the probability distribution of the final state of a quantum algorithm and the dependence of its Fourier transform on the input.