{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:QNZVMAP3TLARNLLAUZAIG2OEQH","short_pith_number":"pith:QNZVMAP3","schema_version":"1.0","canonical_sha256":"83735601fb9ac116ad60a6408369c481c0e4ca536fc863992458f049c918e07b","source":{"kind":"arxiv","id":"0801.2360","version":1},"attestation_state":"computed","paper":{"title":"Subsystem stabilizer codes cannot have a universal set of transversal gates for even one encoded qudit","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew W. Cross, Bei Zeng, Hyeyoun Chung, Isaac L. Chuang, Xie Chen","submitted_at":"2008-01-15T18:47:48Z","abstract_excerpt":"A long-standing open problem in fault-tolerant quantum computation has been to find a universal set of transversal gates. As three of us proved in arXiv: 0706.1382, such a set does not exist for binary stabilizer codes. Here we generalize our work to show that for subsystem stabilizer codes in $d$ dimensional Hilbert space, such a universal set of transversal gates cannot exist for even one encoded qudit, for any dimension $d$, prime or nonprime. This result strongly supports the idea that other primitives, such as quantum teleportation, are necessary for universal fault-tolerant quantum compu"},"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":"0801.2360","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2008-01-15T18:47:48Z","cross_cats_sorted":[],"title_canon_sha256":"640b4d3ab5b7eaf6a0e5bcef8ffcd2ef6a904bd78cd3ada55eddd88e4132ff43","abstract_canon_sha256":"952cb8c089ce9aaa5e34f1a180d5cad76dc6d74ab0fbd8ccc2f5349efc6ad0dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:43.927639Z","signature_b64":"RYG5it17dwEoiUiwg6E+p9OhlqUknIUeK78Jj859AA4YTZkt4YiIuXeh7GEQV62saZrTO/Vn3YyUzAeoeYSXAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83735601fb9ac116ad60a6408369c481c0e4ca536fc863992458f049c918e07b","last_reissued_at":"2026-05-18T04:26:43.926980Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:43.926980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subsystem stabilizer codes cannot have a universal set of transversal gates for even one encoded qudit","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew W. Cross, Bei Zeng, Hyeyoun Chung, Isaac L. Chuang, Xie Chen","submitted_at":"2008-01-15T18:47:48Z","abstract_excerpt":"A long-standing open problem in fault-tolerant quantum computation has been to find a universal set of transversal gates. As three of us proved in arXiv: 0706.1382, such a set does not exist for binary stabilizer codes. Here we generalize our work to show that for subsystem stabilizer codes in $d$ dimensional Hilbert space, such a universal set of transversal gates cannot exist for even one encoded qudit, for any dimension $d$, prime or nonprime. This result strongly supports the idea that other primitives, such as quantum teleportation, are necessary for universal fault-tolerant quantum compu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0801.2360","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":""},"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":"0801.2360","created_at":"2026-05-18T04:26:43.927085+00:00"},{"alias_kind":"arxiv_version","alias_value":"0801.2360v1","created_at":"2026-05-18T04:26:43.927085+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0801.2360","created_at":"2026-05-18T04:26:43.927085+00:00"},{"alias_kind":"pith_short_12","alias_value":"QNZVMAP3TLAR","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"QNZVMAP3TLARNLLA","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"QNZVMAP3","created_at":"2026-05-18T12:25:58.018023+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.16254","citing_title":"Fortuity and Complexity in a Simple Quark Model","ref_index":52,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QNZVMAP3TLARNLLAUZAIG2OEQH","json":"https://pith.science/pith/QNZVMAP3TLARNLLAUZAIG2OEQH.json","graph_json":"https://pith.science/api/pith-number/QNZVMAP3TLARNLLAUZAIG2OEQH/graph.json","events_json":"https://pith.science/api/pith-number/QNZVMAP3TLARNLLAUZAIG2OEQH/events.json","paper":"https://pith.science/paper/QNZVMAP3"},"agent_actions":{"view_html":"https://pith.science/pith/QNZVMAP3TLARNLLAUZAIG2OEQH","download_json":"https://pith.science/pith/QNZVMAP3TLARNLLAUZAIG2OEQH.json","view_paper":"https://pith.science/paper/QNZVMAP3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0801.2360&json=true","fetch_graph":"https://pith.science/api/pith-number/QNZVMAP3TLARNLLAUZAIG2OEQH/graph.json","fetch_events":"https://pith.science/api/pith-number/QNZVMAP3TLARNLLAUZAIG2OEQH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QNZVMAP3TLARNLLAUZAIG2OEQH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QNZVMAP3TLARNLLAUZAIG2OEQH/action/storage_attestation","attest_author":"https://pith.science/pith/QNZVMAP3TLARNLLAUZAIG2OEQH/action/author_attestation","sign_citation":"https://pith.science/pith/QNZVMAP3TLARNLLAUZAIG2OEQH/action/citation_signature","submit_replication":"https://pith.science/pith/QNZVMAP3TLARNLLAUZAIG2OEQH/action/replication_record"}},"created_at":"2026-05-18T04:26:43.927085+00:00","updated_at":"2026-05-18T04:26:43.927085+00:00"}