{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T17:12:33Z","timestamp":1756573953839},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3855,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Complexity"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s0885-064x(02)00003-1","type":"journal-article","created":{"date-parts":[[2003,1,30]],"date-time":"2003-01-30T17:32:20Z","timestamp":1043947940000},"page":"1-18","source":"Crossref","is-referenced-by-count":23,"title":["On a problem in quantum summation"],"prefix":"10.1016","volume":"19","author":[{"given":"Stefan","family":"Heinrich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erich","family":"Novak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0885-064X(02)00003-1_BIB1","unstructured":"D.S. Abrams, C.P. Williams, Fast quantum algorithms for numerical integrals and stochastic processes, Technical Report, 1999, http:\/\/arXiv.org\/abs\/quant-ph\/9908083."},{"key":"10.1016\/S0885-064X(02)00003-1_BIB2","doi-asserted-by":"crossref","unstructured":"R. Beals, H. Buhrman, R. Cleve, M. Mosca, R. de Wolf, Quantum lower bounds by polynomials, Proceedings of 39th IEEE FOCS, 1998, pp. 352\u2013361, see also http:\/\/arXiv.org\/abs\/quant-ph\/9802049.","DOI":"10.1109\/SFCS.1998.743485"},{"key":"10.1016\/S0885-064X(02)00003-1_BIB3","unstructured":"G. Brassard, P. H\u00f8yer, M. Mosca, A. Tapp, Quantum amplitude amplification and estimation, Technical Report, 2000, http:\/\/arXiv.org\/abs\/quant-ph\/0005055."},{"key":"10.1016\/S0885-064X(02)00003-1_BIB4","doi-asserted-by":"crossref","unstructured":"A. Ekert, P. Hayden, H. Inamori, Basic concepts in quantum computation, 2000, see http:\/\/arXiv.org\/abs\/quant-ph\/0011013.","DOI":"10.1142\/9789812811264_0016"},{"key":"10.1016\/S0885-064X(02)00003-1_BIB5","doi-asserted-by":"crossref","unstructured":"L. Grover, A fast quantum mechanical algorithm for database search, Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, ACM Press, New York, 1996, pp. 212\u2013219, see also http:\/\/arXiv.org\/abs\/quant-ph\/9605043.","DOI":"10.1145\/237814.237866"},{"key":"10.1016\/S0885-064X(02)00003-1_BIB6","doi-asserted-by":"crossref","unstructured":"L. Grover, A framework for fast quantum mechanical algorithms, Proceedings of the 30th Annual ACM Symposium on the Theory of Computing, ACM Press, New York, 1998, pp. 53\u201362, see also http:\/\/arXiv.org\/abs\/quant-ph\/9711043.","DOI":"10.1145\/276698.276712"},{"key":"10.1016\/S0885-064X(02)00003-1_BIB7","series-title":"Quantum Computing","author":"Gruska","year":"1999"},{"key":"10.1016\/S0885-064X(02)00003-1_BIB8","doi-asserted-by":"crossref","unstructured":"S. Heinrich, Quantum summation with an application to integration, J. Complexity 18 (2002) 1\u201350, see also http:\/\/arXiv.org\/abs\/quant-ph\/0105116.","DOI":"10.1006\/jcom.2001.0629"},{"key":"10.1016\/S0885-064X(02)00003-1_BIB9","doi-asserted-by":"crossref","unstructured":"S. Heinrich, Quantum integration in Sobolev classes, J. Complexity 19 (2003) 19\u201342, see also http:\/\/arXiv.org\/abs\/quant-ph\/0112153.","DOI":"10.1016\/S0885-064X(02)00008-0"},{"key":"10.1016\/S0885-064X(02)00003-1_BIB10","doi-asserted-by":"crossref","unstructured":"S. Heinrich, E. Novak, Optimal summation and integration by deterministic, randomized, and quantum algorithms, in: K.-T. Fang, F.J. Hickernell, H. Niederreiter (Eds.), Monte Carlo and Quasi-Monte Carlo Methods 2000, Springer, Berlin, 2002, pp. 50\u201362, see also http:\/\/arXiv.org\/abs\/quant-ph\/0105114.","DOI":"10.1007\/978-3-642-56046-0_4"},{"key":"10.1016\/S0885-064X(02)00003-1_BIB11","doi-asserted-by":"crossref","unstructured":"A. Nayak, F. Wu, The quantum query complexity of approximating the median and related statistics, STOC, May 1999, pp. 384\u2013393, see also http:\/\/arXiv.org\/abs\/quant-ph\/9804066.","DOI":"10.1145\/301250.301349"},{"key":"10.1016\/S0885-064X(02)00003-1_BIB12","series-title":"Quantum Computation and Quantum Information","author":"Nielsen","year":"2000"},{"key":"10.1016\/S0885-064X(02)00003-1_BIB13","doi-asserted-by":"crossref","unstructured":"E. Novak, Deterministic and Stochastic Error Bounds in Numerical Analysis, Lecture Notes in Mathematics, Vol. 1349, Springer, Berlin, 1988.","DOI":"10.1007\/BFb0079792"},{"key":"10.1016\/S0885-064X(02)00003-1_BIB14","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1006\/jcom.1995.1002","article-title":"The real number model in numerical analysis","volume":"11","author":"Novak","year":"1995","journal-title":"J Complexity"},{"key":"10.1016\/S0885-064X(02)00003-1_BIB15","doi-asserted-by":"crossref","unstructured":"E. Novak, Quantum complexity of integration, J. Complexity 17 (2001) 2\u201316, see also http:\/\/arXiv.org\/abs\/quant-ph\/0008124.","DOI":"10.1006\/jcom.2000.0566"},{"key":"10.1016\/S0885-064X(02)00003-1_BIB16","series-title":"Introduction to Quantum Computing Algorithms","author":"Pittenger","year":"1999"},{"key":"10.1016\/S0885-064X(02)00003-1_BIB17","unstructured":"P.W. Shor, Introduction to Quantum Algorithms, 2000, see http:\/\/arXiv.org\/abs\/quant-ph\/0005003."},{"key":"10.1016\/S0885-064X(02)00003-1_BIB18","unstructured":"J.F. Traub, H. Wo\u017aniakowski, Path integration on a quantum computer, 2001, see http:\/\/arXiv.org\/abs\/quant-ph\/0109113."},{"key":"10.1016\/S0885-064X(02)00003-1_BIB19","series-title":"Information-Based Complexity","author":"Traub","year":"1988"}],"container-title":["Journal of Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0885064X02000031?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0885064X02000031?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T18:48:14Z","timestamp":1682448494000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0885064X02000031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S0885064X02000031"],"URL":"https:\/\/doi.org\/10.1016\/s0885-064x(02)00003-1","relation":{},"ISSN":["0885-064X"],"issn-type":[{"value":"0885-064X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}