{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,28]],"date-time":"2024-04-28T20:40:02Z","timestamp":1714336802505},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,8,31]],"date-time":"2012-08-31T00:00:00Z","timestamp":1346371200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2013,2]]},"DOI":"10.1007\/s11128-012-0475-7","type":"journal-article","created":{"date-parts":[[2012,8,30]],"date-time":"2012-08-30T13:28:25Z","timestamp":1346333305000},"page":"1365-1378","source":"Crossref","is-referenced-by-count":5,"title":["Intricacies of quantum computational paths"],"prefix":"10.1007","volume":"12","author":[{"given":"Lu\u00eds","family":"Tarrataca","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Wichert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,8,31]]},"reference":[{"key":"475_CR1","unstructured":"Aharonov, D., Ambainis, A., Kempe, J., Vazirani, U.: Quantum walks on graphs. In: Proceedings of ACM Symposium on Theory of Computation (STOC\u201901), pp. 50\u201359 (2001). http:\/\/www.citebase.org\/abstract?id=oai:arXiv.org:quant-ph\/0012090"},{"issue":"2","key":"475_CR2","doi-asserted-by":"crossref","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 48(2), 1687\u20131690 (1993) doi: 10.1103\/PhysRevA.48.1687","journal-title":"Phys. Rev. A"},{"key":"475_CR3","doi-asserted-by":"crossref","unstructured":"Ambainis, A.: Quantum lower bounds by quantum arguments. eprint arXiv:quant-ph\/0002066 (2000)","DOI":"10.1145\/335305.335394"},{"key":"475_CR4","unstructured":"Ambainis, A.: A nearly optimal discrete query quantum algorithm for evaluating NAND formulas. ArXiv e-prints (2007)"},{"key":"475_CR5","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Childs, A., Reichardt, B.: Any and-or formula of size n can be evaluated in time $${n^{\\frac{1}{2} + o(1)}}$$ on a quantum computer. In: Foundations of Computer Science, 2007. FOCS \u201907. IEEE Symposium on 48th Annual, pp. 363\u2013372 (2007). doi: 10.1109\/FOCS.2007.57","DOI":"10.1109\/FOCS.2007.57"},{"key":"475_CR6","doi-asserted-by":"crossref","first-page":"778","DOI":"10.1145\/502090.502097","volume":"48","author":"R. Beals","year":"2001","unstructured":"Beals R., Buhrman H., Cleve R., Mosca M., de Wolf R.: Quantum lower bounds by polynomials. J. ACM 48, 778\u2013797 (2001) doi: 10.1145\/502090.502097","journal-title":"J. ACM"},{"key":"475_CR7","unstructured":"Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computing (1997). http:\/\/www.citebase.org\/abstract?id=oai:arXiv.org:quant-ph\/9701001"},{"key":"475_CR8","unstructured":"Boyer, M., Brassard, G., Hoeyer, P., Tapp, A.: Tight bounds on quantum searching. Fortschritte der Physik 46, 493 (1998). http:\/\/www.citebase.org\/abstract?id=oai:arXiv.org:quant-ph\/9605034"},{"key":"475_CR9","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Cleve, R., Wigderson, A.: Quantum vs. classical communication and computation. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, STOC \u201998, pp. 63\u201368. ACM, New York (1998). doi: 10.1145\/276698.276713","DOI":"10.1145\/276698.276713"},{"key":"475_CR10","unstructured":"Childs, A.M.: Lecture 14: Discrete-time quantum walk. University of Waterloo (2011). http:\/\/www.math.uwaterloo.ca\/~amchilds\/teaching\/w11\/l14.pdf"},{"key":"475_CR11","doi-asserted-by":"crossref","unstructured":"Childs, A.M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., Spielman, D.: Exponential algorithmic speedup by quantum walk. In: Proceedings of the 35th ACM Symposium on Theory of Computing (STOC 2003), pp. 59\u201368 (2003)","DOI":"10.1145\/780551.780552"},{"key":"475_CR12","doi-asserted-by":"crossref","unstructured":"Childs, A.M., Cleve, R., Jordan, S.P., Yonge-Mallo, D.: Discrete-query quantum algorithm for nand trees. Theory Comput. 5(1), 119\u2013123 (2009). doi: 10.4086\/toc.2009.v005a005 . http:\/\/www.theoryofcomputing.org\/articles\/v005a005","DOI":"10.4086\/toc.2009.v005a005"},{"key":"475_CR13","unstructured":"Childs, A.M., Reichardt, B.W., Spalek, R., Zhang, S.: Every NAND formula of size N can be evaluated in time $${N^{\\frac{1}{2}+o(1)}}$$ on a quantum computer. eprint arXiv:quant-ph\/0703015 (2007)"},{"key":"475_CR14","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/978-3-540-89304-2_2","volume-title":"Proceedings of Theory of Quantum Computation, Communication, and Cryptography (TQC 2008)","author":"R. Cleve","year":"2008","unstructured":"Cleve R., Gavinsky D., Yonge-Mallo D.: Quantum algorithms for evaluating min-max trees. In: Kawano, Y., Mosca, M. (eds) Proceedings of Theory of Quantum Computation, Communication, and Cryptography (TQC 2008), pp. 11\u201315. Springer, Berlin (2008)"},{"key":"475_CR15","volume-title":"Introduction to Algorithms, 2\/e","author":"T.H. Cormen","year":"2001","unstructured":"Cormen T.H., Leiserson C.E., Rivest R.L., Stein C.: Introduction to Algorithms, 2\/e. MIT Press, Cambridge (2001)"},{"key":"475_CR16","doi-asserted-by":"crossref","unstructured":"Farhi, E., Goldstone, J., Gutmann, S.: A quantum algorithm for the hamiltonian nand tree. Theory Comput. 4(1), 169\u2013190 (2008). doi: 10.4086\/toc.2008.v004a008 . http:\/\/www.theoryofcomputing.org\/articles\/v004a008","DOI":"10.4086\/toc.2008.v004a008"},{"key":"475_CR17","doi-asserted-by":"crossref","unstructured":"Farhi, E., Gutmann, S.: Quantumcomputation and decision trees. Phys. Rev. A 58(2), 915\u2013928 (1998). doi: 10.1103\/PhysRevA.58.915","DOI":"10.1103\/PhysRevA.58.915"},{"key":"475_CR18","unstructured":"Grover, L., Rudolph, T.: How significant are the known collision and element distinctness quantum algorithms? Quantum Inf. Comput. 4, 201 (2004). http:\/\/www.citebase.org\/abstract?id=oai:arXiv.org:quant-ph\/0309123"},{"key":"475_CR19","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: STOC \u201996: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 212\u2013219. ACM, New York (1996). doi: 10.1145\/237814.237866","DOI":"10.1145\/237814.237866"},{"key":"475_CR20","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79, 325 (1997). doi: 10.1103\/PhysRevLett.79.325","DOI":"10.1103\/PhysRevLett.79.325"},{"key":"475_CR21","unstructured":"Hogg, T.: A framework for structured quantum search. Phys. D 120, 102 (1998). URL http:\/\/www.citebase.org\/abstract?id=oai:arXiv.org:quant-ph\/9701013"},{"key":"475_CR22","volume-title":"Behind Deep Blue: Building the Computer That Defeated the World Chess Champion","author":"F.H. Hsu","year":"2002","unstructured":"Hsu F.H.: Behind Deep Blue: Building the Computer That Defeated the World Chess Champion. Princeton University Press, Princeton (2002)"},{"key":"475_CR23","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198537885.001.0001","volume-title":"Random Walks and Random Environments, Volume 1: Random Walks","author":"B.D. Hughes","year":"1995","unstructured":"Hughes B.D.: Random Walks and Random Environments, Volume 1: Random Walks. Oxford University Press, USA (1995)"},{"key":"475_CR24","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":"475_CR25","unstructured":"Kempe, J.: Quantum random walks\u2014an introductory overview. Contemp. Phys. 44, 307 (2003). http:\/\/www.citebase.org\/abstract?id=oai:arXiv.org:quant-ph\/0303081"},{"issue":"1","key":"475_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(87)90050-6","volume":"33","author":"J.E. Laird","year":"1987","unstructured":"Laird J.E., Newell A., Rosenbloom P.S.: Soar: An architecture for general intelligence. Artif. Intell. 33(1), 1\u201364 (1987)","journal-title":"Artif. Intell."},{"key":"475_CR27","unstructured":"Moore, C., Russell, A.: Quantum Walks on the Hypercube. eprint arXiv:quant-ph\/0104137 (2001)"},{"key":"475_CR28","unstructured":"Nayak, A., Vishwanath, A.: Quantum Walk on the Line. Technical report. DIMACS Technical Report (2000). http:\/\/www.citebase.org\/abstract?id=oai:arXiv.org:quant-ph\/0010117"},{"key":"475_CR29","doi-asserted-by":"crossref","unstructured":"Shenvi, N., Kempe, J., Whaley, K.B.: Quantum random-walk search algorithm. Phys. Rev. A 67(5), 052,307 (2003). doi: 10.1103\/PhysRevA.67.052307","DOI":"10.1103\/PhysRevA.67.052307"},{"key":"475_CR30","unstructured":"Sipser, M.: Introduction to the Theory of Computation. Computer Science Series. Thomson Course Technology (2006). http:\/\/books.google.pt\/books?id=SV2DQgAACAAJ"},{"key":"475_CR31","doi-asserted-by":"crossref","unstructured":"Tarrataca, L., Wichert, A.: Tree search and quantum computation. Quantum Inf. Process. 10(4), 475\u2013500 (2011). doi: 10.1007\/s11128-010-0212-z","DOI":"10.1007\/s11128-010-0212-z"},{"key":"475_CR32","unstructured":"Watrous, J.: Quantum simulations of classical random walks and undirected graph connectivity. CoRR cs.CC\/9812012 (1998)"},{"key":"475_CR33","unstructured":"Zalka, C.: Grover\u2019s quantum searching algorithm is optimal. Phys. Rev. A 60, 2746 (1999). http:\/\/www.citebase.org\/abstract?id=oai:arXiv.org:quant-ph\/9711070"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-012-0475-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11128-012-0475-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-012-0475-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,28]],"date-time":"2024-04-28T20:23:55Z","timestamp":1714335835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11128-012-0475-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,31]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,2]]}},"alternative-id":["475"],"URL":"https:\/\/doi.org\/10.1007\/s11128-012-0475-7","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"value":"1570-0755","type":"print"},{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,31]]}}}