{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:TYLF7XQILZSTMHWIYL5HOPWSBY","short_pith_number":"pith:TYLF7XQI","schema_version":"1.0","canonical_sha256":"9e165fde085e65361ec8c2fa773ed20e082fa984da1e4b478fb14abd47cc4231","source":{"kind":"arxiv","id":"1208.0928","version":2},"attestation_state":"computed","paper":{"title":"Surface codes: Towards practical large-scale quantum computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew N. Cleland, Austin G. Fowler, John M. Martinis, Matteo Mariantoni","submitted_at":"2012-08-04T13:37:57Z","abstract_excerpt":"This article provides an introduction to surface code quantum computing. We first estimate the size and speed of a surface code quantum computer. We then introduce the concept of the stabilizer, using two qubits, and extend this concept to stabilizers acting on a two-dimensional array of physical qubits, on which we implement the surface code. We next describe how logical qubits are formed in the surface code array and give numerical estimates of their fault-tolerance. We outline how logical qubits are physically moved on the array, how qubit braid transformations are constructed, and how a br"},"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":"1208.0928","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-08-04T13:37:57Z","cross_cats_sorted":[],"title_canon_sha256":"dd48813e1f3cfd5128c5876757da71989b8a9d15cba1c2e15d82e2fca42e6b17","abstract_canon_sha256":"14993f913ac20468083464ad10e1fba4321745b4a5745a3e45917008f979dd0a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:11.074549Z","signature_b64":"bxUmxanA0I/6V6gCfTsAa+yiXFxLd9VqTmZ39tiN1cbYyffZkqPBfiw/ELQ5NZuBUAppYoSQIzvg9UROBfehAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e165fde085e65361ec8c2fa773ed20e082fa984da1e4b478fb14abd47cc4231","last_reissued_at":"2026-05-18T03:42:11.073945Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:11.073945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Surface codes: Towards practical large-scale quantum computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew N. Cleland, Austin G. Fowler, John M. Martinis, Matteo Mariantoni","submitted_at":"2012-08-04T13:37:57Z","abstract_excerpt":"This article provides an introduction to surface code quantum computing. We first estimate the size and speed of a surface code quantum computer. We then introduce the concept of the stabilizer, using two qubits, and extend this concept to stabilizers acting on a two-dimensional array of physical qubits, on which we implement the surface code. We next describe how logical qubits are formed in the surface code array and give numerical estimates of their fault-tolerance. We outline how logical qubits are physically moved on the array, how qubit braid transformations are constructed, and how a br"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0928","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":"1208.0928","created_at":"2026-05-18T03:42:11.074057+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.0928v2","created_at":"2026-05-18T03:42:11.074057+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0928","created_at":"2026-05-18T03:42:11.074057+00:00"},{"alias_kind":"pith_short_12","alias_value":"TYLF7XQILZST","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"TYLF7XQILZSTMHWI","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"TYLF7XQI","created_at":"2026-05-18T12:27:23.164592+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2605.23738","citing_title":"Optimizing Parallel Execution of Commuting Pauli Product Rotations","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2604.26792","citing_title":"Fault-Tolerant Resource Comparison of Qudit and Qubit Encodings for Diagonal Quadratic Operators","ref_index":50,"is_internal_anchor":true},{"citing_arxiv_id":"2602.20238","citing_title":"Proof of a finite threshold for the union-find decoder","ref_index":29,"is_internal_anchor":true},{"citing_arxiv_id":"2604.26792","citing_title":"Fault-Tolerant Resource Comparison of Qudit and Qubit Encodings for Diagonal Quadratic Operators","ref_index":50,"is_internal_anchor":false},{"citing_arxiv_id":"2602.11457","citing_title":"The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TYLF7XQILZSTMHWIYL5HOPWSBY","json":"https://pith.science/pith/TYLF7XQILZSTMHWIYL5HOPWSBY.json","graph_json":"https://pith.science/api/pith-number/TYLF7XQILZSTMHWIYL5HOPWSBY/graph.json","events_json":"https://pith.science/api/pith-number/TYLF7XQILZSTMHWIYL5HOPWSBY/events.json","paper":"https://pith.science/paper/TYLF7XQI"},"agent_actions":{"view_html":"https://pith.science/pith/TYLF7XQILZSTMHWIYL5HOPWSBY","download_json":"https://pith.science/pith/TYLF7XQILZSTMHWIYL5HOPWSBY.json","view_paper":"https://pith.science/paper/TYLF7XQI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.0928&json=true","fetch_graph":"https://pith.science/api/pith-number/TYLF7XQILZSTMHWIYL5HOPWSBY/graph.json","fetch_events":"https://pith.science/api/pith-number/TYLF7XQILZSTMHWIYL5HOPWSBY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TYLF7XQILZSTMHWIYL5HOPWSBY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TYLF7XQILZSTMHWIYL5HOPWSBY/action/storage_attestation","attest_author":"https://pith.science/pith/TYLF7XQILZSTMHWIYL5HOPWSBY/action/author_attestation","sign_citation":"https://pith.science/pith/TYLF7XQILZSTMHWIYL5HOPWSBY/action/citation_signature","submit_replication":"https://pith.science/pith/TYLF7XQILZSTMHWIYL5HOPWSBY/action/replication_record"}},"created_at":"2026-05-18T03:42:11.074057+00:00","updated_at":"2026-05-18T03:42:11.074057+00:00"}