{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KNKHVE3XT3BF44CNIUTEDE6NE7","short_pith_number":"pith:KNKHVE3X","schema_version":"1.0","canonical_sha256":"53547a93779ec25e704d45264193cd27c784bba8fefa7fc7be042c64d1611f85","source":{"kind":"arxiv","id":"2411.00260","version":1},"attestation_state":"computed","paper":{"title":"Scalable quantum circuit design for QFT-based arithmetic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ayda Kaltehei, Azmi Gen\\c{c}ten, Murat Kurt, Sel\\c{c}uk \\c{C}akmak","submitted_at":"2024-10-31T23:34:06Z","abstract_excerpt":"In this research, we create a scalable version of the quantum Fourier transform-based arithmetic circuit to perform addition and subtraction operations on N n-bit unsigned integers encoded in quantum registers, and it is compatible with d-level quantum sources, called qudits. We present qubit- and ququart-based multi-input QFT adders, and we compare and discuss potential benefits such as circuit simplicity and noise sensitivity. The results show that a ququart-based system significantly reduces gate count and improves computational efficiency compared to qubit-based systems. Overall, the findi"},"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":"2411.00260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-10-31T23:34:06Z","cross_cats_sorted":[],"title_canon_sha256":"a788a54bcf974c822466762a51027d687e0b571f6c7455454471c106cd5f1541","abstract_canon_sha256":"6998411429c2a0e3cfd9ead8b9135a1d8616ac0ef0dd14281c2eef017930d0bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:29:39.843864Z","signature_b64":"er5XcYcV++ACDIxoePaXZ+vTTxNsF2oiHFE5rWq8Mxo1RDMpuXFWZKqSY/4FxfjCkmjpzIPn4+BB1MMn/hOiDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53547a93779ec25e704d45264193cd27c784bba8fefa7fc7be042c64d1611f85","last_reissued_at":"2026-07-05T09:29:39.843478Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:29:39.843478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable quantum circuit design for QFT-based arithmetic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ayda Kaltehei, Azmi Gen\\c{c}ten, Murat Kurt, Sel\\c{c}uk \\c{C}akmak","submitted_at":"2024-10-31T23:34:06Z","abstract_excerpt":"In this research, we create a scalable version of the quantum Fourier transform-based arithmetic circuit to perform addition and subtraction operations on N n-bit unsigned integers encoded in quantum registers, and it is compatible with d-level quantum sources, called qudits. We present qubit- and ququart-based multi-input QFT adders, and we compare and discuss potential benefits such as circuit simplicity and noise sensitivity. The results show that a ququart-based system significantly reduces gate count and improves computational efficiency compared to qubit-based systems. Overall, the findi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.00260","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/2411.00260/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":"2411.00260","created_at":"2026-07-05T09:29:39.843530+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.00260v1","created_at":"2026-07-05T09:29:39.843530+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.00260","created_at":"2026-07-05T09:29:39.843530+00:00"},{"alias_kind":"pith_short_12","alias_value":"KNKHVE3XT3BF","created_at":"2026-07-05T09:29:39.843530+00:00"},{"alias_kind":"pith_short_16","alias_value":"KNKHVE3XT3BF44CN","created_at":"2026-07-05T09:29:39.843530+00:00"},{"alias_kind":"pith_short_8","alias_value":"KNKHVE3X","created_at":"2026-07-05T09:29:39.843530+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.17090","citing_title":"Construction of Boolean Logic Gates Using QFT-Based Adder Architecture","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KNKHVE3XT3BF44CNIUTEDE6NE7","json":"https://pith.science/pith/KNKHVE3XT3BF44CNIUTEDE6NE7.json","graph_json":"https://pith.science/api/pith-number/KNKHVE3XT3BF44CNIUTEDE6NE7/graph.json","events_json":"https://pith.science/api/pith-number/KNKHVE3XT3BF44CNIUTEDE6NE7/events.json","paper":"https://pith.science/paper/KNKHVE3X"},"agent_actions":{"view_html":"https://pith.science/pith/KNKHVE3XT3BF44CNIUTEDE6NE7","download_json":"https://pith.science/pith/KNKHVE3XT3BF44CNIUTEDE6NE7.json","view_paper":"https://pith.science/paper/KNKHVE3X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.00260&json=true","fetch_graph":"https://pith.science/api/pith-number/KNKHVE3XT3BF44CNIUTEDE6NE7/graph.json","fetch_events":"https://pith.science/api/pith-number/KNKHVE3XT3BF44CNIUTEDE6NE7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KNKHVE3XT3BF44CNIUTEDE6NE7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KNKHVE3XT3BF44CNIUTEDE6NE7/action/storage_attestation","attest_author":"https://pith.science/pith/KNKHVE3XT3BF44CNIUTEDE6NE7/action/author_attestation","sign_citation":"https://pith.science/pith/KNKHVE3XT3BF44CNIUTEDE6NE7/action/citation_signature","submit_replication":"https://pith.science/pith/KNKHVE3XT3BF44CNIUTEDE6NE7/action/replication_record"}},"created_at":"2026-07-05T09:29:39.843530+00:00","updated_at":"2026-07-05T09:29:39.843530+00:00"}