{
  "annotation_id": "1ce699b1-3b50-426b-8601-0cafc1c88063",
  "date_created": "2026-03-02T18:02:00.150000Z",
  "date_modified": "2026-03-02T18:02:00.150000Z",
  "file_hash": "ff0458e1fbc1a931ef8d46854b2716c0bbc305d68f1f7bc687e75cbfcc385193",
  "private": false,
  "record": {
    "abstract": "In this paper we show that there is a direct correspondence between quantum\nBoolean operations and certain forms of classical (non-quantum) logic known as\nReed-Muller expansions. This allows us to readily convert Boolean circuits into\ntheir quantum equivalents. A direct result of this is that the problem of\nsynthesis and optimization of quantum Boolean logic can be tackled within the\nfield of Reed-Muller logic.",
    "arxiv_id": "quant-ph/0305134",
    "authors": [
      "Ahmed Younes",
      "Julian Miller"
    ],
    "categories": [
      "quant-ph"
    ],
    "journal_ref": "International Journal of Electronics. Vol.(No.7)pp. 431-444 (2004)",
    "title": "Representation of Boolean Quantum Circuits as Reed-Muller Expansions",
    "url": "https://arxiv.org/abs/quant-ph/0305134"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "d0176b82-7907-43e8-8fc5-9f3ee1971b2a",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}