{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:56ZYIN2FK3LT5YXU2XQAAHHUDY","short_pith_number":"pith:56ZYIN2F","schema_version":"1.0","canonical_sha256":"efb384374556d73ee2f4d5e0001cf41e350d89901f38bb3f718ea606ea4f6d6b","source":{"kind":"arxiv","id":"2501.07060","version":1},"attestation_state":"computed","paper":{"title":"New Circuit for Quantum Adder by Constant","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dmytro Fedoriaka","submitted_at":"2025-01-13T04:52:01Z","abstract_excerpt":"We propose a new circuit for in-place addition of a classical $n$-bit constant to a quantum $n$-qubit integer modulo $2^n$. Our circuit uses $n-3$ ancilla qubits and has a T-count of $4n-5$. We also propose controlled version of this circuit that uses $n-2$ ancillas and has a T-count of $11n-15$. We implement these circuits in Q#."},"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.07060","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-01-13T04:52:01Z","cross_cats_sorted":[],"title_canon_sha256":"688fd3634d0a9cff4301dbb0ed8556ae9f734eeba717ee63459e98de83fa5d6e","abstract_canon_sha256":"5ee64fef37bff246a902ec01b830d136f586eaf81cc166a75d8ad75cf0fcf82e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:00:14.483107Z","signature_b64":"6YwRr/5h75P1STmD0YQHu5qzacvSbqk9nVcfJo7VKxtsNKIC6SA9n21UGgrCRUaWybMxLRM5+quQnyatSR1CBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efb384374556d73ee2f4d5e0001cf41e350d89901f38bb3f718ea606ea4f6d6b","last_reissued_at":"2026-07-05T10:00:14.482639Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:00:14.482639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Circuit for Quantum Adder by Constant","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dmytro Fedoriaka","submitted_at":"2025-01-13T04:52:01Z","abstract_excerpt":"We propose a new circuit for in-place addition of a classical $n$-bit constant to a quantum $n$-qubit integer modulo $2^n$. Our circuit uses $n-3$ ancilla qubits and has a T-count of $4n-5$. We also propose controlled version of this circuit that uses $n-2$ ancillas and has a T-count of $11n-15$. We implement these circuits in Q#."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.07060","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/2501.07060/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.07060","created_at":"2026-07-05T10:00:14.482697+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.07060v1","created_at":"2026-07-05T10:00:14.482697+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.07060","created_at":"2026-07-05T10:00:14.482697+00:00"},{"alias_kind":"pith_short_12","alias_value":"56ZYIN2FK3LT","created_at":"2026-07-05T10:00:14.482697+00:00"},{"alias_kind":"pith_short_16","alias_value":"56ZYIN2FK3LT5YXU","created_at":"2026-07-05T10:00:14.482697+00:00"},{"alias_kind":"pith_short_8","alias_value":"56ZYIN2F","created_at":"2026-07-05T10:00:14.482697+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.07060","citing_title":"New Circuit for Quantum Adder by Constant","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/56ZYIN2FK3LT5YXU2XQAAHHUDY","json":"https://pith.science/pith/56ZYIN2FK3LT5YXU2XQAAHHUDY.json","graph_json":"https://pith.science/api/pith-number/56ZYIN2FK3LT5YXU2XQAAHHUDY/graph.json","events_json":"https://pith.science/api/pith-number/56ZYIN2FK3LT5YXU2XQAAHHUDY/events.json","paper":"https://pith.science/paper/56ZYIN2F"},"agent_actions":{"view_html":"https://pith.science/pith/56ZYIN2FK3LT5YXU2XQAAHHUDY","download_json":"https://pith.science/pith/56ZYIN2FK3LT5YXU2XQAAHHUDY.json","view_paper":"https://pith.science/paper/56ZYIN2F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.07060&json=true","fetch_graph":"https://pith.science/api/pith-number/56ZYIN2FK3LT5YXU2XQAAHHUDY/graph.json","fetch_events":"https://pith.science/api/pith-number/56ZYIN2FK3LT5YXU2XQAAHHUDY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/56ZYIN2FK3LT5YXU2XQAAHHUDY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/56ZYIN2FK3LT5YXU2XQAAHHUDY/action/storage_attestation","attest_author":"https://pith.science/pith/56ZYIN2FK3LT5YXU2XQAAHHUDY/action/author_attestation","sign_citation":"https://pith.science/pith/56ZYIN2FK3LT5YXU2XQAAHHUDY/action/citation_signature","submit_replication":"https://pith.science/pith/56ZYIN2FK3LT5YXU2XQAAHHUDY/action/replication_record"}},"created_at":"2026-07-05T10:00:14.482697+00:00","updated_at":"2026-07-05T10:00:14.482697+00:00"}