Abstract
This paper shows how a basic property of unitary transformations can be used for meaningful computations. This approach immediately leads to search-type applications, where it improves the number of steps by a squareroot - a simple minded search that takes N steps, can be improved to approximately √N steps. The quantum search algorithm is one of several immediate consequences of this framework. Several novel search-related applications are presented.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Boyer, G. Brassard, P. Hoyer & A. Tapp, Tight bounds on quantum searching, Proc., PhysComp 1996 (lanl e-print quant-ph/ 9605034).
E. Bernstein and U. Vazirani, Quantum complexity theory, Proc. 25th ACM Symposium on Theory of Computing, 1993; for full paper see-SIAM Journal on Computing, vol. 26, no. 5, Oct 1997.
C. H. Bennett, E. Bernstein, G. Brassard & U. Vazirani, Strengths and weaknesses of quantum computing, SIAM Journal on Computing, pp. 1510–1524, vol. 26, no. 5, October 1997.
D. Deutsch & R. Josza, Rapid solution of problems by quantum computation, Proc. Royal Society of London, A400, 1992, pp. 73–90.
P. Shor, Algorithms for quantum computation: discrete logarithms and factoring, Proceedings, 35th Annual Symposium on Fundamentals of Computer Science (FOCS), 1994, pp. 124–134.
L. Grover, A framework for fast quantum mechanical algorithms, lanl e-print quant-ph/9711043, to be presented in ACM Symposium on Theory of Computation, May 1998 (STOC’ 98).
L. Grover, Quantum computers can search rapidly by using almost any transformation, lanl e-print quant-ph/9712011.
T. Hogg, A framework for structured quantum search, lanl e-print quant-ph/9701013.
G. Brassard, Searching a quantum phone book, Science, Jan. 31, 1997, 627–628.
C. H. Bennett, Space-Time trade-offs in reversible computing, SIAM Journal of Computing, vol. 18, pages 766–776, 1989.
L. K. Grover, Quantum Mechanics helps in searching for a needle in a haystack, Phys. Rev. Letters, vol. 78(2), 1997, pages 325–328 (lanl e-print quant-ph/9605043).
L. K. Grover, A fast quantum mechanical algorithm for database search, Proceedings 28th Annual Symposium on the Theory of Computing (STOC) 1996, pp. 212–219.
E. Farhi & S. Gutmann, Quantum mechanical square root speedup in a structured search problem, lanl e-print quant-ph/9711035.
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
Grover, L.K. (1999). Quantum Search on Structured Problems. 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_9
Download citation
DOI: https://doi.org/10.1007/3-540-49208-9_9
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