Abstract
This paper is mainly about methodology in designing quantum algorithm. Based on study of Grover’s algorithm, we argue that it is a short cut to design and interpret quantum algorithms from the viewpoint of Householder transformation directly. We give an example for this claim, which extends Grover’s quantum search algorithm to some structured database. In this example, we show how to exploit some special structure information of problem, which restricts the search in some subspace. Based on an instantiation of this framework, we show that it does can utilize the information to the full extent. This paper gives the details that produce the algorithm framework. The idea, which is simple and intelligible, is universal to some extent, and therefore can be applied to other similar situations.
Supported by the National Natural Science Foundation of China under Grant No. 60273080, 60473003, and Natural Science foundation of Jilin Province grant number 20030107.
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
Boyer, M., Brassard, G., Hoyer, P., Tapp, A.: Tight Bounds on Quantum Searching. In: Proceedings of the Workshop on Physics of Computation: PhysComp 1996. IEEE Computer Society Press, Los Alamitos (1996)
Ekert, A., Hayden, P., Inamori, H.: Basic Concepts in Quantum Computation, quant-ph/0010077
Grover, L.: A Fast Quantum Mechanical Algorithm for Database Search. In: Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, Philadelphia, pp. 212–219 (1996)
Grover, L.: Quantum search on structured problems. In: The Proceedings of the 1st NASA International Conference on Quantum Computation and Quantum Communications, Berlin (1998)
Grover, L.: Tradeoffs in the Quantum Search Algorithm. Manuscript, quant-ph/0201152 (2002)
Grover, L.: From SchrÖdinger’s Equation to the Quantum Search Algorithm. American Journal of Physics 7, 769–777 (2001)
Hogg, T.: Quantum Computing and Phase Transitions in Combinatorial Search. Journal of Artificial Intelligence Research 4, 91–128 (1996)
Hogg, T.: Highly Structured Searches with Quantum Computers. Physical Review Letters, 2473–2476 (1998)
Lloyd, S.: Computational capacity of the Universe. Physical Review Letters 88, 237901 (2002)
Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Originally published by Cambridge University Press in 2000. Reprinted by Higher Education Press (2003)
Viamontes, G., Markov, I., Hayes, J.: Is Quantum Search Practical? quant-ph/0405001
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
He, Y., Sun, J. (2005). Quantum Search in Structured Database. In: Wang, L., Chen, K., Ong, Y.S. (eds) Advances in Natural Computation. ICNC 2005. Lecture Notes in Computer Science, vol 3612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539902_52
Download citation
DOI: https://doi.org/10.1007/11539902_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28320-1
Online ISBN: 978-3-540-31863-7
eBook Packages: Computer ScienceComputer Science (R0)