PhysicsarXiv

Ranked by formulaVerdict: Notable

Quantum error correction well below the color code threshold

Quantum error correction enables scalable fault-tolerant quantum computation by suppressing logical errors exponentially with code distance once physical error rates fall below a critical threshold.

By Lavasani, Reed, Dreiling +20

Score████░░░░░░4.2

Key numbers

  • 4 x 10
  • 3 x 10

Caveats

  • Preprint; not yet peer reviewed.

VerdictWorth a reader's time today.

Read the originalPDF

Abstract

Quantum error correction enables scalable fault-tolerant quantum computation by suppressing logical errors exponentially with code distance once physical error rates fall below a critical threshold. Here we demonstrate below-threshold operation of triangular color codes with distances d=3,5, and $7$ on Quantinuum's Helios trapped-ion quantum processor. Leveraging both circuit- and hardware- level leakage reduction schemes, we achieve logical error rates as low as 5₋₂⁺⁴× 10⁻⁶, and demonstrate error suppression by over an order of magnitude, Λ=12₋₂⁺³, with each successive increase in code distance. Moreover, we demonstrate below threshold scaling of error rates for Clifford two-qubit randomized benchmarking circuits when encoded in d=3,5 color codes, achieving logical error rate of 7⁺³₋₃× 10⁻⁵ per logical two-qubit Clifford at distance $5$ with a suppression factor of Λ=9₋₃⁺⁸. We compare logical performance for existing near-optimal algorithmic decoders, and both convolutional neural network and transformer-based neural network decoders capable of real-time decoding an order of magnitude faster than the syndrome extraction rate. These results approach the logical error rates required for megaquop-scale quantum computation and indicate that scaled trapped-ion processors could reach application-relevant performance with substantially smaller code blocks than indicated by previous results in other qubit modalities.

Ali Lavasani, Adam P. Reed, Joan M. Dreiling, Annie J. Park, Michael Mills, Matteo Puviani, Gabriel Matos, M. S. Allman, Noah Berthusen, Natalie C. Brown, Victor E. Colussi, Brian Estey, Cameron Foltz, Daniel Gresh, Reza Haghshenas, Akhil Isanaka, Nikhil Kotibhaskar, Anthony Ransford, Ciarán Ryan-Anderson, Brian Neyenhuis, David Hayes, Tzvetan S. Metodi, Andrew C. Potter

The editor's rubric

Heuristic review

Leverage3 / 5
A method or resource many groups across the field will adopt within a year.
18% of this desk’s rubric
Magnitude3 / 5
Large gain: roughly 2x, or a clear new state of the art on a hard, unsaturated problem.
20% of this desk’s rubric
Evidence3 / 5
Solid: multiple benchmarks or cohorts, ablations, fair baselines, released code or data.
22% of this desk’s rubric
Novelty2 / 5
A new combination of known ideas.
22% of this desk’s rubric
Trajectory3 / 5
A clear path to scale.
10% of this desk’s rubric
Stakes2 / 5
Benefits a professional community (practitioners, clinicians, engineers).
8% of this desk’s rubric

Editor’s rationale

Heuristic triage from title and abstract text only, not a reading of the paper. Cues found: method (we report); gains (orders of magnitude); firsts (new capability); design (randomized); scale (scalable, orders of magnitude, efficient). Red flags: derivative (comparative study).

How the score was computed

rank-2026-10-18

Score████░░░░░░4.2

Score = 10 × (75% × adjusted merit / 10 + 15% × attention + 10% × freshness)

Desks place stronger verdicts first, then use this score to order work within the same verdict.

Merit
5.4 / 10
Weighted rubric, evidence-gated.
Adjusted merit
4.6 / 10
Shrunk toward the desk prior by editor confidence (44%).
Attention
0%
Citations, upvotes, points, mentions.
Freshness
70%
Half-life decay since publication.

No attention signals recorded yet.

The record

  • Reviewed by heuristic-v7 on Oct 20, 2026, 07:29 UTC. Paper type: method.
  • Categories: quant-ph
  • BRIEF, No.7 in the Physics edition of October 20, 2026.