{
  "annotation_id": "22360f45-89d4-4384-9186-7a5f69c143a8",
  "date_created": "2026-03-02T18:02:23.738000Z",
  "date_modified": "2026-03-02T18:02:23.738000Z",
  "file_hash": "c1699ae9963f89a1908b3a1e4b65f28ccff59ab015a675f81c6b74a7d8978514",
  "private": false,
  "record": {
    "abstract": "We propose a probabilistic quantum algorithm that decides whether a\nmonochrome picture matches a given template (or one out of a set of templates).\nAs a major advantage to classical pattern recognition, the algorithm just\nrequires a few incident photons and is thus suitable for very sensitive\npictures (similar to the Elitzur-Vaidman problem). Furthermore, for a\n$2^{n}\\times 2^{m}$ image, $\\ord(n+m)$ qubits are sufficient. Using the quantum\nFourier transform, it is possible to improve the fault tolerance of the quantum\nalgorithm by filtering out small-scale noise in the picture. For example images\nwith $512\\times512$ pixels, we have numerically simulated the unitary\noperations in order to demonstrate the applicability of the algorithm and to\nanalyze its fault tolerance.",
    "arxiv_id": "quant-ph/0512057",
    "authors": [
      "Gernot Schaller",
      "Ralf Sch\u00fctzhold"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.74.012303",
    "journal_ref": "Physical Review A 74, 012303 and Virtual Journal of Quantum\n  Information 6(7), (2006)",
    "title": "Quantum algorithm for optical template recognition with noise filtering",
    "url": "https://arxiv.org/abs/quant-ph/0512057"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "529ccd22-bc2a-4a01-b8c9-7bd43b4e221e",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}