{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T04:47:58Z","timestamp":1778215678274,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642180729","type":"print"},{"value":"9783642180736","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18073-6_7","type":"book-chapter","created":{"date-parts":[[2011,1,19]],"date-time":"2011-01-19T11:07:19Z","timestamp":1295435239000},"page":"77-93","source":"Crossref","is-referenced-by-count":11,"title":["Quantum Search with Advice"],"prefix":"10.1007","author":[{"given":"Ashley","family":"Montanaro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"6741","DOI":"10.1088\/0305-4470\/34\/35\/302","volume":"34","author":"A. Ambainis","year":"2001","unstructured":"Ambainis, A., de Wolf, R.: Average-case quantum query complexity. J. Phys. A: Math. Gen.\u00a034, 6741\u20136754 (2001), quant-ph\/9904079","journal-title":"J. Phys. A: Math. Gen."},{"issue":"4","key":"7_CR2","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1145\/502090.502097","volume":"48","author":"R. Beals","year":"2001","unstructured":"Beals, R., Buhrman, H., Cleve, R., Mosca, M., de Wolf, R.: Quantum lower bounds by polynomials. J. ACM\u00a048(4), 778\u2013797 (2001), quant-ph\/9802049","journal-title":"J. ACM"},{"issue":"4-5","key":"7_CR3","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P","volume":"46","author":"M. Boyer","year":"1998","unstructured":"Boyer, M., Brassard, G., H\u00f8yer, P., Tapp, A.: Tight bounds on quantum searching. Fortschr. Phys.\u00a046(4-5), 493\u2013505 (1998), quant-ph\/9605034","journal-title":"Fortschr. Phys."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Brassard, G., H\u00f8yer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. In: Quantum Computation and Quantum Information: A Millennium Volume, pp. 53\u201374 (2002), quant-ph\/0005055","DOI":"10.1090\/conm\/305\/05215"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0304-3975(01)00144-X","volume":"288","author":"H. Buhrman","year":"2002","unstructured":"Buhrman, H., de Wolf, R.: Complexity measures and decision tree complexity: a survey. Theoretical Computer Science\u00a0288, 21\u201343 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"7_CR6","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. Phys. Rev. Lett.\u00a079(2), 325\u2013328 (1997), quant-ph\/9706033","journal-title":"Phys. Rev. Lett."},{"key":"7_CR7","unstructured":"Grover, L., Rudolph, T.: Creating superpositions that correspond to efficiently integrable probability distributions (2002), quant-ph\/0208112"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"52304","DOI":"10.1103\/PhysRevA.62.052304","volume":"62","author":"P. H\u00f8yer","year":"2000","unstructured":"H\u00f8yer, P.: Arbitrary phases in quantum amplitude amplification. Phys. Rev. A\u00a062, 052304 (2000), quant-ph\/0006031","journal-title":"Phys. Rev. A"},{"key":"7_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"7_CR10","volume-title":"Quantum computation and quantum information","author":"M.A. Nielsen","year":"2000","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum computation and quantum information. Cambridge University Press, Cambridge (2000)"},{"issue":"6","key":"7_CR11","doi-asserted-by":"publisher","first-page":"1716","DOI":"10.1073\/pnas.0813202106","volume":"106","author":"W.H. Press","year":"2009","unstructured":"Press, W.H.: Strong profiling is not mathematically optimal for discovering rare malfeasors. Proceedings of the National Academy of Sciences\u00a0106(6), 1716\u20131719 (2009)","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"4","key":"7_CR12","doi-asserted-by":"publisher","first-page":"2746","DOI":"10.1103\/PhysRevA.60.2746","volume":"60","author":"C. Zalka","year":"1999","unstructured":"Zalka, C.: Grover\u2019s quantum searching algorithm is optimal. Phys. Rev. A.\u00a060(4), 2746\u20132751 (1999), quant-ph\/9711070","journal-title":"Phys. Rev. A."}],"container-title":["Lecture Notes in Computer Science","Theory of Quantum Computation, Communication, and Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18073-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T00:01:41Z","timestamp":1559952101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18073-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642180729","9783642180736"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18073-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}