{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ERNHD45GBT4M53RDPXWBECYZY5","short_pith_number":"pith:ERNHD45G","schema_version":"1.0","canonical_sha256":"245a71f3a60cf8ceee237dec120b19c76920a2fad5f8b57e3e069d1273677b8b","source":{"kind":"arxiv","id":"1310.0863","version":1},"attestation_state":"computed","paper":{"title":"Optimal complexity correction of correlated errors in the surface code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Austin G. Fowler","submitted_at":"2013-10-02T23:16:22Z","abstract_excerpt":"The surface code is designed to suppress errors in quantum computing hardware and currently offers the most believable pathway to large-scale quantum computation. The surface code requires a 2-D array of nearest-neighbor coupled qubits that are capable of implementing a universal set of gates with error rates below approximately 1%, requirements compatible with experimental reality. Consequently, a number of authors are attempting to squeeze additional performance out of the surface code. We describe an optimal complexity error suppression algorithm, parallelizable to O(1) given constant 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":"1310.0863","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-10-02T23:16:22Z","cross_cats_sorted":[],"title_canon_sha256":"f2973e9218e53dcb22f32ae06065f11aa7daee8a5be1becbf9f1256c4a5061fa","abstract_canon_sha256":"49c957557c26eb6af2dc3d61ac1777198c67b0c0f4ab6706f2a618a90ee7d4f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:25.271118Z","signature_b64":"B+HP/J3ef8Qe8RQWiYvla4y2zamgplVsf2WAMc04xkq32Nm/TmU8lvta1+auTIRNgO3VyaaUX0HRknFYaeexBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"245a71f3a60cf8ceee237dec120b19c76920a2fad5f8b57e3e069d1273677b8b","last_reissued_at":"2026-05-18T03:11:25.270391Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:25.270391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal complexity correction of correlated errors in the surface code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Austin G. Fowler","submitted_at":"2013-10-02T23:16:22Z","abstract_excerpt":"The surface code is designed to suppress errors in quantum computing hardware and currently offers the most believable pathway to large-scale quantum computation. The surface code requires a 2-D array of nearest-neighbor coupled qubits that are capable of implementing a universal set of gates with error rates below approximately 1%, requirements compatible with experimental reality. Consequently, a number of authors are attempting to squeeze additional performance out of the surface code. We describe an optimal complexity error suppression algorithm, parallelizable to O(1) given constant compu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.0863","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":"1310.0863","created_at":"2026-05-18T03:11:25.270515+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.0863v1","created_at":"2026-05-18T03:11:25.270515+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.0863","created_at":"2026-05-18T03:11:25.270515+00:00"},{"alias_kind":"pith_short_12","alias_value":"ERNHD45GBT4M","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"ERNHD45GBT4M53RD","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"ERNHD45G","created_at":"2026-05-18T12:27:43.054852+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":9,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2312.03508","citing_title":"Convolutional neural network based decoders for surface codes","ref_index":29,"is_internal_anchor":true},{"citing_arxiv_id":"2605.17230","citing_title":"Maximum Likelihood Decoding of Quantum Error Correction Codes","ref_index":27,"is_internal_anchor":true},{"citing_arxiv_id":"2409.17595","citing_title":"Magic state cultivation: growing T states as cheap as CNOT gates","ref_index":165,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06547","citing_title":"Affine Subcode Ensemble Decoding for Degeneracy-Aware Quantum Error Correction","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05315","citing_title":"Two Layers, No Swaps: Biplanar SPOQC Architecture Improves Runtime of Fermi-Hubbard Simulation","ref_index":80,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01149","citing_title":"ADaPT: Adaptive-window Decoding for Practical fault-Tolerance","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2604.08358","citing_title":"Scalable Neural Decoders for Practical Fault-Tolerant Quantum Computation","ref_index":53,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06547","citing_title":"Affine Subcode Ensemble Decoding for Degeneracy-Aware Quantum Error Correction","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04049","citing_title":"FTPrimitiveBench: A Benchmark Suite For Logical Computation Under Hardware-Motivated and Biased Noise Models","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ERNHD45GBT4M53RDPXWBECYZY5","json":"https://pith.science/pith/ERNHD45GBT4M53RDPXWBECYZY5.json","graph_json":"https://pith.science/api/pith-number/ERNHD45GBT4M53RDPXWBECYZY5/graph.json","events_json":"https://pith.science/api/pith-number/ERNHD45GBT4M53RDPXWBECYZY5/events.json","paper":"https://pith.science/paper/ERNHD45G"},"agent_actions":{"view_html":"https://pith.science/pith/ERNHD45GBT4M53RDPXWBECYZY5","download_json":"https://pith.science/pith/ERNHD45GBT4M53RDPXWBECYZY5.json","view_paper":"https://pith.science/paper/ERNHD45G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.0863&json=true","fetch_graph":"https://pith.science/api/pith-number/ERNHD45GBT4M53RDPXWBECYZY5/graph.json","fetch_events":"https://pith.science/api/pith-number/ERNHD45GBT4M53RDPXWBECYZY5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ERNHD45GBT4M53RDPXWBECYZY5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ERNHD45GBT4M53RDPXWBECYZY5/action/storage_attestation","attest_author":"https://pith.science/pith/ERNHD45GBT4M53RDPXWBECYZY5/action/author_attestation","sign_citation":"https://pith.science/pith/ERNHD45GBT4M53RDPXWBECYZY5/action/citation_signature","submit_replication":"https://pith.science/pith/ERNHD45GBT4M53RDPXWBECYZY5/action/replication_record"}},"created_at":"2026-05-18T03:11:25.270515+00:00","updated_at":"2026-05-18T03:11:25.270515+00:00"}