Abstract
Let us consider a children’s game called hiding the key: one player hides the key in the house, and the others try to find it. The one who has hidden the key is permanently advising the others by using phrases like “freezing”, “cold”, “warm”, and “hot”, depending on how close the seekers are to the hiding place. Without this advice, the game would obviously last much longer. Or, can you develop a strategy for finding the key without searching through the entire house?
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hirvensalo, M. (2004). Grover’s Search Algorithm. In: Quantum Computing. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-09636-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-662-09636-9_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07383-0
Online ISBN: 978-3-662-09636-9
eBook Packages: Springer Book Archive