{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:17:50Z","timestamp":1725484670979},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540434009"},{"type":"electronic","value":"9783540459958"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45995-2_5","type":"book-chapter","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T22:33:34Z","timestamp":1180478014000},"page":"12-13","source":"Crossref","is-referenced-by-count":0,"title":["Quantum Algorithms"],"prefix":"10.1007","author":[{"given":"Umesh","family":"Vazirani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"issue":"5","key":"5_CR1","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1137\/S0097539796300921","volume":"26","author":"E. Bernstein","year":"1997","unstructured":"Bernstein E and Vazirani U, 1993, Quantum complexity theory, SIAM Journal of Computation 26 5 pp 1411\u20131473 October, 1997.","journal-title":"SIAM Journal of Computation"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1137\/S0097539796300933","volume":"26","author":"C.H. Bennett","year":"1997","unstructured":"Bennett, C.H., Bernstein, E., Brassard, G. and Vazirani, U.,\u201cStrengths and weaknesses of quantum computation,\u201dSIAM J.Computing, 26, pp.1510\u20131523 (1997).","journal-title":"SIAM J.Computing"},{"key":"5_CR3","unstructured":"van Dam, W., Hallgren, H.,\u201cEfficient Quantum Algorithms for Shifted Quadratic Character Problems \u201d, quant-ph\/0011067."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"van Dam, W., Mosca, M., Vazirani, U.,\u201cHow Powerful is Adiabatic Quantum Computing?\u201dFOCS,2001.","DOI":"10.1109\/SFCS.2001.959902"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"van Dam, W., Vazirani, U.,\u201cOn the Power of Adiabatic Quantum Computing\u201d manuscript, 2001.","DOI":"10.1109\/SFCS.2001.959902"},{"key":"5_CR6","unstructured":"E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser,\u201cQuantum Comput tion by Adiab tic Evolution \u201d, quant-ph report no. 0001106 (2000)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"E. Farhi, J. Goldstone, S. Gutmann, J. Lapan, A. Lundgren, and D. Preda,\u201cA Quantum Adiabatic Evolution Algorithm Applied to Random Inst nces of an NP-Complete Problem\u201d, Science, Vol.292, April, pp.472\u2013476 (2001)","DOI":"10.1126\/science.1057726"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1103\/PhysRevLett.79.325","volume":"78","author":"L. Grover","year":"1997","unstructured":"Grover, L.,\u201cQuantum mechanics helps in searching for needle in haystack,\u201d Phys.Rev.Letters, 78, pp.325\u2013328 (1997).","journal-title":"Phys.Rev.Letters"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Grigni, M., Schulman, S., Vazirani, M., Vazirani, U.,\u201cQuantum Mech nical Al-gorithms for the Non beli n Hidden Subgroup Problem\u201d, In Proceedings of the Thirty-third Annual ACM Symposium on the Theory of Computing Crete, Greece, 2001.","DOI":"10.1145\/380752.380769"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"L. Hales and S. Hallgren.Quantum Fourier S mpling Simplified. In Proceedings of the Thirty-first Annual ACM Symposium on the Theory of Computing pages 330\u2013338,Atlanta,Georgia, 1\u20134 May 1999.","DOI":"10.1145\/301250.301336"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Hallgren, S., Russell, A., T-Shma, A.,\u201cNormal subgroup reconstruction nd quantum computation using group representations \u201d, In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing 627\u2013635, 2000.","DOI":"10.1145\/335305.335392"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"D. Simon.\u201cOn the power of quantum comput tion.\u201d In Proc. 35th Symposium on Foundations of Computer Science (FOCS), 1994.","DOI":"10.1109\/SFCS.1994.365701"},{"issue":"5","key":"5_CR13","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P. W. Shor","year":"1997","unstructured":"Shor P W, Polynomial-time lgorithms for prime factorization and discrete logarithms on quantum computer, SIAM J. Comp., 26 No.5, pp 1484\u20131509, October 1997.","journal-title":"SIAM J. Comp."}],"container-title":["Lecture Notes in Computer Science","LATIN 2002: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45995-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T08:30:32Z","timestamp":1556440232000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45995-2_5"}},"subtitle":["Invited Talk"],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434009","9783540459958"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45995-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}