QI 2011: Quantum Interaction pp 172-181 | Cite as
A Hierarchical Sorting Oracle
Conference paper
Abstract
Classical tree search algorithms mimic the problem solving capabilities traditionally performed by humans. In this work we propose a unitary operator, based on the principles of reversible computation, focusing on hierarchical tree search concepts for sorting purposes. These concepts are then extended in order to build a quantum oracle which, combined with Grover’s quantum algorithm, can be employed as a quantum hierarchical search mechanism whilst taking advantage of a quadratic speedup. Finally, we show how the developed model can be extended in order to perform a N-level depth-limited search.
Keywords
quantum search tree search artificial intelligencePreview
Unable to display preview. Download preview PDF.
References
- 1.Grover, L.K.: A fast quantum mechanical algorithm for database search. In: STOC 1996: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 212–219. ACM, New York (1996)CrossRefGoogle Scholar
- 2.Deutsch, D.: Quantum computational networks. Proceedings of the Royal Society of London A 425, 73–90 (1989)Google Scholar
- 3.Hirvensalo, M.: Quantum Computing. Springer, Heidelberg (2004)CrossRefMATHGoogle Scholar
- 4.Kaye, P.R., Laflamme, R., Mosca, M.: An Introduction to Quantum Computing. Oxford University Press, USA (2007)MATHGoogle Scholar
- 5.Tarrataca, L., Wichert, A.: Tree search and quantum computation. Quantum Information Processing, 1–26 (2010), doi:10.1007/s11128-010-0212-zGoogle Scholar
- 6.Hughes, B.D.: Random Walks and Random Environments. Random Walks, vol. 1. Oxford University Press, USA (1995)MATHGoogle Scholar
- 7.Aharonov, Y., Davidovich, L., Zagury, N.: Quantum random walks. Phys. Rev. A 48(2), 1687–1690 (1993)CrossRefGoogle Scholar
- 8.Meyer, D.: From quantum cellular automata to quantum lattice gases. Journal of Statistical Physics 85(5), 551–574 (1996)MathSciNetCrossRefMATHGoogle Scholar
- 9.Nayak, A., Vishwanath, A.: Quantum walk on the line. Technical report, DIMACS Technical Report (2000)Google Scholar
- 10.Farhi, E., Gutmann, S.: Quantum computation and decision trees. Phys. Rev. A 58(2), 915–928 (1998)MathSciNetCrossRefGoogle Scholar
- 11.Hogg, T.: A framework for structured quantum search. Physica D 120, 102 (1998)CrossRefMATHGoogle Scholar
- 12.Aharonov, D., Ambainis, A., Kempe, J., Vazirani, U.: Quantum walks on graphs. In: Proceedings of ACM Symposium on Theory of Computation (STOC 2001), pp. 50–59 (July 2001)Google Scholar
- 13.Childs, A.M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., Spielman, D.: Exponential algoritmic speedup by quantum walk. In: Proceedings of the 35th ACM Symposium on Theory of Computing (STOC 2003), pp. 59–68 (September 2003)Google Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2011