Bounded definition
The cited experiment reports lower logical error per cycle for a larger surface-code memory than for a smaller one under the stated circuit, device, and decoder. Within this page, that proposition is limited to The models, apparatus, protocols, datasets, and comparisons reported in Suppressing quantum errors by scaling a surface code logical qubit.
Definition and evidence boundary
An empirical comparison of encoded-memory error behavior as the size or distance of an error-correcting code changes. The bounded proposition retained by the canonical record is: The cited experiment reports lower logical error per cycle for a larger surface-code memory than for a smaller one under the stated circuit, device, and decoder.
The applicable scope is The models, apparatus, protocols, datasets, and comparisons reported in Suppressing quantum errors by scaling a surface code logical qubit. This definition must not be generalized beyond the cited source and exact record boundary.
Claims: urn:maha:claim:logical-error-suppression
Mechanism and technical context
The experiment compares surface-code memories of different distances on a superconducting processor and reports the measured logical-error behavior under the stated circuits and decoder. This is the source-bound technical context for the record; no uncited mechanism is added by the compiler.
The comparison does not establish arbitrary-distance scaling, universal logical gates, or a complete fault-tolerant stack. The mechanism or method is therefore presented as one component of a larger system, not as evidence for every downstream outcome.
Claims: urn:maha:claim:logical-error-suppression
How to interpret the evidence
No platform-independent uncertainty interval exists; numerical values remain attached to the source experiment or model and its stated assumptions. The evidence maturity recorded here is single study, and the claim kind is empirical claim.
This candidate records one bounded source package. Independent replications and contradictory measurements must be compiled as separate records before maturity is upgraded. The result does not establish a complete fault-tolerant computer, arbitrary-depth logical computation, or transferable logical error rates. These qualifications travel with the claim whenever it is reused.
Claims: urn:maha:claim:logical-error-suppression
What the source supports and what remains unknown
The inspected source supports exactly this: The experiment compares surface-code memories of different distances on a superconducting processor and reports the measured logical-error behavior under the stated circuits and decoder. It was read at Abstract; Figures 1–4; Methods; Extended Data.
What remains unknown is everything outside that locator. The comparison does not establish arbitrary-distance scaling, universal logical gates, or a complete fault-tolerant stack. No quantity, comparison, or downstream outcome is established here unless a separately scoped record measures it.
Claims: urn:maha:claim:logical-error-suppression
Source identity, locator, and reuse boundary
The bound source is “Suppressing quantum errors by scaling a surface code logical qubit” by Rajeev Acharya, Igor Aleiner, Richard Allen, Trond I. Andersen, et al., published by Nature on 2023-02-22; its declared stable identity is doi:10.1038/s41586-022-05434-1.
The inspected-content locator is Abstract; Figures 1–4; Methods; Extended Data. Reuse is limited to citation-with-paraphrase. Maha paraphrases the source-level result and links to the version of record; no article passage is reproduced. This metadata establishes source identity and inspection scope, not the truth of claims outside the cited locator.
Claims: urn:maha:claim:logical-error-suppression
Comparison and calculation boundary
Applicability is decided explicitly, not filled with generic material.
This record carries 1 source-bound proposition and therefore has no second supported side. A comparison would have to be manufactured from an adjacent title rather than from a second inspected claim, which the gate forbids.
The canonical claim declares no reproducible numerical inputs, equation, units, or uncertainty propagation; recorded uncertainty kind is qualitative. Supplying sample values would invent an unsupported quantitative result.
Limitations and prohibited inference
The claim stops where its evidence stops.
- record boundary
The comparison does not establish arbitrary-distance scaling, universal logical gates, or a complete fault-tolerant stack.
- record boundary
A source-bounded mechanism, method, or measurement record does not establish manufacturing yield, economic advantage, safety, clinical benefit, or commercial readiness unless those outcomes are measured in a separately scoped record.
- prohibited inference
Do not infer general quantum-computing readiness from the logical-error suppression with code distance record alone.
- prohibited inference
Do not transfer a reported result across hardware, organisms, protocols, datasets, operating conditions, or outcome definitions without a declared comparison contract.
- editorial
This compilation reorganizes an existing inspected claim and its declared source; it does not add a new experiment, measurement, or independent replication.
- editorial
Internal editorial inspection is not external peer review, and no result on this page has been independently reproduced.
Related records and mathematical bridges
Typed links expose context without asserting equivalence.
Circuit quantum electrodynamics
Same canonical domain (quantum-systems). Domain membership only: no shared source or declared edge links these two records.
Selection: domain adjacency
Fault-tolerance threshold condition
Declared mechanistic-dependency edge from this record. The edge is navigational and asserts no equivalence or causation beyond the cited source scope.
Selection: bridge edge
Surface-code error correction
Declared mechanistic-dependency edge from this record. The edge is navigational and asserts no equivalence or causation beyond the cited source scope.
Selection: bridge edge
When no declared bridge edge is present, related records are linked by shared evidence or canonical domain adjacency. Those links are navigational and do not claim mathematical or physical equivalence.
Connected domain graph
Typed dependencies preserve publication state.
Only independently canonical records receive public links and relation statements. Draft graph topology remains private.
Surface-code error correction
outbound connection · method
The measurement tests one predicted scaling behavior of a surface-code memory.
Fault-tolerance threshold condition
outbound connection · concept
Error suppression with increasing code size is a necessary threshold diagnostic.
Fault-tolerance threshold condition
inbound connection · concept
Empirical logical-error scaling tests whether a physical implementation exhibits the required trend.
Claim ledger
Every proposition keeps its own evidence state.
The cited experiment reports lower logical error per cycle for a larger surface-code memory than for a smaller one under the stated circuit, device, and decoder.
- Scope
- The models, apparatus, protocols, datasets, and comparisons reported in Suppressing quantum errors by scaling a surface code logical qubit.
- Boundary
- The comparison does not establish arbitrary-distance scaling, universal logical gates, or a complete fault-tolerant stack.
- Uncertainty
- No platform-independent uncertainty interval exists; numerical values remain attached to the source experiment or model and its stated assumptions.
- Replication
- This candidate records one bounded source package. Independent replications and contradictory measurements must be compiled as separate records before maturity is upgraded.
Primary sources
Citation, locator, rights, and boundary travel together.
Source 1 · Nature
Suppressing quantum errors by scaling a surface code logical qubit
Rajeev Acharya, Igor Aleiner, Richard Allen, Trond I. Andersen, et al.
- Exact locator
- Abstract; Figures 1–4; Methods; Extended Data.
- Establishes
- The experiment compares surface-code memories of different distances on a superconducting processor and reports the measured logical-error behavior under the stated circuits and decoder.
- Boundary
- The result does not establish a complete fault-tolerant computer, arbitrary-depth logical computation, or transferable logical error rates.
- Rights basis
- citation with paraphrase · Maha paraphrases the source-level result and links to the version of record; no article passage is reproduced.
- Declared interests
- Most authors were affiliated with Google Quantum AI and the experiment used Google hardware.