{
  "id": "quant-ph/0701235",
  "version": "v1",
  "published": "2007-01-31T01:07:52.000Z",
  "updated": "2007-01-31T01:07:52.000Z",
  "title": "An efficient quantum algorithm for the hidden subgroup problem in extraspecial groups",
  "authors": [
    "Gábor Ivanyos",
    "Luc Sanselme",
    "Miklos Santha"
  ],
  "comment": "10 pages",
  "journal": "stacs 2007",
  "categories": [
    "quant-ph"
  ],
  "abstract": "Extraspecial groups form a remarkable subclass of p-groups. They are also present in quantum information theory, in particular in quantum error correction. We give here a polynomial time quantum algorithm for finding hidden subgroups in extraspecial groups. Our approach is quite different from the recent algorithms presented in [17] and [2] for the Heisenberg group, the extraspecial p-group of size p3 and exponent p. Exploiting certain nice automorphisms of the extraspecial groups we define specific group actions which are used to reduce the problem to hidden subgroup instances in abelian groups that can be dealt with directly.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2007-01-31T01:07:52.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "hidden subgroup problem",
      "efficient quantum algorithm",
      "polynomial time quantum algorithm",
      "define specific group actions",
      "quantum error correction"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 10,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2007quant.ph..1235I"
    }
  }
}