Abstract
Let a classical algorithm be determined by sequential applications of a black box performing one step of this algorithm. If we consider this black box as an oracle which gives a value f(a) for a query a, we can compute T sequential applications of f on a classical computer relative to this oracle in time T.
It is proved that if T = O(2n/7), where n is the length of input, then the result of T sequential applications of f can not be computed on quantum computer with oracle for f for all possible f faster than in time Ώ(T). This means that there is no general method of quantum speeding up of classical algorithms provided in such a general method a classical algorithm is regarded as iterated applications of a given black box.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
C.H. Bennett, E. Bernstein, G. Brassard, U. Vazirani, Strenths and Weaknesses of Quantum Computing, To appear in SIAM Journal on Computing (lanl e-print quant-ph/9701001)
A. Berthiaume, G. Brassard, Oracle quantum computing, Journal of modern optics, 41(12):2521–2535, 1994
C.H. Bennett, Logical reversibility of computation, IBM J. Res.Develop. 17, 525–532
D. Deutsch, R. Jozsa, Rapid solution of problems by quantum computation, Proc. Roy. Soc. Lond. A 439 553–558
E. Farhi, S. Gutmann, Quantum Mechanical Square Root Speedup in a Structured Search Problem, lanl e-print, quant-ph/9711035
L.K. Grover, A fast quantum mechanical algorithm for database search, Proceedings, STOC 1996, Philadelphia PA USA, pp 212–219
P.W. Shor, Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on Quantum Computer, lanl e-print, quant-ph/9508027 v2 (A preliminary version in Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, Nov. 20–22, 1994, IEEE Computer Society Press, pp 124–234)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ozhigov, Y. (1999). Quantum Computer Can Not Speed Up Iterated Applications of a Black Box. In: Williams, C.P. (eds) Quantum Computing and Quantum Communications. QCQC 1998. Lecture Notes in Computer Science, vol 1509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49208-9_12
Download citation
DOI: https://doi.org/10.1007/3-540-49208-9_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65514-5
Online ISBN: 978-3-540-49208-5
eBook Packages: Springer Book Archive