{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:35ZYEZJB3KGCK6MNHYBF25XBM6","short_pith_number":"pith:35ZYEZJB","schema_version":"1.0","canonical_sha256":"df73826521da8c25798d3e025d76e167985b6cf6a69e0de881ea1478d1797157","source":{"kind":"arxiv","id":"2111.06432","version":3},"attestation_state":"computed","paper":{"title":"Quantum computing is scalable on a planar array of qubits with fabrication defects","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Armands Strikis, Benjamin J. Brown, Simon C. Benjamin","submitted_at":"2021-11-11T19:25:08Z","abstract_excerpt":"To successfully execute large-scale algorithms, a quantum computer will need to perform its elementary operations near perfectly. This is a fundamental challenge since all physical qubits suffer a considerable level of noise. Moreover, real systems are likely to have a finite yield, i.e. some non-zero proportion of the components in a complex device may be irredeemably broken at the fabrication stage. We present a threshold theorem showing that an arbitrarily large quantum computation can be completed with a vanishing probability of failure using a two-dimensional array of noisy qubits with a "},"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":"2111.06432","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-11-11T19:25:08Z","cross_cats_sorted":["cond-mat.stat-mech","cond-mat.str-el"],"title_canon_sha256":"4a4c72084164466b29f0cac295d5f1a6e5341e702765f437ec79426d07cbb3a6","abstract_canon_sha256":"9061d19b6f030c90656a4c26d1ae87373cfb126f3817f51d664ee62f7d98db15"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:25:36.640113Z","signature_b64":"rcHEqZWwEQxwUx+NmE6Cau3swnnp8xiN0H4oSSm5t5FUFtyzw+9z2VbTLsFVnLLrFf7PpgkCIFJ5YQPb0TyRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df73826521da8c25798d3e025d76e167985b6cf6a69e0de881ea1478d1797157","last_reissued_at":"2026-07-05T06:25:36.639756Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:25:36.639756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum computing is scalable on a planar array of qubits with fabrication defects","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Armands Strikis, Benjamin J. Brown, Simon C. Benjamin","submitted_at":"2021-11-11T19:25:08Z","abstract_excerpt":"To successfully execute large-scale algorithms, a quantum computer will need to perform its elementary operations near perfectly. This is a fundamental challenge since all physical qubits suffer a considerable level of noise. Moreover, real systems are likely to have a finite yield, i.e. some non-zero proportion of the components in a complex device may be irredeemably broken at the fabrication stage. We present a threshold theorem showing that an arbitrarily large quantum computation can be completed with a vanishing probability of failure using a two-dimensional array of noisy qubits with a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.06432","kind":"arxiv","version":3},"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/2111.06432/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":"2111.06432","created_at":"2026-07-05T06:25:36.639811+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.06432v3","created_at":"2026-07-05T06:25:36.639811+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.06432","created_at":"2026-07-05T06:25:36.639811+00:00"},{"alias_kind":"pith_short_12","alias_value":"35ZYEZJB3KGC","created_at":"2026-07-05T06:25:36.639811+00:00"},{"alias_kind":"pith_short_16","alias_value":"35ZYEZJB3KGCK6MN","created_at":"2026-07-05T06:25:36.639811+00:00"},{"alias_kind":"pith_short_8","alias_value":"35ZYEZJB","created_at":"2026-07-05T06:25:36.639811+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2211.07629","citing_title":"Assessing requirements to scale to practical quantum advantage","ref_index":132,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/35ZYEZJB3KGCK6MNHYBF25XBM6","json":"https://pith.science/pith/35ZYEZJB3KGCK6MNHYBF25XBM6.json","graph_json":"https://pith.science/api/pith-number/35ZYEZJB3KGCK6MNHYBF25XBM6/graph.json","events_json":"https://pith.science/api/pith-number/35ZYEZJB3KGCK6MNHYBF25XBM6/events.json","paper":"https://pith.science/paper/35ZYEZJB"},"agent_actions":{"view_html":"https://pith.science/pith/35ZYEZJB3KGCK6MNHYBF25XBM6","download_json":"https://pith.science/pith/35ZYEZJB3KGCK6MNHYBF25XBM6.json","view_paper":"https://pith.science/paper/35ZYEZJB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.06432&json=true","fetch_graph":"https://pith.science/api/pith-number/35ZYEZJB3KGCK6MNHYBF25XBM6/graph.json","fetch_events":"https://pith.science/api/pith-number/35ZYEZJB3KGCK6MNHYBF25XBM6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/35ZYEZJB3KGCK6MNHYBF25XBM6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/35ZYEZJB3KGCK6MNHYBF25XBM6/action/storage_attestation","attest_author":"https://pith.science/pith/35ZYEZJB3KGCK6MNHYBF25XBM6/action/author_attestation","sign_citation":"https://pith.science/pith/35ZYEZJB3KGCK6MNHYBF25XBM6/action/citation_signature","submit_replication":"https://pith.science/pith/35ZYEZJB3KGCK6MNHYBF25XBM6/action/replication_record"}},"created_at":"2026-07-05T06:25:36.639811+00:00","updated_at":"2026-07-05T06:25:36.639811+00:00"}