{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T02:48:43Z","timestamp":1780454923639,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642360442","type":"print"},{"value":"9783642360466","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36046-6_17","type":"book-chapter","created":{"date-parts":[[2013,1,16]],"date-time":"2013-01-16T00:56:22Z","timestamp":1358297782000},"page":"180-189","source":"Crossref","is-referenced-by-count":9,"title":["Grover\u2019s Algorithm with Errors"],"prefix":"10.1007","author":[{"given":"Andris","family":"Ambainis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Art\u016brs","family":"Ba\u010dkurs","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nikolajs","family":"Nahimovs","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander","family":"Rivosh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"17_CR1","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/992287.992296","volume":"35","author":"A. Ambainis","year":"2004","unstructured":"Ambainis, A.: Quantum search algorithms. SIGACT News\u00a035(2), 22\u201335 (2004)","journal-title":"SIGACT News"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/978-3-540-31856-9_49","volume-title":"STACS 2005","author":"H. Buhrman","year":"2005","unstructured":"Buhrman, H., Newman, I., R\u00f6hrig, H., de Wolf, R.: Robust Polynomials and Quantum Algorithms. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 593\u2013604. Springer, Heidelberg (2005)"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Grover, L.: A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th ACM STOC, Philadelphia, Pennsylvania, pp. 212\u2013219. ACM Press (1996)","DOI":"10.1145\/237814.237866"},{"key":"17_CR4","unstructured":"Horn, R., Johnson, C.: Matrix Analysis. Cambridge University Press (2006)"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"42305","DOI":"10.1103\/PhysRevA.61.042305","volume":"61","author":"G.L. Long","year":"2000","unstructured":"Long, G.L., Li, Y.S., Zhang, W.L., Tu, C.C.: An intrinsic limitation on the size of quantum database. Physical Review A\u00a061, 042305 (2000); Also arXiv:quant-ph\/9910076","journal-title":"Physical Review A"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Kaye, P., Laflamme, R., Mosca, M.: An Introduction to Quantum Computing. Cambridge University Press (2007)","DOI":"10.1093\/oso\/9780198570004.001.0001"},{"key":"17_CR7","unstructured":"Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press (2000)"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1007\/978-3-540-70575-8_63","volume-title":"Automata, Languages and Programming","author":"O. Regev","year":"2008","unstructured":"Regev, O., Schiff, L.: Impossibility of a Quantum Speed-Up with a Faulty Oracle. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 773\u2013781. Springer, Heidelberg (2008)"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"42301","DOI":"10.1103\/PhysRevA.67.042301","volume":"67","author":"D. Shapira","year":"2003","unstructured":"Shapira, D., Mozes, S., Biham, O.: The effect of unitary noise on Grover\u2019s quantum search algorithm. Physical Review A\u00a067, 042301 (2003); Also arXiv:quant-ph\/0307142","journal-title":"Physical Review A"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"52313","DOI":"10.1103\/PhysRevA.68.052313","volume":"68","author":"N. Shenvi","year":"2003","unstructured":"Shenvi, N., Brown, K.R., Whaley, K.B.: Effects of Noisy Oracle on Search Algorithm Complexity. Physical Review A\u00a068, 052313 (2003); Also quant-ph\/0304138","journal-title":"Physical Review A"}],"container-title":["Lecture Notes in Computer Science","Mathematical and Engineering Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36046-6_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,6]],"date-time":"2022-02-06T01:31:06Z","timestamp":1644111066000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36046-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642360442","9783642360466"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36046-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}