{
  "annotation_id": "28a61206-4b89-498f-b1db-a1aca60a8dd9",
  "date_created": "2026-03-02T18:02:16.218000Z",
  "date_modified": "2026-03-02T18:02:16.218000Z",
  "file_hash": "3eccb6c35ed40aa356563b4f9decc65412923ddaccdc76278145f793e6bc6bf1",
  "private": false,
  "record": {
    "abstract": "This paper considers the realizability of quantum gates from the perspective\nof information complexity. Since the gate is a physical device that must be\ncontrolled classically, it is subject to random error. We define the complexity\nof gate operation in terms of the difference between the entropy of the\nvariables associated with initial and final states of the computation. We argue\nthat the gate operations are irreversible if there is a difference in the\naccuracy associated with input and output variables. It is shown that under\nsome conditions the gate operation may be associated with unbounded entropy,\nimplying impossibility of implementation.",
    "arxiv_id": "quant-ph/0506013",
    "authors": [
      "Subhash Kak"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1007/s10773-006-9086-3",
    "journal_ref": "Int. Journal of Theoretical Physics, vol. 45, pp. 933-941, 2006",
    "title": "Information Complexity of Quantum Gates",
    "url": "https://arxiv.org/abs/quant-ph/0506013"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "5a9e52c5-3b3f-45e9-8b05-953672472742",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}