{
  "annotation_id": "28717475-f587-4433-afe5-257bbdc8c528",
  "date_created": "2026-03-02T18:01:59.341000Z",
  "date_modified": "2026-03-02T18:01:59.341000Z",
  "file_hash": "1bdee7abdaf1f071d60297e32fb131fab4d79c7243710811bd6b451b74b22f65",
  "private": false,
  "record": {
    "abstract": "The fastest quantum algorithms (for the solution of classical computational\ntasks) known so far are basically variations of the hidden subgroup problem\nwith {$f(U[x])=f(x)$}. Following a discussion regarding which tasks might be\nsolved efficiently by quantum computers, it will be demonstrated by means of a\nsimple example, that the detection of more general hidden (two-point)\nsymmetries {$V\\{f(x),f(U[x])\\}=0$} by a quantum algorithm can also admit an\nexponential speed-up. E.g., one member of this class of symmetries\n{$V\\{f(x),f(U[x])\\}=0$} is discrete self-similarity (or discrete scale\ninvariance). PACS: 03.67.Lx, 89.70.+c.",
    "arxiv_id": "quant-ph/0304090",
    "authors": [
      "R. Sch\u00fctzhold",
      "W. G. Unruh"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Hidden symmetry detection on a quantum computer",
    "url": "https://arxiv.org/abs/quant-ph/0304090"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "49766649-c943-45c7-b189-60999d2fa0fc",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}