{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:HBXGNX5SVGVFV2KMM566CA6F3S","short_pith_number":"pith:HBXGNX5S","schema_version":"1.0","canonical_sha256":"386e66dfb2a9aa5ae94c677de103c5dc8ac4c874dc580d204a85fa85ac6e4bdf","source":{"kind":"arxiv","id":"0910.2530","version":1},"attestation_state":"computed","paper":{"title":"Quantum Addition Circuits and Unbounded Fan-Out","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Noboru Kunihiro, Seiichiro Tani, Yasuhiro Takahashi","submitted_at":"2009-10-14T06:24:40Z","abstract_excerpt":"We first show how to construct an O(n)-depth O(n)-size quantum circuit for addition of two n-bit binary numbers with no ancillary qubits. The exact size is 7n-6, which is smaller than that of any other quantum circuit ever constructed for addition with no ancillary qubits. Using the circuit, we then propose a method for constructing an O(d(n))-depth O(n)-size quantum circuit for addition with O(n/d(n)) ancillary qubits for any d(n)=\\Omega(log n). If we are allowed to use unbounded fan-out gates with length O(n^c) for an arbitrary small positive constant c, we can modify the method and construc"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"0910.2530","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-10-14T06:24:40Z","cross_cats_sorted":[],"title_canon_sha256":"6c54392c758963852a9502d51e595901fc8691a325eb2f4ce898e129836da5e3","abstract_canon_sha256":"ab7d8605636f60a7c3349bd366d26a359904d065035b11eec232daf21a999cf9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:54.869986Z","signature_b64":"CLZSWaxC2J1Cux9EPZtSLvxmYuCoOJOfN4RLML7Inout/8Rb2c77kyFwRoOsw1epkSn0JAOvWpKMO2yHVZTUBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"386e66dfb2a9aa5ae94c677de103c5dc8ac4c874dc580d204a85fa85ac6e4bdf","last_reissued_at":"2026-05-18T04:19:54.869345Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:54.869345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Addition Circuits and Unbounded Fan-Out","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Noboru Kunihiro, Seiichiro Tani, Yasuhiro Takahashi","submitted_at":"2009-10-14T06:24:40Z","abstract_excerpt":"We first show how to construct an O(n)-depth O(n)-size quantum circuit for addition of two n-bit binary numbers with no ancillary qubits. The exact size is 7n-6, which is smaller than that of any other quantum circuit ever constructed for addition with no ancillary qubits. Using the circuit, we then propose a method for constructing an O(d(n))-depth O(n)-size quantum circuit for addition with O(n/d(n)) ancillary qubits for any d(n)=\\Omega(log n). If we are allowed to use unbounded fan-out gates with length O(n^c) for an arbitrary small positive constant c, we can modify the method and construc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.2530","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"0910.2530","created_at":"2026-05-18T04:19:54.869441+00:00"},{"alias_kind":"arxiv_version","alias_value":"0910.2530v1","created_at":"2026-05-18T04:19:54.869441+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.2530","created_at":"2026-05-18T04:19:54.869441+00:00"},{"alias_kind":"pith_short_12","alias_value":"HBXGNX5SVGVF","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"HBXGNX5SVGVFV2KM","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"HBXGNX5S","created_at":"2026-05-18T12:25:59.703012+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.14434","citing_title":"Quantum CORDIC -- Arcsine on a Budget","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HBXGNX5SVGVFV2KMM566CA6F3S","json":"https://pith.science/pith/HBXGNX5SVGVFV2KMM566CA6F3S.json","graph_json":"https://pith.science/api/pith-number/HBXGNX5SVGVFV2KMM566CA6F3S/graph.json","events_json":"https://pith.science/api/pith-number/HBXGNX5SVGVFV2KMM566CA6F3S/events.json","paper":"https://pith.science/paper/HBXGNX5S"},"agent_actions":{"view_html":"https://pith.science/pith/HBXGNX5SVGVFV2KMM566CA6F3S","download_json":"https://pith.science/pith/HBXGNX5SVGVFV2KMM566CA6F3S.json","view_paper":"https://pith.science/paper/HBXGNX5S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0910.2530&json=true","fetch_graph":"https://pith.science/api/pith-number/HBXGNX5SVGVFV2KMM566CA6F3S/graph.json","fetch_events":"https://pith.science/api/pith-number/HBXGNX5SVGVFV2KMM566CA6F3S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HBXGNX5SVGVFV2KMM566CA6F3S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HBXGNX5SVGVFV2KMM566CA6F3S/action/storage_attestation","attest_author":"https://pith.science/pith/HBXGNX5SVGVFV2KMM566CA6F3S/action/author_attestation","sign_citation":"https://pith.science/pith/HBXGNX5SVGVFV2KMM566CA6F3S/action/citation_signature","submit_replication":"https://pith.science/pith/HBXGNX5SVGVFV2KMM566CA6F3S/action/replication_record"}},"created_at":"2026-05-18T04:19:54.869441+00:00","updated_at":"2026-05-18T04:19:54.869441+00:00"}