{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YLHBR7VOISKAXX7MVTPNQ4UQ4V","short_pith_number":"pith:YLHBR7VO","schema_version":"1.0","canonical_sha256":"c2ce18feae44940bdfecacded87290e5728a47425671cfc79c0332f2d1f33ce1","source":{"kind":"arxiv","id":"2504.17090","version":1},"attestation_state":"computed","paper":{"title":"Construction of Boolean Logic Gates Using QFT-Based Adder Architecture","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":"2025-04-23T20:47:36Z","abstract_excerpt":"In this study, we construct the quantum reversible counterparts of the logical AND, OR, XOR, NOR, and NAND gates. We utilize a quantum Fourier transform (QFT)-based adder circuit that replicates the functionality of a digital half-adder, which computes the sum and carry of two input bits using XOR and AND gates, respectively. To realize different logic gate operations, we apply pre- and post-processing to the QFT-adder using quantum gates, leveraging Boolean algebra properties to enable conversions between various logical functions. Although the number of elementary quantum logic gates increas"},"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":"2504.17090","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-04-23T20:47:36Z","cross_cats_sorted":[],"title_canon_sha256":"377523b210802be8bb1af194a761ca35142035114857e04552af47384597b911","abstract_canon_sha256":"e5b961ffbe2e586c7b1fbc3998c9730b86878a36d9286e1be860265d70449ad4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:53:22.141037Z","signature_b64":"+A7huuc2FHh1FyxnFjf5We+ck/oJyxnZs/0jrprzmTz0bBEiozEjtwnXST8XG3sRmkdn+gfOF/h+Ol6mkpcTBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2ce18feae44940bdfecacded87290e5728a47425671cfc79c0332f2d1f33ce1","last_reissued_at":"2026-07-05T10:53:22.140544Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:53:22.140544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Construction of Boolean Logic Gates Using QFT-Based Adder Architecture","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":"2025-04-23T20:47:36Z","abstract_excerpt":"In this study, we construct the quantum reversible counterparts of the logical AND, OR, XOR, NOR, and NAND gates. We utilize a quantum Fourier transform (QFT)-based adder circuit that replicates the functionality of a digital half-adder, which computes the sum and carry of two input bits using XOR and AND gates, respectively. To realize different logic gate operations, we apply pre- and post-processing to the QFT-adder using quantum gates, leveraging Boolean algebra properties to enable conversions between various logical functions. Although the number of elementary quantum logic gates increas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.17090","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/2504.17090/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":"2504.17090","created_at":"2026-07-05T10:53:22.140603+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.17090v1","created_at":"2026-07-05T10:53:22.140603+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.17090","created_at":"2026-07-05T10:53:22.140603+00:00"},{"alias_kind":"pith_short_12","alias_value":"YLHBR7VOISKA","created_at":"2026-07-05T10:53:22.140603+00:00"},{"alias_kind":"pith_short_16","alias_value":"YLHBR7VOISKAXX7M","created_at":"2026-07-05T10:53:22.140603+00:00"},{"alias_kind":"pith_short_8","alias_value":"YLHBR7VO","created_at":"2026-07-05T10:53:22.140603+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YLHBR7VOISKAXX7MVTPNQ4UQ4V","json":"https://pith.science/pith/YLHBR7VOISKAXX7MVTPNQ4UQ4V.json","graph_json":"https://pith.science/api/pith-number/YLHBR7VOISKAXX7MVTPNQ4UQ4V/graph.json","events_json":"https://pith.science/api/pith-number/YLHBR7VOISKAXX7MVTPNQ4UQ4V/events.json","paper":"https://pith.science/paper/YLHBR7VO"},"agent_actions":{"view_html":"https://pith.science/pith/YLHBR7VOISKAXX7MVTPNQ4UQ4V","download_json":"https://pith.science/pith/YLHBR7VOISKAXX7MVTPNQ4UQ4V.json","view_paper":"https://pith.science/paper/YLHBR7VO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.17090&json=true","fetch_graph":"https://pith.science/api/pith-number/YLHBR7VOISKAXX7MVTPNQ4UQ4V/graph.json","fetch_events":"https://pith.science/api/pith-number/YLHBR7VOISKAXX7MVTPNQ4UQ4V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YLHBR7VOISKAXX7MVTPNQ4UQ4V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YLHBR7VOISKAXX7MVTPNQ4UQ4V/action/storage_attestation","attest_author":"https://pith.science/pith/YLHBR7VOISKAXX7MVTPNQ4UQ4V/action/author_attestation","sign_citation":"https://pith.science/pith/YLHBR7VOISKAXX7MVTPNQ4UQ4V/action/citation_signature","submit_replication":"https://pith.science/pith/YLHBR7VOISKAXX7MVTPNQ4UQ4V/action/replication_record"}},"created_at":"2026-07-05T10:53:22.140603+00:00","updated_at":"2026-07-05T10:53:22.140603+00:00"}