{
  "id": "quant-ph/0404067",
  "version": "v1",
  "published": "2004-04-11T19:50:40.000Z",
  "updated": "2004-04-11T19:50:40.000Z",
  "title": "A Note on the Quantum Query Complexity of the Hidden Subgroup Problem",
  "authors": [
    "Troels Windfeldt"
  ],
  "comment": "11 pages",
  "categories": [
    "quant-ph"
  ],
  "abstract": "We are concerned with the Hidden Subgroup Problem for finite groups. We present a simplified analysis of a quantum algorithm proposed by Hallgren, Russell and Ta-Shma as well as a detailed proof of a lower bound on the probability of success of the algorithm.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2004-04-11T19:50:40.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "hidden subgroup problem",
      "quantum query complexity",
      "finite groups",
      "quantum algorithm",
      "lower bound"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 11,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2004quant.ph..4067W"
    }
  }
}