{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2000:BUZYCIW4NMN56JAPO4TWNKHZN3","short_pith_number":"pith:BUZYCIW4","schema_version":"1.0","canonical_sha256":"0d338122dc6b1bdf240f772766a8f96ec5906bb071da14ac2eb5a378f3eae93b","source":{"kind":"arxiv","id":"quant-ph/0008033","version":1},"attestation_state":"computed","paper":{"title":"Addition on a Quantum Computer","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Thomas G. Draper","submitted_at":"2000-08-07T13:28:27Z","abstract_excerpt":"A new method for computing sums on a quantum computer is introduced. This technique uses the quantum Fourier transform and reduces the number of qubits necessary for addition by removing the need for temporary carry bits. This approach also allows the addition of a classical number to a quantum superposition without encoding the classical number in the quantum register. This method also allows for massive parallelization in its execution."},"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/0008033","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2000-08-07T13:28:27Z","cross_cats_sorted":[],"title_canon_sha256":"e619a5e5dc0f79c8b716c479e56e93d2faf0b8d6f6776aabb0f3b661921fb1b9","abstract_canon_sha256":"353130c77ce547fb445cb8d4fba0e1bdbfd7c893251736736c1239eb7e040e98"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:45:30.815281Z","signature_b64":"qkGKWsUoq6oa8Oi3uriijOhgLIvaPC9+wfBXUevjOkrvvqF/p7HVkoyDxa4Z8TeGor+Rr9xYpLbRJtg05lO1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d338122dc6b1bdf240f772766a8f96ec5906bb071da14ac2eb5a378f3eae93b","last_reissued_at":"2026-07-04T14:45:30.814956Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:45:30.814956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Addition on a Quantum Computer","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Thomas G. Draper","submitted_at":"2000-08-07T13:28:27Z","abstract_excerpt":"A new method for computing sums on a quantum computer is introduced. This technique uses the quantum Fourier transform and reduces the number of qubits necessary for addition by removing the need for temporary carry bits. This approach also allows the addition of a classical number to a quantum superposition without encoding the classical number in the quantum register. This method also allows for massive parallelization in its execution."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0008033","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0008033/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":"quant-ph/0008033","created_at":"2026-07-04T14:45:30.815006+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0008033v1","created_at":"2026-07-04T14:45:30.815006+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0008033","created_at":"2026-07-04T14:45:30.815006+00:00"},{"alias_kind":"pith_short_12","alias_value":"BUZYCIW4NMN5","created_at":"2026-07-04T14:45:30.815006+00:00"},{"alias_kind":"pith_short_16","alias_value":"BUZYCIW4NMN56JAP","created_at":"2026-07-04T14:45:30.815006+00:00"},{"alias_kind":"pith_short_8","alias_value":"BUZYCIW4","created_at":"2026-07-04T14:45:30.815006+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":14,"internal_anchor_count":12,"sample":[{"citing_arxiv_id":"2606.22334","citing_title":"Lattice-quantile estimation of {\\pi} and convex-region integrals from coined two-dimensional quantum walks","ref_index":29,"is_internal_anchor":true},{"citing_arxiv_id":"2606.20975","citing_title":"Solving Einstein Field Equations on a Digital Quantum Computer","ref_index":31,"is_internal_anchor":true},{"citing_arxiv_id":"2606.20176","citing_title":"Quantum-Accelerated Self-Consistent Field: A Hybrid Algorithm","ref_index":55,"is_internal_anchor":true},{"citing_arxiv_id":"2606.01426","citing_title":"Efficient and Expressive Boundary Conditions in Quantum Lattice Boltzmann Methods","ref_index":124,"is_internal_anchor":true},{"citing_arxiv_id":"2606.31837","citing_title":"Automatic quantum function parallelization and memory management in Qrisp","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"2606.31351","citing_title":"A Quantum-Classical Surrogate Model for the Collision Operator of the Lattice Boltzmann Method","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"2606.00581","citing_title":"Analog photonic simulator for large-scale transport","ref_index":52,"is_internal_anchor":true},{"citing_arxiv_id":"2408.03085","citing_title":"Universal Matrix Multiplication on Quantum Computer","ref_index":22,"is_internal_anchor":true},{"citing_arxiv_id":"2410.13759","citing_title":"On the practicality of quantum sieving algorithms for the shortest vector problem","ref_index":72,"is_internal_anchor":true},{"citing_arxiv_id":"2510.07195","citing_title":"Accelerating Inference for Multilayer Neural Networks with Quantum Computers","ref_index":105,"is_internal_anchor":true},{"citing_arxiv_id":"2511.03359","citing_title":"Universal Quantum Computer Simulation of 50 Qubits on Europe`s First Exascale Supercomputer Harnessing Its Heterogeneous CPU-GPU Architecture","ref_index":21,"is_internal_anchor":true},{"citing_arxiv_id":"2511.11494","citing_title":"A Quantum Spectral Method for Non-Periodic Boundary Value Problems","ref_index":37,"is_internal_anchor":true},{"citing_arxiv_id":"2604.24694","citing_title":"Encoding strategies for quantum enhanced fluid simulations: opportunities and challenges","ref_index":157,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00118","citing_title":"Toward Secure Multitenant Quantum Computing: Circuit Affinity, Crosstalk Patterns, and Grouping Strategies","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BUZYCIW4NMN56JAPO4TWNKHZN3","json":"https://pith.science/pith/BUZYCIW4NMN56JAPO4TWNKHZN3.json","graph_json":"https://pith.science/api/pith-number/BUZYCIW4NMN56JAPO4TWNKHZN3/graph.json","events_json":"https://pith.science/api/pith-number/BUZYCIW4NMN56JAPO4TWNKHZN3/events.json","paper":"https://pith.science/paper/BUZYCIW4"},"agent_actions":{"view_html":"https://pith.science/pith/BUZYCIW4NMN56JAPO4TWNKHZN3","download_json":"https://pith.science/pith/BUZYCIW4NMN56JAPO4TWNKHZN3.json","view_paper":"https://pith.science/paper/BUZYCIW4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0008033&json=true","fetch_graph":"https://pith.science/api/pith-number/BUZYCIW4NMN56JAPO4TWNKHZN3/graph.json","fetch_events":"https://pith.science/api/pith-number/BUZYCIW4NMN56JAPO4TWNKHZN3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BUZYCIW4NMN56JAPO4TWNKHZN3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BUZYCIW4NMN56JAPO4TWNKHZN3/action/storage_attestation","attest_author":"https://pith.science/pith/BUZYCIW4NMN56JAPO4TWNKHZN3/action/author_attestation","sign_citation":"https://pith.science/pith/BUZYCIW4NMN56JAPO4TWNKHZN3/action/citation_signature","submit_replication":"https://pith.science/pith/BUZYCIW4NMN56JAPO4TWNKHZN3/action/replication_record"}},"created_at":"2026-07-04T14:45:30.815006+00:00","updated_at":"2026-07-04T14:45:30.815006+00:00"}