{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:TX47CK4P4VGXRN6EFZKP5N466I","short_pith_number":"pith:TX47CK4P","schema_version":"1.0","canonical_sha256":"9df9f12b8fe54d78b7c42e54feb79ef2256d021180df2622796ec2829963db31","source":{"kind":"arxiv","id":"2008.00959","version":4},"attestation_state":"computed","paper":{"title":"Qudits and high-dimensional quantum computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Barry C. Sanders, Sabre Kais, Yuchen Wang, Zixuan Hu","submitted_at":"2020-07-30T22:17:43Z","abstract_excerpt":"Qudit is a multi-level computational unit alternative to the conventional 2-level qubit. Compared to qubit, qudit provides a larger state space to store and process information, and thus can provide reduction of the circuit complexity, simplification of the experimental setup and enhancement of the algorithm efficiency. This review provides an overview of qudit-based quantum computing covering a variety of topics ranging from circuit building, algorithm design, to experimental methods. We first discuss the qudit gate universality and a variety of qudit gates including the pi/8 gate, the SWAP g"},"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":"2008.00959","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-07-30T22:17:43Z","cross_cats_sorted":[],"title_canon_sha256":"ab1f70546ac8137bf63f8981b2fc73fcecd4f337005e66c6b364be3fbc18733c","abstract_canon_sha256":"aced549b91f4cd4977539e6ba7243db387e6983b1bf53e98ca8c00ab0719c4d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:50:58.829463Z","signature_b64":"QXE62c7NZkwjcWY22WybdgFBjZD6B4XEHPb5uYx1DbhFuBtjCrjYVR+ShArPwe09rx89jYCYg/7uxyl1V1HqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9df9f12b8fe54d78b7c42e54feb79ef2256d021180df2622796ec2829963db31","last_reissued_at":"2026-07-05T01:50:58.828971Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:50:58.828971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Qudits and high-dimensional quantum computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Barry C. Sanders, Sabre Kais, Yuchen Wang, Zixuan Hu","submitted_at":"2020-07-30T22:17:43Z","abstract_excerpt":"Qudit is a multi-level computational unit alternative to the conventional 2-level qubit. Compared to qubit, qudit provides a larger state space to store and process information, and thus can provide reduction of the circuit complexity, simplification of the experimental setup and enhancement of the algorithm efficiency. This review provides an overview of qudit-based quantum computing covering a variety of topics ranging from circuit building, algorithm design, to experimental methods. We first discuss the qudit gate universality and a variety of qudit gates including the pi/8 gate, the SWAP g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.00959","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/2008.00959/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":"2008.00959","created_at":"2026-07-05T01:50:58.829028+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.00959v4","created_at":"2026-07-05T01:50:58.829028+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.00959","created_at":"2026-07-05T01:50:58.829028+00:00"},{"alias_kind":"pith_short_12","alias_value":"TX47CK4P4VGX","created_at":"2026-07-05T01:50:58.829028+00:00"},{"alias_kind":"pith_short_16","alias_value":"TX47CK4P4VGXRN6E","created_at":"2026-07-05T01:50:58.829028+00:00"},{"alias_kind":"pith_short_8","alias_value":"TX47CK4P","created_at":"2026-07-05T01:50:58.829028+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24659","citing_title":"Preparing multi-qudit states in a definite-weight subspace","ref_index":46,"is_internal_anchor":false},{"citing_arxiv_id":"2606.24659","citing_title":"Preparing multi-qudit states in a definite-weight subspace","ref_index":46,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26792","citing_title":"Fault-Tolerant Resource Comparison of Qudit and Qubit Encodings for Diagonal Quadratic Operators","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26792","citing_title":"Fault-Tolerant Resource Comparison of Qudit and Qubit Encodings for Diagonal Quadratic Operators","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2604.22178","citing_title":"Signature of paraparticles: a minimal Gedankenexperiment","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06087","citing_title":"Gauss law codes and vacuum codes from lattice gauge theories","ref_index":70,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TX47CK4P4VGXRN6EFZKP5N466I","json":"https://pith.science/pith/TX47CK4P4VGXRN6EFZKP5N466I.json","graph_json":"https://pith.science/api/pith-number/TX47CK4P4VGXRN6EFZKP5N466I/graph.json","events_json":"https://pith.science/api/pith-number/TX47CK4P4VGXRN6EFZKP5N466I/events.json","paper":"https://pith.science/paper/TX47CK4P"},"agent_actions":{"view_html":"https://pith.science/pith/TX47CK4P4VGXRN6EFZKP5N466I","download_json":"https://pith.science/pith/TX47CK4P4VGXRN6EFZKP5N466I.json","view_paper":"https://pith.science/paper/TX47CK4P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.00959&json=true","fetch_graph":"https://pith.science/api/pith-number/TX47CK4P4VGXRN6EFZKP5N466I/graph.json","fetch_events":"https://pith.science/api/pith-number/TX47CK4P4VGXRN6EFZKP5N466I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TX47CK4P4VGXRN6EFZKP5N466I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TX47CK4P4VGXRN6EFZKP5N466I/action/storage_attestation","attest_author":"https://pith.science/pith/TX47CK4P4VGXRN6EFZKP5N466I/action/author_attestation","sign_citation":"https://pith.science/pith/TX47CK4P4VGXRN6EFZKP5N466I/action/citation_signature","submit_replication":"https://pith.science/pith/TX47CK4P4VGXRN6EFZKP5N466I/action/replication_record"}},"created_at":"2026-07-05T01:50:58.829028+00:00","updated_at":"2026-07-05T01:50:58.829028+00:00"}