{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:16:31Z","timestamp":1753438591216},"reference-count":74,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,11,21]],"date-time":"2010-11-21T00:00:00Z","timestamp":1290297600000},"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":[[2011,8]]},"DOI":"10.1007\/s11128-010-0212-z","type":"journal-article","created":{"date-parts":[[2010,11,20]],"date-time":"2010-11-20T10:30:29Z","timestamp":1290249029000},"page":"475-500","source":"Crossref","is-referenced-by-count":10,"title":["Tree search and quantum computation"],"prefix":"10.1007","volume":"10","author":[{"given":"Lu\u00eds","family":"Tarrataca","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Wichert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,11,21]]},"reference":[{"key":"212_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":"212_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":"212_CR3","unstructured":"Ambainis, A.: Quantum walks and their algorithmic applications. Int. J. Quantum Inf. 1, 507 (2003). http:\/\/www.citebase.org\/abstract?id=oai:arXiv.org:quant-ph\/0403120"},{"issue":"2","key":"212_CR4","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/992287.992296","volume":"35","author":"A. Ambainis","year":"2004","unstructured":"Ambainis A.: Quantum search algorithms. SIGACT News 35(2), 22\u201335 (2004). doi: 10.1145\/992287.992296","journal-title":"SIGACT News"},{"key":"212_CR5","unstructured":"Ambainis, A.: Quantum walk algorithm for element distinctness. SIAM J. Comput. 37, 210 (2007). http:\/\/www.citebase.org\/abstract?id=oai:arXiv.org:quant-ph\/0311001"},{"key":"212_CR6","unstructured":"Ambainis, A., Bach, E., Nayak, A., Vishwanath, A., Watrous, J.: One-dimensional quantum walks. In: ACM Symposium on Theory of Computing, pp. 37\u201349 (2001). http:\/\/www.citeseer.ist.psu.edu\/514019.html"},{"key":"212_CR7","unstructured":"Ambainis, A., Kempe, J., Rivosh, A.: Coins make quantum walks faster (2005). http:\/\/www.citebase.org\/abstract?id=oai:arXiv.org:quant-ph\/0402107"},{"key":"212_CR8","volume-title":"The Architecture of Cognition","author":"J.R. Anderson","year":"1983","unstructured":"Anderson J.R.: The Architecture of Cognition. Harvard University Press, Cambridge (1983)"},{"key":"212_CR9","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":"212_CR10","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":"212_CR11","unstructured":"Brassard, G., Hoyer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation (2000). http:\/\/www.citebase.org\/abstract?id=oai:arXiv.org:quant-ph\/0005055"},{"key":"212_CR12","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0004-3702(01)00129-1","volume":"134","author":"M. Campbell","year":"2002","unstructured":"Campbell M., Hoane A.J. Jr., Hsu F.H.: Deep blue. Artif. Intell. 134, 57\u201383 (2002)","journal-title":"Artif. Intell."},{"key":"212_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 (2003)","DOI":"10.1145\/780542.780552"},{"issue":"1","key":"212_CR14","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1023\/A:1019609420309","volume":"1","author":"A.M. Childs","year":"2002","unstructured":"Childs A.M., Farhi E., Gutmann S.: An example of the difference between quantum and classical random walks. Quantum Inf. Process. 1(1), 35\u201343 (2002)","journal-title":"Quantum Inf. Process."},{"key":"212_CR15","doi-asserted-by":"crossref","unstructured":"Choi, B., Korepin, V.: Quantum Partial Search of a Database with Several Target Items. ArXiv Quantum Phys. e-prints (2006)","DOI":"10.1007\/s11128-007-0056-3"},{"issue":"15","key":"212_CR16","doi-asserted-by":"crossref","first-page":"3408","DOI":"10.1103\/PhysRevLett.80.3408","volume":"80","author":"I.L. Chuang","year":"1998","unstructured":"Chuang I.L., Gershenfeld N., Kubinec M.: Experimental implementation of fast quantum searching. Phys. Rev. Lett. 80(15), 3408\u20133411 (1998). doi: 10.1103\/PhysRevLett.80.3408","journal-title":"Phys. Rev. Lett."},{"key":"212_CR17","volume-title":"Probability and Statistics","author":"M.H. DeGroot","year":"2002","unstructured":"DeGroot M.H., Schervish M.J.: Probability and Statistics, 3rd edn. Addison-Wesley, London (2002)","edition":"3"},{"key":"212_CR18","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1017\/S0305004100021162","volume":"35","author":"P.A.M. Dirac","year":"1939","unstructured":"Dirac P.A.M.: A new notation for quantum mechanics. Proc. Cambridge Philos. Soc. 35, 416\u2013418 (1939)","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"212_CR19","volume-title":"The Principles of Quantum Mechanics, vol. 27 of International series of monographs on physics (Oxford, England), Oxford science publications","author":"P.A.M. Dirac","year":"1981","unstructured":"Dirac P.A.M.: The Principles of Quantum Mechanics, vol. 27 of International series of monographs on physics (Oxford, England), Oxford science publications. Oxford University Press, Oxford (1981)"},{"key":"212_CR20","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds J.: Paths, trees, and flowers. Can. J. Math. 17, 449\u2013467 (1965)","journal-title":"Can. J. Math."},{"key":"212_CR21","volume-title":"GPS: A Case Study in Generality and Problem Solving","author":"G. Ernst","year":"1969","unstructured":"Ernst G., Newell A., Ernst G.E.: GPS: A Case Study in Generality and Problem Solving. Academic Press, London (1969)"},{"issue":"2","key":"212_CR22","doi-asserted-by":"crossref","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 58(2), 915\u2013928 (1998). doi: 10.1103\/PhysRevA.58.915","journal-title":"Phys. Rev. A"},{"key":"212_CR23","doi-asserted-by":"crossref","unstructured":"Feldmann, R.: Game Tree Search on Massively Parallel Systems, Ph.D. thesis. University of Paderborn (1993)","DOI":"10.1007\/3-540-55488-2_32"},{"key":"212_CR24","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness. Series of Books in the Mathematical Sciences","author":"M. Garey","year":"1979","unstructured":"Garey M., Johnson D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Series of Books in the Mathematical Sciences. W.H. Freeman, San Francisco (1979)"},{"key":"212_CR25","doi-asserted-by":"crossref","DOI":"10.1201\/9781420035919","volume-title":"Statistical Modelling with Quantile Functions","author":"W. Gilchrist","year":"2000","unstructured":"Gilchrist W.: Statistical Modelling with Quantile Functions. Chapman and Hall\/CRC, London (2000)"},{"key":"212_CR26","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, NY, USA (1996). doi: 10.1145\/237814.237866","DOI":"10.1145\/237814.237866"},{"key":"212_CR27","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A framework for fast quantum mechanical algorithms. In: STOC \u201998: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pp. 53\u201362. ACM, New York, NY, USA (1998). doi: 10.1145\/276698.276712","DOI":"10.1145\/276698.276712"},{"issue":"19","key":"212_CR28","doi-asserted-by":"crossref","first-page":"4329","DOI":"10.1103\/PhysRevLett.80.4329","volume":"80","author":"L.K. Grover","year":"1998","unstructured":"Grover L.K.: Quantum computers can search rapidly by using almost any transformation. Phys. Rev. Lett. 80(19), 4329\u20134332 (1998). doi: 10.1103\/PhysRevLett.80.4329","journal-title":"Phys. Rev. Lett."},{"key":"212_CR29","unstructured":"Grover, L.K.: Quantum search on structured problems. Chaos, Solitons & Fractals 10(10), 1695\u20131705 (1999). doi: 10.1016\/S0960-0779(98)00217-3 . http:\/\/www.sciencedirect.com\/science\/article\/B6TJ4-4165DDW-9\/2\/3163b5ccd7a374c7053fb599a240cf08"},{"issue":"5","key":"212_CR30","doi-asserted-by":"crossref","first-page":"052,314","DOI":"10.1103\/PhysRevA.66.052314","volume":"66","author":"L.K. Grover","year":"2002","unstructured":"Grover L.K.: Trade-offs in the quantum search algorithm. Phys. Rev. A 66(5), 052,314 (2002). doi: 10.1103\/PhysRevA.66.052314","journal-title":"Phys. Rev. A"},{"issue":"15","key":"212_CR31","doi-asserted-by":"crossref","first-page":"150,501","DOI":"10.1103\/PhysRevLett.95.150501","volume":"95","author":"L.K. Grover","year":"2005","unstructured":"Grover L.K.: Fixed-point quantum search. Phys. Rev. Lett. 95(15), 150,501 (2005). doi: 10.1103\/PhysRevLett.95.150501","journal-title":"Phys. Rev. Lett."},{"key":"212_CR32","unstructured":"Grover, L.K., Radhakrishnan, J.: Is partial quantum search of a database any easier? (2004). http:\/\/www.citebase.org\/abstract?id=oai:arXiv.org:quant-ph\/0407122"},{"issue":"2","key":"212_CR33","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P. Hart","year":"1968","unstructured":"Hart P., Nilsson N., Raphael B.: A formal basis for the heuristic determination of minimum cost paths. Syst. Sci. Cybern. IEEE Trans. 4(2), 100\u2013107 (1968). doi: 10.1109\/TSSC.1968.300136","journal-title":"Syst. Sci. Cybern. IEEE Trans."},{"key":"212_CR34","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-09636-9","volume-title":"Quantum Computing","author":"M. Hirvensalo","year":"2004","unstructured":"Hirvensalo M.: Quantum Computing. Springer, Berlin (2004)"},{"key":"212_CR35","unstructured":"Hogg, T.: A framework for structured quantum search. Phys. D 120, 102 (1998). http:\/\/www.citebase.org\/abstract?id=oai:arXiv.org:quant-ph\/9701013"},{"issue":"6","key":"212_CR36","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1145\/362248.362272","volume":"16","author":"J. Hopcroft","year":"1973","unstructured":"Hopcroft J., Tarjan R.: Algorithm 447: efficient algorithms for graph manipulation. Commun. ACM 16(6), 372\u2013378 (1973). doi: 10.1145\/362248.362272","journal-title":"Commun. ACM"},{"key":"212_CR37","volume-title":"Sliding Piece Puzzles. Recreations in Mathematics, No 4","author":"E. Hordern","year":"1987","unstructured":"Hordern E.: Sliding Piece Puzzles. Recreations in Mathematics, No 4. Oxford University Press, USA (1987)"},{"issue":"2","key":"212_CR38","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1109\/40.755469","volume":"19","author":"F.H. Hsu","year":"1999","unstructured":"Hsu F.H.: Ibm\u2019s deep blue chess grandmaster chips. Micro. IEEE 19(2), 70\u201382 (1999)","journal-title":"Micro. IEEE"},{"key":"212_CR39","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":"212_CR40","doi-asserted-by":"crossref","unstructured":"Hu, C.R.: A family of sure-success quantum algorithms for solving a generalized grover search problem (2002). doi: 10.1103\/PhysRevA.66.042301","DOI":"10.1103\/PhysRevA.66.042301"},{"key":"212_CR41","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198537885.001.0001","volume-title":"Random Walks and Random Environments, vol 1: Random Walks","author":"B.D. Hughes","year":"1995","unstructured":"Hughes B.D.: Random Walks and Random Environments, vol 1: Random Walks. Oxford University Press, USA (1995)"},{"key":"212_CR42","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 Presss, USA (2007)"},{"key":"212_CR43","unstructured":"Kempe, J.: Quantum random walks\u2014an introductory overview. Contemporary Physics 44, 307 (2003). http:\/\/www.citebase.org\/abstract?id=oai:arXiv.org:quant-ph\/0303081"},{"key":"212_CR44","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s11128-005-0004-z","volume":"5","author":"V. Korepin","year":"2006","unstructured":"Korepin V., Grover L.: Simple algorithm for partial quantum search. Quantum Information Processing 5, 5\u201310 (2006). doi: 10.1007\/s11128-005-0004-z","journal-title":"Quantum Information Processing"},{"key":"212_CR45","doi-asserted-by":"crossref","first-page":"5187","DOI":"10.1142\/S0217979207038344","volume":"21","author":"V.E. Korepin","year":"2007","unstructured":"Korepin V.E., Xu Y.: Hierarchical Quantum Search. Int. J. Modern Phys. B 21, 5187\u20135205 (2007). doi: 10.1142\/S0217979207038344","journal-title":"Int. J. Modern Phys. B"},{"key":"212_CR46","doi-asserted-by":"crossref","unstructured":"Korf, R.E.: Depth-first iterative deepening: An optimal admissible tree search. Artif. Intell. (1985)","DOI":"10.1016\/0004-3702(85)90084-0"},{"key":"212_CR47","unstructured":"Korf, R.E.: Best-first search with limited memory. UCLA Comput. Sci. Annu. (1991)"},{"issue":"1","key":"212_CR48","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0004-3702(93)90045-D","volume":"62","author":"R.E. Korf","year":"1993","unstructured":"Korf R.E.: Linear-space best-first search. Artif. Intell. 62(1), 41\u201378 (1993)","journal-title":"Artif. Intell."},{"issue":"1","key":"212_CR49","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."},{"issue":"1","key":"212_CR50","first-page":"11","volume":"1","author":"J.E. Laird","year":"1986","unstructured":"Laird J.E., Rosenbloom P.S., Newell A.: Chunking in soar: the anatomy of a general learning mechanism. Mach. Learn. 1(1), 11\u201346 (1986)","journal-title":"Mach. Learn."},{"issue":"2","key":"212_CR51","doi-asserted-by":"crossref","first-page":"022,307","DOI":"10.1103\/PhysRevA.64.022307","volume":"64","author":"G.L. Long","year":"2001","unstructured":"Long G.L.: Grover algorithm with zero theoretical failure rate. Phys. Rev. A 64(2), 022,307 (2001). doi: 10.1103\/PhysRevA.64.022307","journal-title":"Phys. Rev. A"},{"key":"212_CR52","volume-title":"Artificial Intelligence: Structures and Strategies for Complex Problem Solving","author":"G.F. Luger","year":"1993","unstructured":"Luger G.F., Stubblefield W.A.: Artificial Intelligence: Structures and Strategies for Complex Problem Solving: 2nd edn. The Benjamin\/Cummings Publishing Company, Inc, Reading (1993)","edition":"2"},{"key":"212_CR53","volume-title":"Logic and Computer Design Fundamentals","author":"M. Mano","year":"2002","unstructured":"Mano M., Kime C.R.: Logic and Computer Design Fundamentals, 2nd edn. Prentice Hall, Englewood Cliffs (2002)","edition":"2"},{"issue":"5","key":"212_CR54","doi-asserted-by":"crossref","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. J. Stat. Phys. 85(5), 551\u2013574 (1996). doi: 10.1007\/BF02199356","journal-title":"J. Stat. Phys."},{"key":"212_CR55","unstructured":"Moore, E.: The shortest path through a maze. In: Proceeding of an International Symposium on the Theory of Switching, Part II, pp. 285\u2013292. Harvard University Press, Cambridge (1959)"},{"key":"212_CR56","unstructured":"Nayak, A., Vishwanath, A.: Quantum walk on the line. Tech. rep., DIMACS Technical Report (2000). http:\/\/www.citebase.org\/abstract?id=oai:arXiv.org:quant-ph\/0010117"},{"key":"212_CR57","unstructured":"Newell, A.: A guide to the general problem-solver program gps-2-2. Tech. Rep. RM-3337-PR, RAND Corporation, Santa Monica, CA, USA (1963)"},{"key":"212_CR58","unstructured":"Newell, A., Ernst, G.E.: The search for generality. In: Information Processing 1965: Proceeding of IFIP Congress, vol. 1, pp. 17\u201324. Spartan, Chicago (1965)"},{"key":"212_CR59","unstructured":"Newell, A., Shaw, J., Simon, H.A.: Report on a general problem-solving program. In: Proceedings of the International Conference on Information Processing, pp. 256\u2013264 (1959)"},{"key":"212_CR60","volume-title":"Quantum Computation and Quantum Information","author":"M.A. Nielsen","year":"2000","unstructured":"Nielsen M.A., Chuang I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"key":"212_CR61","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-09438-9","volume-title":"Principles of Artificial Intelligence","author":"N.J. Nilsson","year":"1982","unstructured":"Nilsson N.J.: Principles of Artificial Intelligence. Morgan Kaufmann Publishers, Inc, Los Altos (1982)"},{"key":"212_CR62","unstructured":"Post, E.: The Two-Valued Iterative Systems of Mathematical Logic. (AM-5). Princeton University Press, Princeton (1941). http:\/\/press.princeton.edu\/titles\/4055.html"},{"key":"212_CR63","doi-asserted-by":"crossref","first-page":"197","DOI":"10.2307\/2371809","volume":"65","author":"E. Post","year":"1943","unstructured":"Post E.: Formal reductions of the general combinatorial problem. Am. J. Math. 65, 197\u2013268 (1943)","journal-title":"Am. J. Math."},{"key":"212_CR64","volume-title":"Artificial Intelligence: A Modern Approach","author":"S.J. Russell","year":"2003","unstructured":"Russell S.J., Norvig P., Canny J.F., Edwards D.D., Malik J.M., Thrun S.: Artificial Intelligence: A Modern Approach, 2nd edn. Prentice Hall, Englewood Cliffs (2003)","edition":"2"},{"key":"212_CR65","doi-asserted-by":"crossref","unstructured":"Santos, A.C., Tarrataca, L., Jo\u00e3o, C.: An analysis of navigation algorithms for smartphones using j2me. In: In Proceedings of the Second International ICST Conference on MOBILe Wireless MiddleWARE, Operating Systems, and Applications (Mobilware\u201909, Berlin, Germany, April 28\u201329), LNICST, vol. 7, pp. 266\u2013279. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-01802-2_20"},{"key":"212_CR66","doi-asserted-by":"crossref","unstructured":"Santos, A.C., Tarrataca, L., Jo\u00e3o, C.: Context inference for mobile applications in the upcase project. In: In Proceedings of the Second International ICST Conference on MOBILe Wireless MiddleWARE, Operating Systems, and Applications (Mobilware\u201909, Berlin, Germany, April 28\u201329), LNICST, vol. 7, pp. 352\u2013365. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-01802-2_26"},{"issue":"5","key":"212_CR67","doi-asserted-by":"crossref","first-page":"052,307","DOI":"10.1103\/PhysRevA.67.052307","volume":"67","author":"N. Shenvi","year":"2003","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","journal-title":"Phys. Rev. A"},{"key":"212_CR68","doi-asserted-by":"crossref","unstructured":"Shor, P.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134 (1994). doi: 10.1109\/SFCS.1994.365700","DOI":"10.1109\/SFCS.1994.365700"},{"key":"212_CR69","doi-asserted-by":"crossref","unstructured":"Slate, D., Atkin, L.R.: Chess 4.5\u2014northwestern university chess program. In: Chess Skill in Man and Machine, pp. 82\u2013118. Springer, Berlin (1977)","DOI":"10.1007\/978-3-662-06239-5_4"},{"key":"212_CR70","doi-asserted-by":"crossref","unstructured":"Toffoli, T.: Reversible computing. In: Proceedings of the 7th Colloquium on Automata, Languages and Programming, pp. 632\u2013644. Springer, London (1980)","DOI":"10.1007\/3-540-10003-2_104"},{"key":"212_CR71","doi-asserted-by":"crossref","unstructured":"Toffoli, T.: Reversible computing. Tech. rep., Massschusetts Institute of Technology, Laboratory for Computer Science (1980)","DOI":"10.21236\/ADA082021"},{"key":"212_CR72","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511470967","volume-title":"Random Walks on Infinite Graphs and Groups. No. 138 in Cambridge Tracts in Mathematics","author":"W. Woess","year":"2000","unstructured":"Woess W.: Random Walks on Infinite Graphs and Groups. No. 138 in Cambridge Tracts in Mathematics. Cambridge University Press, Cambridge (2000)"},{"key":"212_CR73","unstructured":"Zalka, C.: A grover-based quantum search of optimal order for an unknown number of marked elements (1999). http:\/\/www.citebase.org\/abstract?id=oai:arXiv.org:quant-ph\/9902049"},{"key":"212_CR74","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-010-0212-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11128-010-0212-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-010-0212-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T10:58:45Z","timestamp":1711969125000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11128-010-0212-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,21]]},"references-count":74,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["212"],"URL":"https:\/\/doi.org\/10.1007\/s11128-010-0212-z","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"value":"1570-0755","type":"print"},{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,21]]}}}