Skip to content
RESEARCH · QUANTUM ERROR MITIGATION

Google’s Quantum Error Records Could Get a Second Life After the Run

An October 8 simulation preprint proposes virtual error cancellation using stored syndrome records. The useful question is how much accuracy offline analysis buys after its full cost is counted.

Published Source report Sources checked
My reading list
A packaged Google Sycamore chip on a museum display surface.
Google’s Sycamore quantum chip on display at the Deutsches Museum in Munich, photographed November 4, 2025. Archival hardware context: the VEC preprint reports simulations, not an experiment on this device.Coldupnorth / CC BY-SA 4.0 · CC BY-SA 4.0Full image credit

A quantum experiment can leave behind two useful things: its answer and the record used to diagnose errors along the way. Google-affiliated researchers now propose getting more from that second output. Their October 8 virtual error cancellation preprint asks whether stored records can improve an estimate after the processor has finished. Its evidence is simulation and theory.[1][2]

Two clocks, two kinds of evidence

The practical distinction is between protecting a calculation while it runs and improving the estimate drawn from its results afterward. Google’s earlier Willow study directly measured protected quantum memories on hardware. It also showed why classical decoding has a timing problem: decisions must keep pace with repeated error checks. The VEC proposal explores what a slower second analysis can contribute once that deadline has passed.[2][3]

VEC stores the syndrome record, the error checks associated with each run, alongside the final measurement outcome. A fast decoder serves the running circuit. An offline decoder revisits the records, and their agreement or disagreement groups the runs. Classical weights then change how much each group contributes to the final estimate.[2]

Keep the disputed runs

Some contributions receive negative weights. This is a statistical cancellation step, not a negative measurement or a repaired . The estimate can reduce logical bias without discarding every disputed run. The authors also learn noise information from the stored records, avoiding separate calibration circuits in their proposed workflow.[2]

Figure 1 lays out this proposed sequence. Every panel is schematic, including its circuit, processor layout and cost curves. The archival Sycamore photograph above provides Google hardware context only; the preprint does not report running VEC on that displayed chip.[2]

Schematic showing stored quantum error records flowing through noise learning, comparison of two decoders, and weighted classical post-processing.
Conceptual schematic from Figure 1 of Shtanko et al., arXiv:2610.12400v1 (October 8, 2026). All panels are schematic, including the circuit layout and cost curves; this is not a hardware photograph or experimental performance plot.Shtanko, Roy, Kumar & Minev / CC BY 4.0 · CC BY 4.0Full image credit

What the headline number measures

The reported end-to-end distance-seven surface-code simulations suppress residual logical error by more than three orders of magnitude relative to the decoded logical error rate. That is a comparison between estimators under a specified model. It is not a thousandfold processor speed-up, an application advantage or a newly demonstrated logical computer.[2]

Cancellation has a sampling cost: reweighting can increase statistical uncertainty, requiring more repetitions for a chosen precision. The numerical benchmarks use code-capacity depolarizing noise. The paper identifies testing realistic circuit-level noise as a next step. Errors accumulated through a complete noisy execution therefore remain an important boundary on what these simulations establish.[2]

Price the answer in work, not adjectives

QubitWire’s analysis: the decision metric should be total work per trustworthy answer. A smaller bias can be valuable even if post-processing takes longer, but those improvements need a shared accuracy target. Otherwise a reader cannot tell whether a more impressive error number reflects a more useful computation or simply a larger analysis budget.[2][3]

A useful comparison would give standard decoding, postselection and VEC the same target accuracy, then report repetitions, stored-data volume and offline compute time. Noise-learning data should count toward that budget too. These are proposed evaluation criteria, not measurements supplied by this article or a claim that one method already wins on a real processor.[2]

The next test

The next revealing test is to move beyond the paper’s code-capacity benchmark, then test hardware records while reporting the complete resource bill. Can the gain survive circuit-level faults and changing noise? Does the second decoder still help when its time and memory use count? Those questions would connect an attractive estimator to an experimentally useful workflow.[2]

For teams collecting data, the broader lesson is to treat the diagnostic record as a possible research asset. For everyone assessing the result, keep the claims separate: Willow’s measured memory protection is historical hardware evidence; VEC is a new proposal for using classical work after execution. Neither makes the other result more experimentally complete.[1][2][3]

Keep your reading trail

Your Updates →

Evidence & context

3 linked sources

Google-affiliated research preprint; theoretical analysis and code-capacity numerical simulations. Abstract and full text are one source family. Historical Willow hardware research provides context, not independent VEC replication. No new VEC hardware experiment or application advantage is claimed.

How to read the evidence and dates

An announcement records what an organization stated. An experiment reports an observation. A simulation or resource estimate depends on its assumptions. QubitWire’s analysis connects these sources; the labels are not quality scores.

Published is the article’s first QubitWire publication. Updated marks a substantive content change. Sources checked records a review of the underlying evidence. An older paper can support a new explanation, and another press release about the same work is not independent replication.

QubitWire take

An error record can remain useful after the quantum run ends. The practical test is whether offline mitigation reaches a trustworthy answer with a better total budget for sampling, storage and classical computation.

Sources

  1. Original October 8 VEC preprint record

    Submission date and abstract. This and the full text are one research source family, not independent confirmation.

  2. Shtanko et al.: VEC methods, numerical tests and limitations

    arXiv:2610.12400v1. Google-affiliated research; code-capacity simulations, not a reported VEC hardware experiment. Figure 1 is schematic.

  3. Google Quantum AI: Quantum error correction below the surface code threshold

    Separate historical hardware study, published December 9, 2024 and corrected April 28, 2026. Comparison context; not a replication of VEC.

READ NEXT

Continue exploring

All Research stories
  1. Related reading

    A Neural Decoder Learned More Quantum Tasks. Can It Keep Up With the Hardware?

    An October 2 preprint reports modular neural decoding of IBM memory and lattice-surgery experiments. Reusing the architecture reduces redesign, but live processing speed remains unmeasured.

    Published · Source report · Sources checked
  2. Related reading

    A QEC Error Map Says Fix the 5% of Components That Hurt Most

    Tsinghua simulations rank each circuit component by its contribution to logical failure, then show targeted improvements beat the same budget spent at random.

    Published · Source report · Sources checked
THE QUANTUM BRIEFING

A clearer signal.
Read the latest edition.

A little perspective on a fast-moving field.

Read the on-site briefing →

Read selected quantum coverage in the on-site briefing, or register your interest below.