arXiv Analytics

Sign in

arXiv:1106.4267 [quant-ph]AbstractReferencesReviewsResources

An optimal quantum algorithm to approximate the mean and its application for approximating the median of a set of points over an arbitrary distance

Gilles Brassard, Frederic Dupuis, Sebastien Gambs, Alain Tapp

Published 2011-06-21Version 1

We describe two quantum algorithms to approximate the mean value of a black-box function. The first algorithm is novel and asymptotically optimal while the second is a variation on an earlier algorithm due to Aharonov. Both algorithms have their own strengths and caveats and may be relevant in different contexts. We then propose a new algorithm for approximating the median of a set of points over an arbitrary distance function.

Comments: Ten pages, no figures, three algorithms
Categories: quant-ph, cs.DS
Related articles: Most relevant | Search more
arXiv:1201.1389 [quant-ph] (Published 2012-01-06)
Huygens-Fresnel-Kirchhoff construction for quantum propagators with application to diffraction in space and time
arXiv:quant-ph/0502074 (Published 2005-02-12, updated 2005-10-01)
Riccati nonhermiticity with application to the Morse potential
arXiv:1101.3011 [quant-ph] (Published 2011-01-15)
The Dirac-Moshinsky Oscillator: Theory and Applications