{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SCUF5NY2QEY4MVXGPE4EU46FYT","short_pith_number":"pith:SCUF5NY2","schema_version":"1.0","canonical_sha256":"90a85eb71a8131c656e679384a73c5c4fc80d80c95a735c4af4ac9d7d952aae4","source":{"kind":"arxiv","id":"2408.00935","version":4},"attestation_state":"computed","paper":{"title":"Multi-controlled single-qubit unitary gates based on the quantum Fourier transform and deep decomposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Vladimir V. Arsoski","submitted_at":"2024-08-01T21:56:02Z","abstract_excerpt":"We will present a few new generalizations of the multi-controlled X (MCX) gate that uses the quantum Fourier transform (QFT). Firstly, we will optimize QFT-MCX and prove that it is equivalent to a stair MCX gates array. This stair-wise structure will allow us to devise a method for adding an arbitrary phase factor to each qubit. The first MCX generalization into multi-controlled unitary gates (MCU) relies on replacing phase gates acting on the target qubit with controlled unitary gates. We will employ alternative single-qubit gate notation to minimize the complexities of these gates and show h"},"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":"2408.00935","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-08-01T21:56:02Z","cross_cats_sorted":[],"title_canon_sha256":"b65c122bce382524fbfbddbdf96ce9a2443c7474566b4d4da1718c922a498e6b","abstract_canon_sha256":"1e6184565314d8f93bfeb6137aefd138245832d4c5c522681ca9f274e98df40b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:17:10.168693Z","signature_b64":"lSJEqQJ8yT38QbYHhcGSvcCoP4jzxWZX7Gc9kOikGp+44lcSdHZcVpLW/ggPy41IkCmwvTIM0DJNBG43j2xJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90a85eb71a8131c656e679384a73c5c4fc80d80c95a735c4af4ac9d7d952aae4","last_reissued_at":"2026-07-05T10:17:10.168209Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:17:10.168209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-controlled single-qubit unitary gates based on the quantum Fourier transform and deep decomposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Vladimir V. Arsoski","submitted_at":"2024-08-01T21:56:02Z","abstract_excerpt":"We will present a few new generalizations of the multi-controlled X (MCX) gate that uses the quantum Fourier transform (QFT). Firstly, we will optimize QFT-MCX and prove that it is equivalent to a stair MCX gates array. This stair-wise structure will allow us to devise a method for adding an arbitrary phase factor to each qubit. The first MCX generalization into multi-controlled unitary gates (MCU) relies on replacing phase gates acting on the target qubit with controlled unitary gates. We will employ alternative single-qubit gate notation to minimize the complexities of these gates and show h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.00935","kind":"arxiv","version":4},"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/2408.00935/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":"2408.00935","created_at":"2026-07-05T10:17:10.168274+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.00935v4","created_at":"2026-07-05T10:17:10.168274+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.00935","created_at":"2026-07-05T10:17:10.168274+00:00"},{"alias_kind":"pith_short_12","alias_value":"SCUF5NY2QEY4","created_at":"2026-07-05T10:17:10.168274+00:00"},{"alias_kind":"pith_short_16","alias_value":"SCUF5NY2QEY4MVXG","created_at":"2026-07-05T10:17:10.168274+00:00"},{"alias_kind":"pith_short_8","alias_value":"SCUF5NY2","created_at":"2026-07-05T10:17:10.168274+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.00695","citing_title":"Multi-Controlled Quantum Gates in Linear Nearest Neighbor","ref_index":50,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SCUF5NY2QEY4MVXGPE4EU46FYT","json":"https://pith.science/pith/SCUF5NY2QEY4MVXGPE4EU46FYT.json","graph_json":"https://pith.science/api/pith-number/SCUF5NY2QEY4MVXGPE4EU46FYT/graph.json","events_json":"https://pith.science/api/pith-number/SCUF5NY2QEY4MVXGPE4EU46FYT/events.json","paper":"https://pith.science/paper/SCUF5NY2"},"agent_actions":{"view_html":"https://pith.science/pith/SCUF5NY2QEY4MVXGPE4EU46FYT","download_json":"https://pith.science/pith/SCUF5NY2QEY4MVXGPE4EU46FYT.json","view_paper":"https://pith.science/paper/SCUF5NY2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.00935&json=true","fetch_graph":"https://pith.science/api/pith-number/SCUF5NY2QEY4MVXGPE4EU46FYT/graph.json","fetch_events":"https://pith.science/api/pith-number/SCUF5NY2QEY4MVXGPE4EU46FYT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SCUF5NY2QEY4MVXGPE4EU46FYT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SCUF5NY2QEY4MVXGPE4EU46FYT/action/storage_attestation","attest_author":"https://pith.science/pith/SCUF5NY2QEY4MVXGPE4EU46FYT/action/author_attestation","sign_citation":"https://pith.science/pith/SCUF5NY2QEY4MVXGPE4EU46FYT/action/citation_signature","submit_replication":"https://pith.science/pith/SCUF5NY2QEY4MVXGPE4EU46FYT/action/replication_record"}},"created_at":"2026-07-05T10:17:10.168274+00:00","updated_at":"2026-07-05T10:17:10.168274+00:00"}