{
  "annotation_id": "7e35e71d-bc5a-4182-bbc4-cb3e7004c81b",
  "date_created": "2026-03-02T18:01:52.242000Z",
  "date_modified": "2026-03-02T18:01:52.242000Z",
  "file_hash": "40493548a099460eac00e4361a7c2a3bec0df8fd80b28e55e4be3bdda075515d",
  "private": false,
  "record": {
    "abstract": "In this paper, two quantum networks for the addition operation are presented.\nOne is the Modified Quantum Plain (MQP) adder, and the other is the Quantum\nCarry Look-Ahead (QCLA) adder. The MQP adder is obtained by modifying the\nConventional Quantum Plain (CQP) adder. The QCLA adder is an extension of\nconventional digital Carry Look-Ahead adder. Compared with the CQP adder, two\nmain advantages are as follows: First, the proposed MQP and QCLA adders have\nless number of elementary gates than the CQP adder. Secondly, the number of\nprocessing stages of the MQP and QCLA adder are less than ones of the CQP\nadder. As a result, the throughput time for computing the sum of two numbers on\nthe quantum computer can be improved.",
    "arxiv_id": "quant-ph/0206028",
    "authors": [
      "Kai-Wen Cheng",
      "Chien-Cheng Tseng"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Quantum Plain and Carry Look-Ahead Adders",
    "url": "https://arxiv.org/abs/quant-ph/0206028"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "2cbd474f-a690-4754-98d1-5defec743408",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}