{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:33:43Z","timestamp":1725514423094},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540725039"},{"type":"electronic","value":"9783540725046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72504-6_41","type":"book-chapter","created":{"date-parts":[[2007,7,22]],"date-time":"2007-07-22T11:36:39Z","timestamp":1185104199000},"page":"450-461","source":"Crossref","is-referenced-by-count":0,"title":["Bounding Run-Times of Local Adiabatic Algorithms"],"prefix":"10.1007","author":[{"given":"M. V. Panduranga","family":"Rao","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"41_CR1","doi-asserted-by":"crossref","unstructured":"Aharonov, D., et al.: Adiabatic quantum computation is equivalent to standard quantum computation. In: Annual IEEE Symposium on Foundations of Computer Science, pp. 42\u201351 (2004)","DOI":"10.1109\/FOCS.2004.8"},{"key":"41_CR2","unstructured":"Ambainis, A., Regev, O.: An elementary proof of the quantum adiabatic theorem (2004)"},{"key":"41_CR3","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1088\/0305-4470\/37\/34\/L01","volume":"37","author":"M. Andrecut","year":"2004","unstructured":"Andrecut, M., Ali, M.K.: Adiabatic quantum oracles. Journal of Physics A: Mathematical and General\u00a037, L421\u2013L427 (2004)","journal-title":"Journal of Physics A: Mathematical and General"},{"key":"41_CR4","doi-asserted-by":"crossref","unstructured":"\u00c5berg, J., Kult, D., Sj\u00f6qvist, E.: Quantum adiabatic search with decoherence in the instantaneous energy eigenbasis. Physical Review A\u00a072(042317) (2005)","DOI":"10.1103\/PhysRevA.72.042317"},{"key":"41_CR5","doi-asserted-by":"crossref","unstructured":"\u00c5berg, J., Kult, D., Sj\u00f6qvist, E.: Robustness of the adiabatic quantum search. Physical Review A\u00a071(060312(R) (2005)","DOI":"10.1103\/PhysRevA.71.060312"},{"issue":"3","key":"41_CR6","doi-asserted-by":"crossref","first-page":"181","DOI":"10.26421\/QIC2.3-1","volume":"2","author":"A.M. Childs","year":"2002","unstructured":"Childs, A.M., et al.: Finding cliques by quantum adiabatic evolution. Quantum Information and Computation\u00a02(3), 181\u2013191 (2002)","journal-title":"Quantum Information and Computation"},{"key":"41_CR7","doi-asserted-by":"crossref","unstructured":"Childs, A.M., Farhi, E., Preskill, J.: Robustness of adiabatic quantum computation. Physical Review A\u00a065(012322) (2002)","DOI":"10.1103\/PhysRevA.65.012322"},{"key":"41_CR8","unstructured":"Farhi, E., Goldstone, J., Gutmann, S.: A numerical study of the performance of a quantum adiabatic evolution algorithm for satisfiability. quant-ph\/0007071 (2000)"},{"issue":"5516","key":"41_CR9","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1126\/science.1057726","volume":"292","author":"E. Farhi","year":"2001","unstructured":"Farhi, E., et al.: A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem. Science\u00a0292(5516), 472\u2013476 (2001)","journal-title":"Science"},{"key":"41_CR10","unstructured":"Farhi, E., et al.: How to make the quantum adiabatic algorithm fail. quant-ph\/0512159 (2005)"},{"key":"41_CR11","unstructured":"Farhi, E., et al.: Quantum computation by adiabatic evolution. arXiv:quant-ph\/0001106 (2002)"},{"issue":"2","key":"41_CR12","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1103\/PhysRevLett.79.325","volume":"79","author":"L. Grover","year":"1997","unstructured":"Grover, L.: Quantum mechanics helps in searching for a needle in a haystack. Physical Review Letters\u00a079(2), 325\u2013328 (1997)","journal-title":"Physical Review Letters"},{"key":"41_CR13","volume-title":"Quantum Mechanics","author":"A. Messiah","year":"1958","unstructured":"Messiah, A.: Quantum Mechanics. John Wiley and Sons, New York (1958)"},{"key":"41_CR14","doi-asserted-by":"crossref","unstructured":"Panduranga Rao, M.V.: Solving a hidden subgroup problem using the adiabatic quantum computing paradigm. Physical Review A\u00a067(052306) (2003)","DOI":"10.1103\/PhysRevA.67.052306"},{"key":"41_CR15","doi-asserted-by":"crossref","unstructured":"Roland, J., Cerf, N.: Quantum search by local adiabatic evolution. Physical Review A\u00a065(042308) (2002)","DOI":"10.1103\/PhysRevA.65.042308"},{"key":"41_CR16","doi-asserted-by":"crossref","unstructured":"Schaller, G., Mostame, S., Schutzhold, R.: General error estimate for adiabatic quantum computing. General error estimate for adiabatic quantum computing\u00a073(062307) (2006)","DOI":"10.1103\/PhysRevA.73.062307"},{"key":"41_CR17","doi-asserted-by":"crossref","unstructured":"van Dam, W., Mosca, M., Vazirani, U.V.: How powerful is adiabatic quantum computation? In: Annual IEEE Symposium on Foundations of Computer Science, pp. 279\u2013287 (2001)","DOI":"10.1109\/SFCS.2001.959902"},{"key":"41_CR18","unstructured":"Wei, Z., Ying, M.: Quantum adiabatic evolutions that can\u2019t be used to design efficient algorithms. arXiv:quant-ph\/0604077 (2006)"},{"key":"41_CR19","doi-asserted-by":"crossref","unstructured":"Znidaric, M., Horvat, M.: Exponential complexity of an adiabatic algorithm for an NP-complete problem. Physical Review A\u00a073(022329) (2006)","DOI":"10.1103\/PhysRevA.73.022329"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72504-6_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,20]],"date-time":"2021-08-20T07:29:26Z","timestamp":1629444566000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72504-6_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540725039","9783540725046"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72504-6_41","relation":{},"subject":[]}}