{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VQOKBMKXPTZNG2OYEYDRPSQK56","short_pith_number":"pith:VQOKBMKX","schema_version":"1.0","canonical_sha256":"ac1ca0b1577cf2d369d8260717ca0aefabb51e2acfa1fc4ebfeadba0951773bb","source":{"kind":"arxiv","id":"2501.16802","version":2},"attestation_state":"computed","paper":{"title":"Ancilla-free Quantum Adder with Sublinear Depth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"quant-ph","authors_text":"Maxime Remaud, Vivien Vandaele","submitted_at":"2025-01-28T09:05:49Z","abstract_excerpt":"We present the first exact quantum adder with sublinear depth and no ancilla qubits. Our construction is based on classical reversible logic only and employs low-depth implementations for the CNOT ladder operator and the Toffoli ladder operator, two key components to perform ripple-carry addition. Namely, we demonstrate that any ladder of $n$ CNOT gates can be replaced by a CNOT-circuit with $O(\\log n)$ depth, while maintaining a linear number of gates. We then generalize this construction to Toffoli gates and demonstrate that any ladder of $n$ Toffoli gates can be substituted with a circuit w"},"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":"2501.16802","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-01-28T09:05:49Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e1c7267e9e4d4b9723cd2e219a7802bd25fa95dd32ae62833fd97ac30b2be8c1","abstract_canon_sha256":"d304e7a92eaf889df518839db1b266e807a3eddfe676c0997f153623d9eb2625"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:46:38.588769Z","signature_b64":"onGvZ83faYOp8i6e9vSUq3yHbgM9DGNGw4gs2ADiCZac8QbHdU+9a6o45bXFvkdDhp28Zr/ruo2LactnL5fODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac1ca0b1577cf2d369d8260717ca0aefabb51e2acfa1fc4ebfeadba0951773bb","last_reissued_at":"2026-07-05T11:46:38.588162Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:46:38.588162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ancilla-free Quantum Adder with Sublinear Depth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"quant-ph","authors_text":"Maxime Remaud, Vivien Vandaele","submitted_at":"2025-01-28T09:05:49Z","abstract_excerpt":"We present the first exact quantum adder with sublinear depth and no ancilla qubits. Our construction is based on classical reversible logic only and employs low-depth implementations for the CNOT ladder operator and the Toffoli ladder operator, two key components to perform ripple-carry addition. Namely, we demonstrate that any ladder of $n$ CNOT gates can be replaced by a CNOT-circuit with $O(\\log n)$ depth, while maintaining a linear number of gates. We then generalize this construction to Toffoli gates and demonstrate that any ladder of $n$ Toffoli gates can be substituted with a circuit w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.16802","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.16802/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2501.16802","created_at":"2026-07-05T11:46:38.588233+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.16802v2","created_at":"2026-07-05T11:46:38.588233+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.16802","created_at":"2026-07-05T11:46:38.588233+00:00"},{"alias_kind":"pith_short_12","alias_value":"VQOKBMKXPTZN","created_at":"2026-07-05T11:46:38.588233+00:00"},{"alias_kind":"pith_short_16","alias_value":"VQOKBMKXPTZNG2OY","created_at":"2026-07-05T11:46:38.588233+00:00"},{"alias_kind":"pith_short_8","alias_value":"VQOKBMKX","created_at":"2026-07-05T11:46:38.588233+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.00400","citing_title":"Logarithmic Depth Decomposition of Approximate Multi-Controlled Single-Qubit Gates Without Ancilla Qubits","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VQOKBMKXPTZNG2OYEYDRPSQK56","json":"https://pith.science/pith/VQOKBMKXPTZNG2OYEYDRPSQK56.json","graph_json":"https://pith.science/api/pith-number/VQOKBMKXPTZNG2OYEYDRPSQK56/graph.json","events_json":"https://pith.science/api/pith-number/VQOKBMKXPTZNG2OYEYDRPSQK56/events.json","paper":"https://pith.science/paper/VQOKBMKX"},"agent_actions":{"view_html":"https://pith.science/pith/VQOKBMKXPTZNG2OYEYDRPSQK56","download_json":"https://pith.science/pith/VQOKBMKXPTZNG2OYEYDRPSQK56.json","view_paper":"https://pith.science/paper/VQOKBMKX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.16802&json=true","fetch_graph":"https://pith.science/api/pith-number/VQOKBMKXPTZNG2OYEYDRPSQK56/graph.json","fetch_events":"https://pith.science/api/pith-number/VQOKBMKXPTZNG2OYEYDRPSQK56/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VQOKBMKXPTZNG2OYEYDRPSQK56/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VQOKBMKXPTZNG2OYEYDRPSQK56/action/storage_attestation","attest_author":"https://pith.science/pith/VQOKBMKXPTZNG2OYEYDRPSQK56/action/author_attestation","sign_citation":"https://pith.science/pith/VQOKBMKXPTZNG2OYEYDRPSQK56/action/citation_signature","submit_replication":"https://pith.science/pith/VQOKBMKXPTZNG2OYEYDRPSQK56/action/replication_record"}},"created_at":"2026-07-05T11:46:38.588233+00:00","updated_at":"2026-07-05T11:46:38.588233+00:00"}