{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:RXLB3NP2DNUCKWTKN34PBFJJBH","short_pith_number":"pith:RXLB3NP2","schema_version":"1.0","canonical_sha256":"8dd61db5fa1b68255a6a6ef8f0952909efeda492a6c07f56cf444705be6f988c","source":{"kind":"arxiv","id":"2103.04915","version":2},"attestation_state":"computed","paper":{"title":"Error mitigation for universal gates on encoded qubits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christophe Piveteau, David Sutter, Jay M. Gambetta, Kristan Temme, Sergey Bravyi","submitted_at":"2021-03-08T17:27:04Z","abstract_excerpt":"The Eastin-Knill theorem states that no quantum error correcting code can have a universal set of transversal gates. For CSS codes that can implement Clifford gates transversally it suffices to provide one additional non-Clifford gate, such as the T-gate, to achieve universality. Common methods to implement fault-tolerant T-gates like magic state distillation generate a significant hardware overhead that will likely prevent their practical usage in the near-term future. Recently methods have been developed to mitigate the effect of noise in shallow quantum circuits that are not protected by er"},"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":"2103.04915","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-03-08T17:27:04Z","cross_cats_sorted":[],"title_canon_sha256":"78d0ca5b7e1b3f19ba41bc24ae6fb15bf1fe9e37abc81876d0fc430a5dce1482","abstract_canon_sha256":"5e847e05f75777702e3e8593f280cc3360be0f9a09c30f92a8299ccca4a9dc12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:31:13.107385Z","signature_b64":"bx6hqiVQu8SovzWx5crtQ+WWj2SHk/ujI+nLcWa9GtUjCHSHn1D9E1EEfeHeOGZ/+BpkfULkuYApphwQLEHfCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8dd61db5fa1b68255a6a6ef8f0952909efeda492a6c07f56cf444705be6f988c","last_reissued_at":"2026-07-05T03:31:13.106861Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:31:13.106861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Error mitigation for universal gates on encoded qubits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christophe Piveteau, David Sutter, Jay M. Gambetta, Kristan Temme, Sergey Bravyi","submitted_at":"2021-03-08T17:27:04Z","abstract_excerpt":"The Eastin-Knill theorem states that no quantum error correcting code can have a universal set of transversal gates. For CSS codes that can implement Clifford gates transversally it suffices to provide one additional non-Clifford gate, such as the T-gate, to achieve universality. Common methods to implement fault-tolerant T-gates like magic state distillation generate a significant hardware overhead that will likely prevent their practical usage in the near-term future. Recently methods have been developed to mitigate the effect of noise in shallow quantum circuits that are not protected by er"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.04915","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2103.04915/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":"2103.04915","created_at":"2026-07-05T03:31:13.106921+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.04915v2","created_at":"2026-07-05T03:31:13.106921+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.04915","created_at":"2026-07-05T03:31:13.106921+00:00"},{"alias_kind":"pith_short_12","alias_value":"RXLB3NP2DNUC","created_at":"2026-07-05T03:31:13.106921+00:00"},{"alias_kind":"pith_short_16","alias_value":"RXLB3NP2DNUCKWTK","created_at":"2026-07-05T03:31:13.106921+00:00"},{"alias_kind":"pith_short_8","alias_value":"RXLB3NP2","created_at":"2026-07-05T03:31:13.106921+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.21276","citing_title":"Benchmarking a machine-learning differential equations solver on a neutral-atom logical processor","ref_index":57,"is_internal_anchor":false},{"citing_arxiv_id":"2508.10997","citing_title":"Reliable high-accuracy error mitigation for utility-scale quantum circuits","ref_index":33,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RXLB3NP2DNUCKWTKN34PBFJJBH","json":"https://pith.science/pith/RXLB3NP2DNUCKWTKN34PBFJJBH.json","graph_json":"https://pith.science/api/pith-number/RXLB3NP2DNUCKWTKN34PBFJJBH/graph.json","events_json":"https://pith.science/api/pith-number/RXLB3NP2DNUCKWTKN34PBFJJBH/events.json","paper":"https://pith.science/paper/RXLB3NP2"},"agent_actions":{"view_html":"https://pith.science/pith/RXLB3NP2DNUCKWTKN34PBFJJBH","download_json":"https://pith.science/pith/RXLB3NP2DNUCKWTKN34PBFJJBH.json","view_paper":"https://pith.science/paper/RXLB3NP2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.04915&json=true","fetch_graph":"https://pith.science/api/pith-number/RXLB3NP2DNUCKWTKN34PBFJJBH/graph.json","fetch_events":"https://pith.science/api/pith-number/RXLB3NP2DNUCKWTKN34PBFJJBH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RXLB3NP2DNUCKWTKN34PBFJJBH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RXLB3NP2DNUCKWTKN34PBFJJBH/action/storage_attestation","attest_author":"https://pith.science/pith/RXLB3NP2DNUCKWTKN34PBFJJBH/action/author_attestation","sign_citation":"https://pith.science/pith/RXLB3NP2DNUCKWTKN34PBFJJBH/action/citation_signature","submit_replication":"https://pith.science/pith/RXLB3NP2DNUCKWTKN34PBFJJBH/action/replication_record"}},"created_at":"2026-07-05T03:31:13.106921+00:00","updated_at":"2026-07-05T03:31:13.106921+00:00"}