{
  "id": "1106.4267",
  "version": "v1",
  "published": "2011-06-21T17:14:46.000Z",
  "updated": "2011-06-21T17:14:46.000Z",
  "title": "An optimal quantum algorithm to approximate the mean and its application for approximating the median of a set of points over an arbitrary distance",
  "authors": [
    "Gilles Brassard",
    "Frederic Dupuis",
    "Sebastien Gambs",
    "Alain Tapp"
  ],
  "comment": "Ten pages, no figures, three algorithms",
  "categories": [
    "quant-ph",
    "cs.DS"
  ],
  "abstract": "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2011-06-21T17:14:46.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "optimal quantum algorithm",
      "approximate",
      "application",
      "arbitrary distance function",
      "approximating"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2011arXiv1106.4267B"
    }
  }
}