{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T02:22:59Z","timestamp":1748744579822},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424871"},{"type":"electronic","value":"9783540446699"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44669-9_6","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:32:26Z","timestamp":1186741946000},"page":"45-46","source":"Crossref","is-referenced-by-count":4,"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":[[2001,8,2]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","first-page":"1411","DOI":"10.1137\/S0097539796300921","volume":"26","author":"E Bernstein","year":"1993","unstructured":"Bernstein E and Vazirani U, 1993, Quantum complexity theory, SIAM Journal of Computation 265 pp 1411\u20131473 October, 1997.","journal-title":"SIAM Journal of Computation"},{"key":"6_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,\u201d SIAM J. Computing, 26, pp. 1510\u20131523 (1997).","journal-title":"SIAM J. Computing"},{"key":"6_CR3","unstructured":"van Dam, W., Hallgren, H., \u201cEfficient Quantum Algorithms for Shifted Quadratic Character Problems\u201d, quant-ph\/0011067."},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"van Dam, W., Mosca, M., Vazirani, U., \u201cHow Powerful is Adiabatic Quantum Computing?\u201d manuscript, 2001.","DOI":"10.1109\/SFCS.2001.959902"},{"key":"6_CR5","unstructured":"E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, \u201cQuantum Computation by Adiabatic Evolution\u201d, quant-ph report no. 0001106 (2000)"},{"key":"6_CR6","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 Instances of an NP-Complete Problem\u201d, Science, Vol. 292, April, pp. 472\u2013476 (2001)","DOI":"10.1126\/science.1057726"},{"key":"6_CR7","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 a needle in a haystack,\u2019\u2019 Phys. Rev. Letters, 78, pp. 325\u2013328 (1997).","journal-title":"Phys. Rev. Letters"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Grigni, M., Schulman, S., Vazirani, M., Vazirani, U., \u201cQuantum Mechanical Algorithms for the Nonabelian 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":"6_CR9","doi-asserted-by":"crossref","unstructured":"L. Hales and S. Hallgren. Quantum Fourier Sampling 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":"6_CR10","doi-asserted-by":"crossref","unstructured":"Hallgren, S., Russell, A., Ta-Shma, A., \u201cNormal subgroup reconstruction and 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":"6_CR11","doi-asserted-by":"crossref","unstructured":"D. Simon. \u201cOn the power of quantum computation.\u201d In Proc. 35th Symposium on Foundations of Computer Science (FOCS), 1994.","DOI":"10.1109\/SFCS.1994.365701"},{"key":"6_CR12","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 algorithms for prime factorization and discrete logarithms on a 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","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44669-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T22:12:54Z","timestamp":1556748774000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44669-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424871","9783540446699"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-44669-9_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}