{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RNNSK3M7PBTPA5RDVWW7LRWAWE","short_pith_number":"pith:RNNSK3M7","schema_version":"1.0","canonical_sha256":"8b5b256d9f7866f07623adadf5c6c0b107aecf97e1178c870a76f5ce2210e8d0","source":{"kind":"arxiv","id":"1309.3310","version":1},"attestation_state":"computed","paper":{"title":"Using concatenated quantum codes for universal fault-tolerant quantum gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Raymond Laflamme, Tomas Jochym-O'Connor","submitted_at":"2013-09-12T21:19:37Z","abstract_excerpt":"We propose a method for universal fault-tolerant quantum computation using concatenated quantum error correcting codes. Namely, other than computational basis state preparation as required by the DiVincenzo criteria [1], our scheme requires no special ancillary state preparation to achieve universality, as opposed to schemes such as magic state distillation. The concatenation scheme exploits the transversal properties of two different codes, combining them to provide a means to protect against low-weight arbitrary errors. We give the required properties of the error correcting codes to ensure "},"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":"1309.3310","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-09-12T21:19:37Z","cross_cats_sorted":[],"title_canon_sha256":"ac173266a6f1356362e3f8dc25d0c656c3b9550b4cf3a596abfd61d7ba332670","abstract_canon_sha256":"5194abb9aad1367fa96769e3a5ac05c9e0a18dfbddda9e4f612d85470e97ebb1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:11.177218Z","signature_b64":"2XtQZx4B1lgJ6vVGGUmbVpXLk2Xup+dpXoiLe/9VRe4Nhv4DxK5OWLJ1A8WECp/3eg5yFvCr+i5B27IrKw1DAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b5b256d9f7866f07623adadf5c6c0b107aecf97e1178c870a76f5ce2210e8d0","last_reissued_at":"2026-05-18T02:55:11.176738Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:11.176738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using concatenated quantum codes for universal fault-tolerant quantum gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Raymond Laflamme, Tomas Jochym-O'Connor","submitted_at":"2013-09-12T21:19:37Z","abstract_excerpt":"We propose a method for universal fault-tolerant quantum computation using concatenated quantum error correcting codes. Namely, other than computational basis state preparation as required by the DiVincenzo criteria [1], our scheme requires no special ancillary state preparation to achieve universality, as opposed to schemes such as magic state distillation. The concatenation scheme exploits the transversal properties of two different codes, combining them to provide a means to protect against low-weight arbitrary errors. We give the required properties of the error correcting codes to ensure "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3310","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":"1309.3310","created_at":"2026-05-18T02:55:11.176806+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.3310v1","created_at":"2026-05-18T02:55:11.176806+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3310","created_at":"2026-05-18T02:55:11.176806+00:00"},{"alias_kind":"pith_short_12","alias_value":"RNNSK3M7PBTP","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"RNNSK3M7PBTPA5RD","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"RNNSK3M7","created_at":"2026-05-18T12:27:59.945178+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.01880","citing_title":"Magic states are rarely the best resource to optimize: An analytical tool for qubit resource estimation in concatenated codes","ref_index":39,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RNNSK3M7PBTPA5RDVWW7LRWAWE","json":"https://pith.science/pith/RNNSK3M7PBTPA5RDVWW7LRWAWE.json","graph_json":"https://pith.science/api/pith-number/RNNSK3M7PBTPA5RDVWW7LRWAWE/graph.json","events_json":"https://pith.science/api/pith-number/RNNSK3M7PBTPA5RDVWW7LRWAWE/events.json","paper":"https://pith.science/paper/RNNSK3M7"},"agent_actions":{"view_html":"https://pith.science/pith/RNNSK3M7PBTPA5RDVWW7LRWAWE","download_json":"https://pith.science/pith/RNNSK3M7PBTPA5RDVWW7LRWAWE.json","view_paper":"https://pith.science/paper/RNNSK3M7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.3310&json=true","fetch_graph":"https://pith.science/api/pith-number/RNNSK3M7PBTPA5RDVWW7LRWAWE/graph.json","fetch_events":"https://pith.science/api/pith-number/RNNSK3M7PBTPA5RDVWW7LRWAWE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RNNSK3M7PBTPA5RDVWW7LRWAWE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RNNSK3M7PBTPA5RDVWW7LRWAWE/action/storage_attestation","attest_author":"https://pith.science/pith/RNNSK3M7PBTPA5RDVWW7LRWAWE/action/author_attestation","sign_citation":"https://pith.science/pith/RNNSK3M7PBTPA5RDVWW7LRWAWE/action/citation_signature","submit_replication":"https://pith.science/pith/RNNSK3M7PBTPA5RDVWW7LRWAWE/action/replication_record"}},"created_at":"2026-05-18T02:55:11.176806+00:00","updated_at":"2026-05-18T02:55:11.176806+00:00"}