{
  "annotation_id": "af36f329-5f39-46f6-98c6-bf011d92aae3",
  "date_created": "2026-03-02T18:01:42.366000Z",
  "date_modified": "2026-03-02T18:01:42.366000Z",
  "file_hash": "9e03c638dba3544ee25e6874deb17230eeb7e38344fb3c3bbd3df225fa3f18ef",
  "private": false,
  "record": {
    "abstract": "To build a general-purpose quantum computer, it is crucial for the quantum\ndevices to implement classical boolean logic. A straightforward realization of\nquantum boolean logic is to use auxiliary qubits as intermediate storage. This\ninefficient implementation causes a large number of auxiliary qubits to be\nused. In this paper, we have derived a systematic way of realizing any general\nm-to-n bit combinational boolean logic using elementary quantum gates. Our\napproach transforms the m-to-n bit classical mapping into a t-bit unitary\nquantum operation with minimum number of auxiliary qubits, then a variation of\nToffoli gate is used as the basic building block to construct the unitary\noperation. Finally, each of these building blocks can be decomposed into\none-bit rotation and two-bit control-U gates. The efficiency of the network is\ntaken into consideration by formulating it as a constrained set partitioning\nproblem.",
    "arxiv_id": "quant-ph/0104037",
    "authors": [
      "I. M. Tsai",
      "S. Y. Kuo"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "A Systematic Algorithm for Quantum Boolean Circuits Construction",
    "url": "https://arxiv.org/abs/quant-ph/0104037"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "9abb1e70-3b47-4e71-9bd7-24b6768d3cc6",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}