On the Power of Quantum Algorithms for Vector Valued Mean Computation

Heinrich Stefan

Monte Carlo Methods and Applications, 2004, vol. 10, issue 3-4, 297-310

Abstract: We study computation of the mean of sequences with values in finite dimensional normed spaces and compare the computational power of classical randomized with that of quantum algorithms for this problem. It turns out that in contrast to the known superiority of quantum algorithms in the scalar case, in high dimensional LMP spaces classical randomized algorithms are essentially as powerful as quantum algorithms.

Date: 2004
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1515/mcma.2004.10.3-4.297 (text/html)
For access to full text, subscription to the journal or payment for the individual article is required.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bpj:mcmeap:v:10:y:2004:i:3-4:p:297-310:n:12

Ordering information: This journal article can be ordered from
https://www.degruyter.com/journal/key/mcma/html

DOI: 10.1515/mcma.2004.10.3-4.297

Access Statistics for this article

Monte Carlo Methods and Applications is currently edited by Karl K. Sabelfeld

More articles in Monte Carlo Methods and Applications from De Gruyter
Bibliographic data for series maintained by Peter Golla ().