{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:V53WQJSGKXOVWQJCNFCERT6DBR","short_pith_number":"pith:V53WQJSG","schema_version":"1.0","canonical_sha256":"af7768264655dd5b4122694448cfc30c70cd70161fc830a7bb46ae9397e21e4a","source":{"kind":"arxiv","id":"2310.11996","version":1},"attestation_state":"computed","paper":{"title":"Optimal synthesis of general multi-qutrit quantum computation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gui-Long Jiang, Hai-Rui Wei, Wen-Qiang Liu","submitted_at":"2023-10-18T14:28:31Z","abstract_excerpt":"Quantum circuits of a general quantum gate acting on multiple $d$-level quantum systems play a prominent role in multi-valued quantum computation. We first propose a new recursive Cartan decomposition of semi-simple unitary Lie group $U(3^n)$ (arbitrary $n$-qutrit gate). Note that the decomposition completely decomposes an n-qutrit gate into local and non-local operations. We design an explicit quantum circuit for implementing arbitrary two-qutrit gates, and the cost of our construction is 21 generalized controlled X (GCX) and controlled increment (CINC) gates less than the earlier best result"},"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":"2310.11996","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-10-18T14:28:31Z","cross_cats_sorted":[],"title_canon_sha256":"6b56178686501c64be8054eca9ca447213a8444d209929dde9b677a9cd1c1740","abstract_canon_sha256":"9faa703b19a8268d631cf3bc30114445796e4859e0ee020f05beddce28ae1083"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:23:56.767543Z","signature_b64":"+8haTi4QSQ/XiiJPCL4l+w/rVvddzS4+jkIIivpQJe0tVIaePkz894j74t37xBp2kkth4Kaa9kSVmExE/d9pDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af7768264655dd5b4122694448cfc30c70cd70161fc830a7bb46ae9397e21e4a","last_reissued_at":"2026-07-05T08:23:56.767034Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:23:56.767034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal synthesis of general multi-qutrit quantum computation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gui-Long Jiang, Hai-Rui Wei, Wen-Qiang Liu","submitted_at":"2023-10-18T14:28:31Z","abstract_excerpt":"Quantum circuits of a general quantum gate acting on multiple $d$-level quantum systems play a prominent role in multi-valued quantum computation. We first propose a new recursive Cartan decomposition of semi-simple unitary Lie group $U(3^n)$ (arbitrary $n$-qutrit gate). Note that the decomposition completely decomposes an n-qutrit gate into local and non-local operations. We design an explicit quantum circuit for implementing arbitrary two-qutrit gates, and the cost of our construction is 21 generalized controlled X (GCX) and controlled increment (CINC) gates less than the earlier best result"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.11996","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/2310.11996/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":"2310.11996","created_at":"2026-07-05T08:23:56.767091+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.11996v1","created_at":"2026-07-05T08:23:56.767091+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.11996","created_at":"2026-07-05T08:23:56.767091+00:00"},{"alias_kind":"pith_short_12","alias_value":"V53WQJSGKXOV","created_at":"2026-07-05T08:23:56.767091+00:00"},{"alias_kind":"pith_short_16","alias_value":"V53WQJSGKXOVWQJC","created_at":"2026-07-05T08:23:56.767091+00:00"},{"alias_kind":"pith_short_8","alias_value":"V53WQJSG","created_at":"2026-07-05T08:23:56.767091+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.10945","citing_title":"Non-Abelian dynamics on a cube: improving quantum compilation through qudit-based simulations","ref_index":98,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V53WQJSGKXOVWQJCNFCERT6DBR","json":"https://pith.science/pith/V53WQJSGKXOVWQJCNFCERT6DBR.json","graph_json":"https://pith.science/api/pith-number/V53WQJSGKXOVWQJCNFCERT6DBR/graph.json","events_json":"https://pith.science/api/pith-number/V53WQJSGKXOVWQJCNFCERT6DBR/events.json","paper":"https://pith.science/paper/V53WQJSG"},"agent_actions":{"view_html":"https://pith.science/pith/V53WQJSGKXOVWQJCNFCERT6DBR","download_json":"https://pith.science/pith/V53WQJSGKXOVWQJCNFCERT6DBR.json","view_paper":"https://pith.science/paper/V53WQJSG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.11996&json=true","fetch_graph":"https://pith.science/api/pith-number/V53WQJSGKXOVWQJCNFCERT6DBR/graph.json","fetch_events":"https://pith.science/api/pith-number/V53WQJSGKXOVWQJCNFCERT6DBR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V53WQJSGKXOVWQJCNFCERT6DBR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V53WQJSGKXOVWQJCNFCERT6DBR/action/storage_attestation","attest_author":"https://pith.science/pith/V53WQJSGKXOVWQJCNFCERT6DBR/action/author_attestation","sign_citation":"https://pith.science/pith/V53WQJSGKXOVWQJCNFCERT6DBR/action/citation_signature","submit_replication":"https://pith.science/pith/V53WQJSGKXOVWQJCNFCERT6DBR/action/replication_record"}},"created_at":"2026-07-05T08:23:56.767091+00:00","updated_at":"2026-07-05T08:23:56.767091+00:00"}