{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2O4RQ77VNGBCIB235WZM4NDYGO","short_pith_number":"pith:2O4RQ77V","schema_version":"1.0","canonical_sha256":"d3b9187ff5698224075bedb2ce347833a48dce54215e26eb1ce1bbeda78b05dc","source":{"kind":"arxiv","id":"1406.3055","version":2},"attestation_state":"computed","paper":{"title":"Enhanced fault-tolerant quantum computing in $d$-level systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Earl T. Campbell","submitted_at":"2014-06-11T20:32:44Z","abstract_excerpt":"Error correcting codes protect quantum information and form the basis of fault tolerant quantum computing. Leading proposals for fault-tolerant quantum computation require codes with an exceedingly rare property, a transverse non-Clifford gate. Codes with the desired property are presented for $d$-level, qudit, systems with prime $d$. The codes use $n=d-1$ qudits and can detect upto $\\sim d/3$ errors. We quantify the performance of these codes for one approach to quantum computation, known as magic state distillation. Unlike prior work, we find performance is always enhanced by increasing $d$."},"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":"1406.3055","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-06-11T20:32:44Z","cross_cats_sorted":[],"title_canon_sha256":"463dd308fcd421a30f78d03554f08faeece76662aaff0a0a3bbed66c351749f0","abstract_canon_sha256":"2c37ce7d38d491e32c318062b5fcfc67020a7466f1e39fd3f24805ad57a29eb3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:43.379777Z","signature_b64":"C6iCKVsIsBlKs8I4n51H9CCBevnfBn4kExjQKU/2kv3kwjmFDnYC1vcHpYlVH/2bBSD1j4PxKqAl6s6E15JLCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3b9187ff5698224075bedb2ce347833a48dce54215e26eb1ce1bbeda78b05dc","last_reissued_at":"2026-05-18T01:30:43.379151Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:43.379151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enhanced fault-tolerant quantum computing in $d$-level systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Earl T. Campbell","submitted_at":"2014-06-11T20:32:44Z","abstract_excerpt":"Error correcting codes protect quantum information and form the basis of fault tolerant quantum computing. Leading proposals for fault-tolerant quantum computation require codes with an exceedingly rare property, a transverse non-Clifford gate. Codes with the desired property are presented for $d$-level, qudit, systems with prime $d$. The codes use $n=d-1$ qudits and can detect upto $\\sim d/3$ errors. We quantify the performance of these codes for one approach to quantum computation, known as magic state distillation. Unlike prior work, we find performance is always enhanced by increasing $d$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3055","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1406.3055","created_at":"2026-05-18T01:30:43.379242+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.3055v2","created_at":"2026-05-18T01:30:43.379242+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3055","created_at":"2026-05-18T01:30:43.379242+00:00"},{"alias_kind":"pith_short_12","alias_value":"2O4RQ77VNGBC","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"2O4RQ77VNGBCIB23","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"2O4RQ77V","created_at":"2026-05-18T12:28:11.866339+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2O4RQ77VNGBCIB235WZM4NDYGO","json":"https://pith.science/pith/2O4RQ77VNGBCIB235WZM4NDYGO.json","graph_json":"https://pith.science/api/pith-number/2O4RQ77VNGBCIB235WZM4NDYGO/graph.json","events_json":"https://pith.science/api/pith-number/2O4RQ77VNGBCIB235WZM4NDYGO/events.json","paper":"https://pith.science/paper/2O4RQ77V"},"agent_actions":{"view_html":"https://pith.science/pith/2O4RQ77VNGBCIB235WZM4NDYGO","download_json":"https://pith.science/pith/2O4RQ77VNGBCIB235WZM4NDYGO.json","view_paper":"https://pith.science/paper/2O4RQ77V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.3055&json=true","fetch_graph":"https://pith.science/api/pith-number/2O4RQ77VNGBCIB235WZM4NDYGO/graph.json","fetch_events":"https://pith.science/api/pith-number/2O4RQ77VNGBCIB235WZM4NDYGO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2O4RQ77VNGBCIB235WZM4NDYGO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2O4RQ77VNGBCIB235WZM4NDYGO/action/storage_attestation","attest_author":"https://pith.science/pith/2O4RQ77VNGBCIB235WZM4NDYGO/action/author_attestation","sign_citation":"https://pith.science/pith/2O4RQ77VNGBCIB235WZM4NDYGO/action/citation_signature","submit_replication":"https://pith.science/pith/2O4RQ77VNGBCIB235WZM4NDYGO/action/replication_record"}},"created_at":"2026-05-18T01:30:43.379242+00:00","updated_at":"2026-05-18T01:30:43.379242+00:00"}