On the Power of Quantum Algorithms for Vector Valued Mean Computation

Simple item page
dc.creatorHeinrich, Stefan
dc.date2004-03-15
dc.date.accessioned2026-07-07T06:09:18Z
dc.date.available2026-07-07T06:09:18Z
dc.descriptionWe 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 $L_p^M$ spaces classical randomized algorithms are essentially as powerful as quantum algorithms.
dc.descriptionPaper submitted to 'Monte Carlo Methods and Applications', 18 pages
dc.identifierhttps://arxiv.org/abs/quant-ph/0403109
dc.identifierhttp://arxiv.org/abs/quant-ph/0403109
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/91916
dc.subjectQuantum Physics
dc.titleOn the Power of Quantum Algorithms for Vector Valued Mean Computation
dc.typetext

Files

Collections

arXiv