{
  "annotation_id": "23e2da1b-5ca4-4559-a86c-ac5c367c1440",
  "date_created": "2026-03-02T18:01:42.068000Z",
  "date_modified": "2026-03-02T18:01:42.068000Z",
  "file_hash": "922d14f679bb9af7c5d970a86cbff11c7d4d711294fb60874db77892b7d58bd0",
  "private": false,
  "record": {
    "abstract": "In this paper we show that certain special cases of the hidden subgroup\nproblem can be solved in polynomial time by a quantum algorithm. These special\ncases involve finding hidden normal subgroups of solvable groups and\npermutation groups, finding hidden subgroups of groups with small commutator\nsubgroup and of groups admitting an elementary Abelian normal 2-subgroup of\nsmall index or with cyclic factor group.",
    "arxiv_id": "quant-ph/0102014",
    "authors": [
      "Gabor Ivanyos",
      "Frederic Magniez",
      "Miklos Santha"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Efficient quantum algorithms for some instances of the non-Abelian   hidden subgroup problem",
    "url": "https://arxiv.org/abs/quant-ph/0102014"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "49ac12c5-168a-458e-9aae-e192d9f437b7",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}