{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:HNNZZP26F3X2WU2W5TNVMABY4M","short_pith_number":"pith:HNNZZP26","schema_version":"1.0","canonical_sha256":"3b5b9cbf5e2eefab5356ecdb560038e336abaa50b6fd9477dd2fc6c63284575c","source":{"kind":"arxiv","id":"2607.08200","version":1},"attestation_state":"computed","paper":{"title":"Efficient High-Dimensional Quantum Circuit Synthesis: From Multi-Controlled Gates to Isometries and Quantum Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gui-Long Jiang","submitted_at":"2026-07-09T07:57:57Z","abstract_excerpt":"Circuit synthesis of multi-controlled gates is crucial for qudit ($d$-level) quantum computing. This paper presents efficient synthesis schemes that reduce the elementary gate count for multi-controlled single-qudit gates. For synthesizing general $(n-1)$-controlled unitaries on $n$ qudits, we reduce the controlled-increment (CINC) and generalized controlled-$X$ (GCX) gate counts to $O(n^2)$, improving upon existing $O(n^{2+\\log_2 d})$ CINC and $O(n^3)$ GCX bounds. For $(n-1)$-controlled special unitaries, this complexity is further reduced to $O(n)$. By utilizing the proposed circuit, we pres"},"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":"2607.08200","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-09T07:57:57Z","cross_cats_sorted":[],"title_canon_sha256":"c206764813040c20363156d4bb9ca1cb7dc312a73cc967c2b1ae1b1e44eb5ee2","abstract_canon_sha256":"2811545f2aedea7c798caf88991bb11ca55cd543329ff30d585e83870962d704"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-10T01:19:29.563078Z","signature_b64":"oaJVRthlY/NcQM+MahbGma6+RHF7D1Ey/9RhBu2TV5kxHOsK4YHFJNOHrDPGos2nXvCu/0Kn7P2VwKBQ0yhvAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b5b9cbf5e2eefab5356ecdb560038e336abaa50b6fd9477dd2fc6c63284575c","last_reissued_at":"2026-07-10T01:19:29.562677Z","signature_status":"signed_v1","first_computed_at":"2026-07-10T01:19:29.562677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient High-Dimensional Quantum Circuit Synthesis: From Multi-Controlled Gates to Isometries and Quantum Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gui-Long Jiang","submitted_at":"2026-07-09T07:57:57Z","abstract_excerpt":"Circuit synthesis of multi-controlled gates is crucial for qudit ($d$-level) quantum computing. This paper presents efficient synthesis schemes that reduce the elementary gate count for multi-controlled single-qudit gates. For synthesizing general $(n-1)$-controlled unitaries on $n$ qudits, we reduce the controlled-increment (CINC) and generalized controlled-$X$ (GCX) gate counts to $O(n^2)$, improving upon existing $O(n^{2+\\log_2 d})$ CINC and $O(n^3)$ GCX bounds. For $(n-1)$-controlled special unitaries, this complexity is further reduced to $O(n)$. By utilizing the proposed circuit, we pres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.08200","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/2607.08200/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":"2607.08200","created_at":"2026-07-10T01:19:29.562735+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.08200v1","created_at":"2026-07-10T01:19:29.562735+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.08200","created_at":"2026-07-10T01:19:29.562735+00:00"},{"alias_kind":"pith_short_12","alias_value":"HNNZZP26F3X2","created_at":"2026-07-10T01:19:29.562735+00:00"},{"alias_kind":"pith_short_16","alias_value":"HNNZZP26F3X2WU2W","created_at":"2026-07-10T01:19:29.562735+00:00"},{"alias_kind":"pith_short_8","alias_value":"HNNZZP26","created_at":"2026-07-10T01:19:29.562735+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08200","citing_title":"Efficient High-Dimensional Quantum Circuit Synthesis: From Multi-Controlled Gates to Isometries and Quantum Channels","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HNNZZP26F3X2WU2W5TNVMABY4M","json":"https://pith.science/pith/HNNZZP26F3X2WU2W5TNVMABY4M.json","graph_json":"https://pith.science/api/pith-number/HNNZZP26F3X2WU2W5TNVMABY4M/graph.json","events_json":"https://pith.science/api/pith-number/HNNZZP26F3X2WU2W5TNVMABY4M/events.json","paper":"https://pith.science/paper/HNNZZP26"},"agent_actions":{"view_html":"https://pith.science/pith/HNNZZP26F3X2WU2W5TNVMABY4M","download_json":"https://pith.science/pith/HNNZZP26F3X2WU2W5TNVMABY4M.json","view_paper":"https://pith.science/paper/HNNZZP26","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.08200&json=true","fetch_graph":"https://pith.science/api/pith-number/HNNZZP26F3X2WU2W5TNVMABY4M/graph.json","fetch_events":"https://pith.science/api/pith-number/HNNZZP26F3X2WU2W5TNVMABY4M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HNNZZP26F3X2WU2W5TNVMABY4M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HNNZZP26F3X2WU2W5TNVMABY4M/action/storage_attestation","attest_author":"https://pith.science/pith/HNNZZP26F3X2WU2W5TNVMABY4M/action/author_attestation","sign_citation":"https://pith.science/pith/HNNZZP26F3X2WU2W5TNVMABY4M/action/citation_signature","submit_replication":"https://pith.science/pith/HNNZZP26F3X2WU2W5TNVMABY4M/action/replication_record"}},"created_at":"2026-07-10T01:19:29.562735+00:00","updated_at":"2026-07-10T01:19:29.562735+00:00"}