{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T12:15:30Z","timestamp":1765887330118},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,10,1]],"date-time":"2011-10-01T00:00:00Z","timestamp":1317427200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1007\/s11047-011-9279-4","type":"journal-article","created":{"date-parts":[[2011,9,30]],"date-time":"2011-09-30T12:01:43Z","timestamp":1317384103000},"page":"23-35","source":"Crossref","is-referenced-by-count":15,"title":["Spatial search using the discrete time quantum walk"],"prefix":"10.1007","volume":"11","author":[{"given":"Neil B.","family":"Lovett","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"Everitt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"Trevers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Mosby","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Stockton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Viv","family":"Kendon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,10,1]]},"reference":[{"key":"9279_CR12","doi-asserted-by":"crossref","unstructured":"Aaronson S, Ambainis A (2003) Quantum search of spatial regions. In: Proceedings of the 44th FOCS. IEEE, Los Alamitos, p 200","DOI":"10.1109\/SFCS.2003.1238194"},{"key":"9279_CR28","doi-asserted-by":"crossref","unstructured":"Abal G, Donangelo R, Marquezino FL, Portugal R (2010) Spatial search in a honeycomb network. Math Struct Comput Sci (special volume on Quantum Computing). arXiv:1001.1139","DOI":"10.1017\/S0960129510000332"},{"key":"9279_CR2","doi-asserted-by":"crossref","unstructured":"Aharonov D, Ambainis A, Kempe J, Vazirani U (2001) Quantum walks on graphs. In: Proceedings of the 33rd annual ACM STOC. ACM, New York, pp 50\u201359","DOI":"10.1145\/380752.380758"},{"issue":"4","key":"9279_CR6","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1142\/S0219749903000383","volume":"1","author":"A Ambainis","year":"2003","unstructured":"Ambainis A (2003) Quantum walks and their algorithmic applications. Int J Quantum Inf 1(4):507\u2013518","journal-title":"Int J Quantum Inf"},{"key":"9279_CR1","doi-asserted-by":"crossref","unstructured":"Ambainis A, Bach E, Nayak A, Vishwanath A, Watrous J (2001) One-dimensional quantum walks. In: Proceedings of the 33rd annual ACM STOC. ACM, New York, pp 60\u201369","DOI":"10.1145\/380752.380757"},{"key":"9279_CR15","unstructured":"Ambainis A, Kempe J, Rivosh A (2005) Coins make quantum walks faster. In: Proceedings of the 16th ACM-SIAM SODA. ACM, New York, pp 1099\u20131108"},{"key":"9279_CR11","doi-asserted-by":"crossref","unstructured":"Benioff P (2002) Space searches with a quantum robot. In: Lomonaco SJ, Brandt HE (eds) Quantum computation and information. AMS Contempory Maths Series volume 305. AMS, Providence","DOI":"10.1090\/conm\/305\/05212"},{"issue":"5","key":"9279_CR9","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1137\/S0097539796300933","volume":"26","author":"CH Bennett","year":"1997","unstructured":"Bennett CH, Bernstein E, Brassard G, Vazirani U (1997) Strengths and weaknesses of quantum computing. SIAM J Comput 26(5):151\u2013152","journal-title":"SIAM J Comput"},{"key":"9279_CR27","doi-asserted-by":"crossref","unstructured":"Brassard G, Hyer P, Mosca M, Tapp A (2002) Quantum amplitude amplification and estimation. In: Quantum computation and information (Washington, DC, 2000). Volume 305 of Contempory Maths. American Mathematical Society, Providence, p 5374","DOI":"10.1090\/conm\/305\/05215"},{"key":"9279_CR100","doi-asserted-by":"crossref","unstructured":"Childs AM (2009) Universal computation by quantum walk. Phys Rev Lett 102(18):180501","DOI":"10.1103\/PhysRevLett.102.180501"},{"key":"9279_CR13","doi-asserted-by":"crossref","first-page":"022314","DOI":"10.1103\/PhysRevA.70.022314","volume":"70","author":"AM Childs","year":"2004","unstructured":"Childs AM, Goldstone J (2004a) Spatial search by quantum walk. Phys Rev A 70:022314","journal-title":"Phys Rev A"},{"key":"9279_CR14","doi-asserted-by":"crossref","first-page":"042312","DOI":"10.1103\/PhysRevA.70.042312","volume":"70","author":"AM Childs","year":"2004","unstructured":"Childs AM, Goldstone J (2004b) Spatial search and the Dirac equation. Phys Rev A 70:042312","journal-title":"Phys Rev A"},{"key":"9279_CR20","doi-asserted-by":"crossref","unstructured":"Childs AM, Cleve R, Deotto E, Farhi E, Gutmann S, Spielman DA (2003) Exponential algorithmic speedup by a quantum walk. In: Proceedings of the 35th annual ACM STOC. ACM, New York, pp 59\u201368","DOI":"10.1145\/780542.780552"},{"key":"9279_CR3","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 (1998) Quantum computation and decision trees. Phys Rev A 58:915\u2013928","journal-title":"Phys Rev A"},{"key":"9279_CR5","doi-asserted-by":"crossref","unstructured":"Grover LK (1996) A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th annual ACM STOC. ACM, New York, p 212","DOI":"10.1145\/237814.237866"},{"issue":"6","key":"9279_CR26","first-page":"1169","volume":"17","author":"V Kendon","year":"2006","unstructured":"Kendon V (2006) Decoherence in quantum walks\u2014a review. Math Struct Comput Sci 17(6):1169\u20131220","journal-title":"Math Struct Comput Sci"},{"issue":"3","key":"9279_CR22","doi-asserted-by":"crossref","first-page":"032341","DOI":"10.1103\/PhysRevA.73.032341","volume":"73","author":"H Krovi","year":"2006","unstructured":"Krovi H, Brun TA (2006a) Hitting time for quantum walks on the hypercube. Phys Rev A 73(3):032341","journal-title":"Phys Rev A"},{"issue":"4","key":"9279_CR23","doi-asserted-by":"crossref","first-page":"042334","DOI":"10.1103\/PhysRevA.74.042334","volume":"74","author":"H Krovi","year":"2006","unstructured":"Krovi H, Brun TA (2006b) Quantum walks with infinite hitting times. Phys Rev A 74(4):042334","journal-title":"Phys Rev A"},{"key":"9279_CR24","doi-asserted-by":"crossref","first-page":"062332","DOI":"10.1103\/PhysRevA.75.062332","volume":"75","author":"H Krovi","year":"2007","unstructured":"Krovi H, Brun TA (2007) Quantum walks on quotient graphs. Phys Rev A 75:062332","journal-title":"Phys Rev A"},{"key":"9279_CR19","unstructured":"Krovi H, Magniez F, Ozols M, Roland J (2010) Finding is as easy as detecting for quantum walks. In: Proceedings of ICALP\u201910. LNCS vol 6198, pp 540\u2013551"},{"key":"9279_CR101","doi-asserted-by":"crossref","unstructured":"Lovett NB, Cooper S, Everitt M, Trevers M, Kendon V (2010) Universal quantum computation using the discrete time quantum walk. Phys Rev A 81(4):042330","DOI":"10.1103\/PhysRevA.81.042330"},{"key":"9279_CR17","doi-asserted-by":"crossref","unstructured":"Magniez F, Nayak A, Richter P, Santha M (2009) On the hitting times of quantum versus random walks. In: Proceedings of the 20th annual ACM-SIAM SODA, ACM, New York, pp 86\u201395","DOI":"10.1137\/1.9781611973068.10"},{"key":"9279_CR8","doi-asserted-by":"crossref","unstructured":"Moore C, Russell A (2002) Quantum walks on the hypercube. In: Proceedings of the 6th international workshop on randomization and approximation techniques in computer science (RANDOM \u201902). Springer, pp 164\u2013178","DOI":"10.1007\/3-540-45726-7_14"},{"key":"9279_CR18","doi-asserted-by":"crossref","first-page":"032331","DOI":"10.1103\/PhysRevA.82.032331","volume":"82","author":"A Patel","year":"2010","unstructured":"Patel A, KS Raghunathan, Rahaman MdA (2010) Search on a hypercubic lattice through a quantum random walk: II. d\u00a0=\u00a02. Phys Rev A 82:032331","journal-title":"Phys Rev A"},{"key":"9279_CR10","doi-asserted-by":"crossref","first-page":"012325","DOI":"10.1103\/PhysRevA.79.012325","volume":"79","author":"V Poto\u010dek","year":"2009","unstructured":"Poto\u010dek V, G\u00e1bris A, Kiss T, Jex I (2009) Optimized quantum random-walk search algorithms. Phys Rev A 79:012325","journal-title":"Phys Rev A"},{"key":"9279_CR7","doi-asserted-by":"crossref","unstructured":"Santha M (2008) Quantum walk based search algorithms. In: Proceedings of the 5th theory and applications of models of computation (TAMC08), Xian, April 2008, vol 4978. LNCS, pp 31\u201346","DOI":"10.1007\/978-3-540-79228-4_3"},{"key":"9279_CR4","doi-asserted-by":"crossref","first-page":"052307","DOI":"10.1103\/PhysRevA.67.052307","volume":"67","author":"N Shenvi","year":"2003","unstructured":"Shenvi N, Kempe J, Whaley KB (2003) A quantum random walk search algorithm. Phys Rev A 67:052307","journal-title":"Phys Rev A"},{"key":"9279_CR25","doi-asserted-by":"crossref","unstructured":"Szegedy M (2004) Quantum speed-up of Markov Chain based algorithms. In: Proceedings of the 45th annual IEEE symposium on foundations of computer science (FOCS\u201904), pp 32\u201341","DOI":"10.1109\/FOCS.2004.53"},{"key":"9279_CR21","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1088\/1367-2630\/5\/1\/383","volume":"5","author":"B Tregenna","year":"2003","unstructured":"Tregenna B, Flanagan W, Maile R, Kendon V (2003) Controlling discrete quantum walks: coins and initial states. New J Phys 5:83","journal-title":"New J Phys"},{"key":"9279_CR16","doi-asserted-by":"crossref","first-page":"012310","DOI":"10.1103\/PhysRevA.78.012310","volume":"78","author":"A Tulsi","year":"2008","unstructured":"Tulsi A (2008) Faster quantum walk algorithm for the two dimensional spatial search. Phys Rev A 78:012310","journal-title":"Phys Rev A"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-011-9279-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-011-9279-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-011-9279-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T16:12:49Z","timestamp":1560701569000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-011-9279-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,1]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["9279"],"URL":"https:\/\/doi.org\/10.1007\/s11047-011-9279-4","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10,1]]}}}