{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IL7JHDUC77F3IB2CTVTE4DOU36","short_pith_number":"pith:IL7JHDUC","schema_version":"1.0","canonical_sha256":"42fe938e82ffcbb407429d664e0dd4df8ab7eb5321576454cde046f0e09002fb","source":{"kind":"arxiv","id":"2506.17135","version":2},"attestation_state":"computed","paper":{"title":"No Scratch Quantum Computing by Reducing Qubit Overhead for Efficient Arithmetics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET","cs.LO"],"primary_cat":"quant-ph","authors_text":"Maximilian Kiefer-Emmanouilidis, Norbert Wehn, Omid Faizy, Paul Lukowicz","submitted_at":"2025-06-20T16:37:23Z","abstract_excerpt":"Quantum arithmetic computation requires a substantial number of scratch qubits to stay reversible. These operations necessitate qubit and gate resources equivalent to those needed for the larger of the input or output registers due to state encoding. Quantum Hamiltonian Computing (QHC) introduces a novel approach by encoding input for logic operations within a single rotating quantum gate. This innovation reduces the required qubit register $ N $ to the size of the output states $ O $, where $ N = \\log_2 O $. Leveraging QHC principles, we present reversible half-adder and full-adder circuits t"},"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":"2506.17135","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-06-20T16:37:23Z","cross_cats_sorted":["cs.ET","cs.LO"],"title_canon_sha256":"b29210096b7fd8d68032b13830d54b220bc12b022bfe58d0fc7acd6bae863d06","abstract_canon_sha256":"911da94e9034ca2e961363a3dabc58cb876a1c4e098de399ba411f9f9029d428"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:39:12.426795Z","signature_b64":"YDFSkyAMXgI9/o4pGuHg0FIgOHeK9gU/FfZEpM/PKC8A7VVy6PIdIUVrU3wSVQtGB9+0bFGEi+zRWzvKovdwAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42fe938e82ffcbb407429d664e0dd4df8ab7eb5321576454cde046f0e09002fb","last_reissued_at":"2026-07-05T11:39:12.426235Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:39:12.426235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"No Scratch Quantum Computing by Reducing Qubit Overhead for Efficient Arithmetics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET","cs.LO"],"primary_cat":"quant-ph","authors_text":"Maximilian Kiefer-Emmanouilidis, Norbert Wehn, Omid Faizy, Paul Lukowicz","submitted_at":"2025-06-20T16:37:23Z","abstract_excerpt":"Quantum arithmetic computation requires a substantial number of scratch qubits to stay reversible. These operations necessitate qubit and gate resources equivalent to those needed for the larger of the input or output registers due to state encoding. Quantum Hamiltonian Computing (QHC) introduces a novel approach by encoding input for logic operations within a single rotating quantum gate. This innovation reduces the required qubit register $ N $ to the size of the output states $ O $, where $ N = \\log_2 O $. Leveraging QHC principles, we present reversible half-adder and full-adder circuits t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.17135","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/2506.17135/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":"2506.17135","created_at":"2026-07-05T11:39:12.426287+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.17135v2","created_at":"2026-07-05T11:39:12.426287+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.17135","created_at":"2026-07-05T11:39:12.426287+00:00"},{"alias_kind":"pith_short_12","alias_value":"IL7JHDUC77F3","created_at":"2026-07-05T11:39:12.426287+00:00"},{"alias_kind":"pith_short_16","alias_value":"IL7JHDUC77F3IB2C","created_at":"2026-07-05T11:39:12.426287+00:00"},{"alias_kind":"pith_short_8","alias_value":"IL7JHDUC","created_at":"2026-07-05T11:39:12.426287+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.09846","citing_title":"Whole-Body Bilateral Teleoperation with Multi-Stage Object Parameter Estimation for Wheeled Humanoid Locomanipulation","ref_index":58,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IL7JHDUC77F3IB2CTVTE4DOU36","json":"https://pith.science/pith/IL7JHDUC77F3IB2CTVTE4DOU36.json","graph_json":"https://pith.science/api/pith-number/IL7JHDUC77F3IB2CTVTE4DOU36/graph.json","events_json":"https://pith.science/api/pith-number/IL7JHDUC77F3IB2CTVTE4DOU36/events.json","paper":"https://pith.science/paper/IL7JHDUC"},"agent_actions":{"view_html":"https://pith.science/pith/IL7JHDUC77F3IB2CTVTE4DOU36","download_json":"https://pith.science/pith/IL7JHDUC77F3IB2CTVTE4DOU36.json","view_paper":"https://pith.science/paper/IL7JHDUC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.17135&json=true","fetch_graph":"https://pith.science/api/pith-number/IL7JHDUC77F3IB2CTVTE4DOU36/graph.json","fetch_events":"https://pith.science/api/pith-number/IL7JHDUC77F3IB2CTVTE4DOU36/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IL7JHDUC77F3IB2CTVTE4DOU36/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IL7JHDUC77F3IB2CTVTE4DOU36/action/storage_attestation","attest_author":"https://pith.science/pith/IL7JHDUC77F3IB2CTVTE4DOU36/action/author_attestation","sign_citation":"https://pith.science/pith/IL7JHDUC77F3IB2CTVTE4DOU36/action/citation_signature","submit_replication":"https://pith.science/pith/IL7JHDUC77F3IB2CTVTE4DOU36/action/replication_record"}},"created_at":"2026-07-05T11:39:12.426287+00:00","updated_at":"2026-07-05T11:39:12.426287+00:00"}