{
  "annotation_id": "2065c125-d67f-42b2-a237-e546c9d363e1",
  "date_created": "2026-03-02T18:01:42.321000Z",
  "date_modified": "2026-03-02T18:01:42.321000Z",
  "file_hash": "864da57ba61ecc600b4470ba71e2235b09e2192ff11698adec95f54ea9ec9422",
  "private": false,
  "record": {
    "abstract": "This article is an attempt to generalize the classical theory of reversible\ncomputing, principally developed by Bennet [IBM J. Res. Develop., 17(1973)] and\nby Fredkin and Toffoli [Internat. J. Theoret. Phys., 21(1982)], to the quantum\ncase. This is a fundamental step towards the construction of a quantum computer\nbecause a time efficient quantum computation is a reversible physical process.\nThe paper is organized as follows. The first section reviews the classical\ntheory of reversible computing. In the second section it is showed that the\ndesigns used in the classical framework to decrease the consumption of space\ncannot be generalized to the quantum case; it is also suggested that quantum\ncomputing is generally more demanding of space than classical computing. In the\nlast section a new model of fully quantum and reversible automaton is proposed.\nThe computational power of this automaton is at least equal to that of\nclassical automata. Some conclusion are drawn in the last section.",
    "arxiv_id": "quant-ph/0102104",
    "authors": [
      "Massimo Pica Ciamarra"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Quantum reversibility and a new model of quantum automaton",
    "url": "https://arxiv.org/abs/quant-ph/0102104"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "014d99f8-a3cf-4d61-8b05-182cc734199e",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}