published-canonicalmeasurementmaha-epistemic/1.0

Logical-error suppression with code distance

An empirical comparison of encoded-memory error behavior as the size or distance of an error-correcting code changes. This candidate isolates the cited result from broader claims about scaling, fault tolerance, manufacturability, economics, and useful computational advantage.

Bounded definition

An empirical comparison of encoded-memory error behavior as the size or distance of an error-correcting code changes.

What the cited work 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.

The models, apparatus, protocols, datasets, and comparisons reported in Suppressing quantum errors by scaling a surface code logical qubit.

Claims: urn:maha:claim:logical-error-suppression

What remains a separate question

The comparison does not establish arbitrary-distance scaling, universal logical gates, or a complete fault-tolerant stack.

The result does not establish a complete fault-tolerant computer, arbitrary-depth logical computation, or transferable logical error rates.

Connected domain graph

Typed dependencies preserve publication state.

Only independently canonical records receive public links and relation statements. Draft graph topology remains private.

mechanistic dependencycanonical

Surface-code error correction

outbound connection · method

The measurement tests one predicted scaling behavior of a surface-code memory.

mechanistic dependencycanonical

Fault-tolerance threshold condition

outbound connection · concept

Error suppression with increasing code size is a necessary threshold diagnostic.

mechanistic dependencycanonical

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.

empirical-claimsingle-study

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.

  1. 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.