{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:IL456JOJCYGCJQ4WVG3NFV5I5C","short_pith_number":"pith:IL456JOJ","schema_version":"1.0","canonical_sha256":"42f9df25c9160c24c396a9b6d2d7a8e89355f0802b006308d88558cd25cc70bd","source":{"kind":"arxiv","id":"quant-ph/0406142","version":1},"attestation_state":"computed","paper":{"title":"A logarithmic-depth quantum carry-lookahead adder","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Eric M. Rains, Krysta M. Svore, Samuel A. Kutin, Thomas G. Draper","submitted_at":"2004-06-20T21:52:48Z","abstract_excerpt":"We present an efficient addition circuit, borrowing techniques from the classical carry-lookahead arithmetic circuit. Our quantum carry-lookahead (QCLA) adder accepts two n-bit numbers and adds them in O(log n) depth using O(n) ancillary qubits. We present both in-place and out-of-place versions, as well as versions that add modulo 2^n and modulo 2^n - 1.\n  Previously, the linear-depth ripple-carry addition circuit has been the method of choice. Our work reduces the cost of addition dramatically with only a slight increase in the number of required qubits. The QCLA adder can be used within cur"},"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":"quant-ph/0406142","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2004-06-20T21:52:48Z","cross_cats_sorted":[],"title_canon_sha256":"9ffa91b27d8465dad6de8945dd79048157ac040272dfcaa675324c6e2e1283d1","abstract_canon_sha256":"c1bf83db45de8723ace2999eb4a3759886db5ec38667519d06975dc1abb77825"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:14.287561Z","signature_b64":"y1MUO1iqicK3CBOrdyYQRpCuGB6rCHE9iPx9hrJX9vYK1J3eMfCPjqCRm3TJbx5UpIhBZtgo8nD5q2KKZBv7BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42f9df25c9160c24c396a9b6d2d7a8e89355f0802b006308d88558cd25cc70bd","last_reissued_at":"2026-05-18T03:29:14.287006Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:14.287006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A logarithmic-depth quantum carry-lookahead adder","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Eric M. Rains, Krysta M. Svore, Samuel A. Kutin, Thomas G. Draper","submitted_at":"2004-06-20T21:52:48Z","abstract_excerpt":"We present an efficient addition circuit, borrowing techniques from the classical carry-lookahead arithmetic circuit. Our quantum carry-lookahead (QCLA) adder accepts two n-bit numbers and adds them in O(log n) depth using O(n) ancillary qubits. We present both in-place and out-of-place versions, as well as versions that add modulo 2^n and modulo 2^n - 1.\n  Previously, the linear-depth ripple-carry addition circuit has been the method of choice. Our work reduces the cost of addition dramatically with only a slight increase in the number of required qubits. The QCLA adder can be used within cur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0406142","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":"quant-ph/0406142","created_at":"2026-05-18T03:29:14.287079+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0406142v1","created_at":"2026-05-18T03:29:14.287079+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0406142","created_at":"2026-05-18T03:29:14.287079+00:00"},{"alias_kind":"pith_short_12","alias_value":"IL456JOJCYGC","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_16","alias_value":"IL456JOJCYGCJQ4W","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_8","alias_value":"IL456JOJ","created_at":"2026-05-18T12:25:52.687210+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2507.20317","citing_title":"Efficient Gaussian State Preparation in Quantum Circuits","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"2510.19062","citing_title":"Simulating high-accuracy nuclear motion Hamiltonians using discrete variable representation and Walsh-Hadamard QROM on fault-tolerant quantum computers","ref_index":180,"is_internal_anchor":true},{"citing_arxiv_id":"2603.12405","citing_title":"Explicit Block Encodings of Discrete Laplacians with Mixed Boundary Conditions","ref_index":27,"is_internal_anchor":true},{"citing_arxiv_id":"2409.17595","citing_title":"Magic state cultivation: growing T states as cheap as CNOT gates","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19481","citing_title":"Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture","ref_index":199,"is_internal_anchor":false},{"citing_arxiv_id":"2604.09538","citing_title":"Explicit Block Encoding of Difference-of-Gaussian Operators on a Periodic Grid","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2604.09847","citing_title":"A Polylogarithmic-Depth Quantum Multiplier","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19319","citing_title":"An Oracle-Free Quantum Algorithm for Nonadiabatic Quantum Molecular Dynamics","ref_index":246,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IL456JOJCYGCJQ4WVG3NFV5I5C","json":"https://pith.science/pith/IL456JOJCYGCJQ4WVG3NFV5I5C.json","graph_json":"https://pith.science/api/pith-number/IL456JOJCYGCJQ4WVG3NFV5I5C/graph.json","events_json":"https://pith.science/api/pith-number/IL456JOJCYGCJQ4WVG3NFV5I5C/events.json","paper":"https://pith.science/paper/IL456JOJ"},"agent_actions":{"view_html":"https://pith.science/pith/IL456JOJCYGCJQ4WVG3NFV5I5C","download_json":"https://pith.science/pith/IL456JOJCYGCJQ4WVG3NFV5I5C.json","view_paper":"https://pith.science/paper/IL456JOJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0406142&json=true","fetch_graph":"https://pith.science/api/pith-number/IL456JOJCYGCJQ4WVG3NFV5I5C/graph.json","fetch_events":"https://pith.science/api/pith-number/IL456JOJCYGCJQ4WVG3NFV5I5C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IL456JOJCYGCJQ4WVG3NFV5I5C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IL456JOJCYGCJQ4WVG3NFV5I5C/action/storage_attestation","attest_author":"https://pith.science/pith/IL456JOJCYGCJQ4WVG3NFV5I5C/action/author_attestation","sign_citation":"https://pith.science/pith/IL456JOJCYGCJQ4WVG3NFV5I5C/action/citation_signature","submit_replication":"https://pith.science/pith/IL456JOJCYGCJQ4WVG3NFV5I5C/action/replication_record"}},"created_at":"2026-05-18T03:29:14.287079+00:00","updated_at":"2026-05-18T03:29:14.287079+00:00"}