{
  "id": "quant-ph/9812070",
  "version": "v1",
  "published": "1998-12-24T00:27:39.000Z",
  "updated": "1998-12-24T00:27:39.000Z",
  "title": "Polynomial-Time Solution to the Hidden Subgroup Problem for a Class of non-abelian Groups",
  "authors": [
    "Martin Roetteler",
    "Thomas Beth"
  ],
  "comment": "16 pages, LaTeX2e, 3 figures",
  "categories": [
    "quant-ph"
  ],
  "abstract": "We present a family of non-abelian groups for which the hidden subgroup problem can be solved efficiently on a quantum computer.",
  "revisions": [
    {
      "version": "v1",
      "updated": "1998-12-24T00:27:39.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "hidden subgroup problem",
      "non-abelian groups",
      "polynomial-time solution",
      "quantum computer"
    ],
    "note": {
      "typesetting": "LaTeX",
      "pages": 16,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "inspire": 481451,
      "adsabs": "1998quant.ph.12070R"
    }
  }
}