{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T11:46:56Z","timestamp":1725623216074},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642249709"},{"type":"electronic","value":"9783642249716"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24971-6_17","type":"book-chapter","created":{"date-parts":[[2011,10,19]],"date-time":"2011-10-19T09:36:46Z","timestamp":1319017006000},"page":"172-181","source":"Crossref","is-referenced-by-count":0,"title":["A Hierarchical Sorting Oracle"],"prefix":"10.1007","author":[{"given":"Lu\u00eds","family":"Tarrataca","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Wichert","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1145\/237814.237866","volume-title":"STOC 1996: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing","author":"L.K. Grover","year":"1996","unstructured":"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\u2013219. ACM, New York (1996)"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Deutsch, D.: Quantum computational networks. Proceedings of the Royal Society of London A\u00a0425, 73\u201390 (1989)","DOI":"10.1098\/rspa.1989.0099"},{"key":"17_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-09636-9","volume-title":"Quantum Computing","author":"M. Hirvensalo","year":"2004","unstructured":"Hirvensalo, M.: Quantum Computing. Springer, Heidelberg (2004)"},{"key":"17_CR4","volume-title":"An Introduction to Quantum Computing","author":"P.R. Kaye","year":"2007","unstructured":"Kaye, P.R., Laflamme, R., Mosca, M.: An Introduction to Quantum Computing. Oxford University Press, USA (2007)"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Tarrataca, L., Wichert, A.: Tree search and quantum computation. Quantum Information Processing, 1\u201326 (2010), doi:10.1007\/s11128-010-0212-z","DOI":"10.1007\/s11128-010-0212-z"},{"key":"17_CR6","series-title":"Random Walks","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198537885.001.0001","volume-title":"Random Walks and Random Environments","author":"B.D. Hughes","year":"1995","unstructured":"Hughes, B.D.: Random Walks and Random Environments. Random Walks, vol.\u00a01. Oxford University Press, USA (1995)"},{"issue":"2","key":"17_CR7","doi-asserted-by":"publisher","first-page":"1687","DOI":"10.1103\/PhysRevA.48.1687","volume":"48","author":"Y. Aharonov","year":"1993","unstructured":"Aharonov, Y., Davidovich, L., Zagury, N.: Quantum random walks. Phys. Rev. A\u00a048(2), 1687\u20131690 (1993)","journal-title":"Phys. Rev. A"},{"issue":"5","key":"17_CR8","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/BF02199356","volume":"85","author":"D. Meyer","year":"1996","unstructured":"Meyer, D.: From quantum cellular automata to quantum lattice gases. Journal of Statistical Physics\u00a085(5), 551\u2013574 (1996)","journal-title":"Journal of Statistical Physics"},{"key":"17_CR9","unstructured":"Nayak, A., Vishwanath, A.: Quantum walk on the line. Technical report, DIMACS Technical Report (2000)"},{"issue":"2","key":"17_CR10","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1103\/PhysRevA.58.915","volume":"58","author":"E. Farhi","year":"1998","unstructured":"Farhi, E., Gutmann, S.: Quantum computation and decision trees. Phys. Rev. A\u00a058(2), 915\u2013928 (1998)","journal-title":"Phys. Rev. A"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/S0167-2789(98)00047-5","volume":"120","author":"T. Hogg","year":"1998","unstructured":"Hogg, T.: A framework for structured quantum search. Physica D\u00a0120, 102 (1998)","journal-title":"Physica D"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"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\u201359 (July 2001)","DOI":"10.1145\/380752.380758"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"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\u201368 (September 2003)","DOI":"10.1145\/780542.780552"}],"container-title":["Lecture Notes in Computer Science","Quantum Interaction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24971-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,13]],"date-time":"2024-04-13T22:17:28Z","timestamp":1713046648000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24971-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642249709","9783642249716"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24971-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}