{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:N44NREBESKJTXNOA6R4VBEZNGV","short_pith_number":"pith:N44NREBE","schema_version":"1.0","canonical_sha256":"6f38d8902492933bb5c0f47950932d357175946187489101da68527019fcef99","source":{"kind":"arxiv","id":"quant-ph/0509161","version":1},"attestation_state":"computed","paper":{"title":"Efficient Circuits for Exact-Universal Computations with Qudits","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dianne P. O'Leary, Gavin K. Brennen, Stephen S. Bullock","submitted_at":"2005-09-22T12:01:40Z","abstract_excerpt":"This paper concerns the efficient implementation of quantum circuits for qudits. We show that controlled two-qudit gates can be implemented without ancillas and prove that the gate library containing arbitrary local unitaries and one two-qudit gate, CINC, is exact-universal. A recent paper (PRL 94 230502) describes quantum circuits for qudits which require O(d^n) two-qudit gates for state synthesis and O(d^{2n}) two-qudit gates for unitary synthesis, matching the respective lower bound complexities. In this work, we present the state synthesis circuit in much greater detail and prove that it i"},"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":"quant-ph/0509161","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-09-22T12:01:40Z","cross_cats_sorted":[],"title_canon_sha256":"853bbf55e4272e2a96d6c670b31eceb0d816a495eff80da7c23ff29369e7e036","abstract_canon_sha256":"1157cefb97f7fa1819383cf7a95fa4e06c571e64bef1db8b4202ab8810d882d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:49:08.091068Z","signature_b64":"w7VhnQOQ2zQyvT+jOSWlIk0pL1El2qNGyuU/7g9A1ToF61arAxAMfMOT7M/YUqgZieqBDZ2AtQXbFgF4FZb+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f38d8902492933bb5c0f47950932d357175946187489101da68527019fcef99","last_reissued_at":"2026-07-04T14:49:08.090664Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:49:08.090664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Circuits for Exact-Universal Computations with Qudits","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dianne P. O'Leary, Gavin K. Brennen, Stephen S. Bullock","submitted_at":"2005-09-22T12:01:40Z","abstract_excerpt":"This paper concerns the efficient implementation of quantum circuits for qudits. We show that controlled two-qudit gates can be implemented without ancillas and prove that the gate library containing arbitrary local unitaries and one two-qudit gate, CINC, is exact-universal. A recent paper (PRL 94 230502) describes quantum circuits for qudits which require O(d^n) two-qudit gates for state synthesis and O(d^{2n}) two-qudit gates for unitary synthesis, matching the respective lower bound complexities. In this work, we present the state synthesis circuit in much greater detail and prove that it i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0509161","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/quant-ph/0509161/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":"quant-ph/0509161","created_at":"2026-07-04T14:49:08.090725+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0509161v1","created_at":"2026-07-04T14:49:08.090725+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0509161","created_at":"2026-07-04T14:49:08.090725+00:00"},{"alias_kind":"pith_short_12","alias_value":"N44NREBESKJT","created_at":"2026-07-04T14:49:08.090725+00:00"},{"alias_kind":"pith_short_16","alias_value":"N44NREBESKJTXNOA","created_at":"2026-07-04T14:49:08.090725+00:00"},{"alias_kind":"pith_short_8","alias_value":"N44NREBE","created_at":"2026-07-04T14:49:08.090725+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":90,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N44NREBESKJTXNOA6R4VBEZNGV","json":"https://pith.science/pith/N44NREBESKJTXNOA6R4VBEZNGV.json","graph_json":"https://pith.science/api/pith-number/N44NREBESKJTXNOA6R4VBEZNGV/graph.json","events_json":"https://pith.science/api/pith-number/N44NREBESKJTXNOA6R4VBEZNGV/events.json","paper":"https://pith.science/paper/N44NREBE"},"agent_actions":{"view_html":"https://pith.science/pith/N44NREBESKJTXNOA6R4VBEZNGV","download_json":"https://pith.science/pith/N44NREBESKJTXNOA6R4VBEZNGV.json","view_paper":"https://pith.science/paper/N44NREBE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0509161&json=true","fetch_graph":"https://pith.science/api/pith-number/N44NREBESKJTXNOA6R4VBEZNGV/graph.json","fetch_events":"https://pith.science/api/pith-number/N44NREBESKJTXNOA6R4VBEZNGV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N44NREBESKJTXNOA6R4VBEZNGV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N44NREBESKJTXNOA6R4VBEZNGV/action/storage_attestation","attest_author":"https://pith.science/pith/N44NREBESKJTXNOA6R4VBEZNGV/action/author_attestation","sign_citation":"https://pith.science/pith/N44NREBESKJTXNOA6R4VBEZNGV/action/citation_signature","submit_replication":"https://pith.science/pith/N44NREBESKJTXNOA6R4VBEZNGV/action/replication_record"}},"created_at":"2026-07-04T14:49:08.090725+00:00","updated_at":"2026-07-04T14:49:08.090725+00:00"}