{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T01:10:08Z","timestamp":1746148208275,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642544286"},{"type":"electronic","value":"9783642544293"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54429-3_10","type":"book-chapter","created":{"date-parts":[[2014,3,7]],"date-time":"2014-03-07T09:33:06Z","timestamp":1394184786000},"page":"153-163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Multi-query Quantum Sums"],"prefix":"10.1007","author":[{"given":"David A.","family":"Meyer","sequence":"first","affiliation":[]},{"given":"James","family":"Pommersheim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,3,8]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1098\/rspa.1985.0070","volume":"400","author":"D Deutsch","year":"1985","unstructured":"Deutsch, D.: Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. Roy. Soc. London A 400, 97\u2013117 (1985)","journal-title":"Proc. Roy. Soc. London A"},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1098\/rspa.1998.0164","volume":"454","author":"R. Cleve","year":"1998","unstructured":"Cleve, R., Ekert, A., Macchiavello, C., Mosca, M.: Quantum algorithms revisited. Proc. Roy. Soc. London A 454, 339\u2013354 (1998)","journal-title":"Proc. Roy. Soc. London A"},{"key":"10_CR3","doi-asserted-by":"crossref","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 48, 778\u2013797 (2001)","journal-title":"J. ACM"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Simon, D.R.: On the power of quantum computation. In: Goldwasser, S. (ed.) Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, 20\u201322 November 1994, pp. 116\u2013123. IEEE, Los Alamitos, CA (1994)","DOI":"10.1109\/SFCS.1994.365701"},{"key":"10_CR5","doi-asserted-by":"crossref","first-page":"1474","DOI":"10.1137\/S0097539796298637","volume":"26","author":"D.R. Simon","year":"1997","unstructured":"Simon, D.R.: On the power of quantum computation. SIAM J. Comput. 26, 1474\u20131483 (1997)","journal-title":"SIAM J. Comput."},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1137\/S0097539703436345","volume":"35","author":"G Kuperberg","year":"2005","unstructured":"Kuperberg, G.: A subexponential-time quantum algorithm for the dihedral hidden subgroup problem. SIAM J. Comput. 35, 170\u2013188 (2005). quant-ph\/0302112","journal-title":"SIAM J. Comput."},{"key":"10_CR7","unstructured":"Alagic, G., Moore, C., Russell, A.: Quantum algorithms for Simon\u2019s problem over general groups. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, 7\u20139 January 2007, pp. 1217\u20131224. ACM & SIAM, New York & Philadelphia (2007) (quant-ph\/0603251)"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Bacon, D., Childs, A.M., van Dam, W.: From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups. In: Proceedings of the 46th Annual Symposium on Foundations of Computer Science, Pittsburgh, PA, 22\u201325 October 2005, pp. 469\u2013478. IEEE, Los Alamitos, CA (2005) (quant-ph\/0504083)","DOI":"10.1109\/SFCS.2005.38"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual Symposium on the Theory of Computing, Philadelphia, PA, 22\u201324 May 1996, pp. 212\u2013219. ACM, New York (1996)","DOI":"10.1145\/237814.237866"},{"key":"10_CR10","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1103\/PhysRevLett.79.325","volume":"79","author":"L.K. Grover","year":"1997","unstructured":"Grover, L.K.: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79, 325\u2013328 (1997) (quant-ph\/9706033)","journal-title":"Phys. Rev. Lett."},{"key":"10_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1103\/PhysRevA.67.052307","volume":"67","author":"N. Shenvi","year":"2003","unstructured":"Shenvi, N., Kempe, J., Whaley, K.B.: Quantum random walk search algorithm. Phys. Rev. A 67 (2003) 052307\/1-11 (quant-ph\/0210064)","journal-title":"Phys. Rev. A"},{"key":"10_CR12","unstructured":"Aaronson, S., Ambainis, A.: Quantum search of spatial regions. In: Proceedings of the 44th Annual Symposium on Foundations of Computer Science, Cambridge, MA, 11\u201314 October 2003, pp. 200\u2013209. IEEE, Los Alamitos, CA (2003) (quant-ph\/ 0303041)"},{"key":"10_CR13","doi-asserted-by":"crossref","first-page":"47","DOI":"10.4086\/toc.2005.v001a004","volume":"1","author":"S. Aaronson","year":"2005","unstructured":"Aaronson, S., Ambainis, A.: Quantum search of spatial regions. Theor. Comput. 1, 47\u201379 (2005)","journal-title":"Theor. Comput."},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Brassard, G., H\u00f8yer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. In: Lomonaco Jr, S.J., Brandt, H.E. (eds.) Quantum Computation and Information, Contemporary Mathematics, vol. 305, pp. 53\u201374. AMS, Providence, RI (2002) (quant-ph\/0005055)","DOI":"10.1090\/conm\/305\/05215"},{"key":"10_CR15","doi-asserted-by":"crossref","first-page":"7068","DOI":"10.1016\/j.tcs.2011.06.037","volume":"412","author":"D.A. Meyer","year":"2011","unstructured":"Meyer, D.A., Pommersheim, J.: On the uselessness of quantum queries. Theor. Comput. Sci. 412, 7068\u20137074 (2011) (arXiv:1004.1434, [quant-ph])","journal-title":"Theor. Comput. Sci."},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"van Dam, W.: Quantum oracle interrogation: getting all information for almost half the price. In: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, Palo Alto, CA, 8\u201311 November 1998, pp. 362\u2013367. IEEE, Los Alamitos, CA (1998) (quant-ph\/9805006)","DOI":"10.1109\/SFCS.1998.743486"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1023\/A:1019868924061","volume":"1","author":"M Hunziker","year":"2002","unstructured":"Hunziker, M., Meyer, D.A.: Quantum algorithms for highly structured search problems. Quantum Inf. Process. 1, 145\u2013154 (2002)","journal-title":"Quantum Inf. Process."},{"key":"10_CR18","first-page":"467","volume":"14","author":"W. Dam","year":"2014","unstructured":"van Dam, W., Seroussi, G., Efficient quantum algorithms for estimating Gauss sums. Quantum Inf. Comput. 14 (2014) 467\u2013492 (quant-ph\/0207131)","journal-title":"Quantum Inf. Comput."},{"key":"10_CR19","unstructured":"Shakeel, A.: An improved query for the hidden subgroup problem. (arXiv:1101.1053 [quant-ph])"},{"key":"10_CR20","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1109\/TIT.1975.1055351","volume":"-21","author":"H.P. Yuen","year":"1975","unstructured":"Yuen, H.P., Kennedy, R.S., Lax, M.: Optimum testing of multiple hypotheses in quantum detection theory. IEEE Trans. Inf. Theor. IT-21, 125\u2013134 (1975)","journal-title":"IEEE Trans. Inf. Theor. IT"},{"key":"10_CR21","unstructured":"Meyer, D.A., Pommersheim, J.: In preparation"}],"container-title":["Lecture Notes in Computer Science","Theory of Quantum Computation, Communication, and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54429-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T00:35:48Z","timestamp":1746146148000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-54429-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642544286","9783642544293"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54429-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"8 March 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}