{
  "annotation_id": "6404c86f-e7ce-49ac-9f94-56cb1bc2a7dc",
  "date_created": "2026-03-02T18:01:59.605000Z",
  "date_modified": "2026-03-02T18:01:59.605000Z",
  "file_hash": "aa92507149cbdbd3e2f4f6b4db6f2e023436744bb01e05bad5ed346a42cf51a1",
  "private": false,
  "record": {
    "abstract": "In this paper we discuss an efficient technique that can implement any given\nBoolean function as a quantum circuit. The method converts a truth table of a\nBoolean function to the corresponding quantum circuit using a minimal number of\nauxiliary qubits. We give examples of some circuits synthesized with this\ntechnique. A direct result that follows from the technique is a new way to\nconvert any classical digital circuit to its classical reversible form.",
    "arxiv_id": "quant-ph/0304099",
    "authors": [
      "Ahmed Younes",
      "Julian Miller"
    ],
    "categories": [
      "quant-ph"
    ],
    "journal_ref": "In Proceeding of ICENCO2004 pp. 562- 565 (2004).",
    "title": "Automated Method for Building CNOT Based Quantum Circuits for Boolean   Functions",
    "url": "https://arxiv.org/abs/quant-ph/0304099"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "6ca57840-52b9-4037-a33b-e82a1335aa42",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}