Magic state cultivation on a superconducting quantum processor

Original title: Magic state cultivation on a superconducting quantum processor.

Fault-tolerant quantum computing requires a universal gate set, but the necessary non-Clifford gates represent a significant resource cost for most quantum error correction architectures.

By Rosenfeld, Gidney, Roberts +197Science (New York, N.Y.)Oct 15, 2026

Score█████░░░░░5.1

Key numbers

8% of attempts

VerdictWorth a reader's time today.

Read the original

Abstract

Fault-tolerant quantum computing requires a universal gate set, but the necessary non-Clifford gates represent a significant resource cost for most quantum error correction architectures. Magic state cultivation offers an efficient alternative to resource-intensive distillation protocols; however, testing the proposal's assumptions represents a challenging departure from quantum memory experiments. We present an experimental study of magic state cultivation on a superconducting quantum processor. We implement cultivation, including code-switching into a surface code, and develop a fault-tolerant measurement protocol to bound the magic state fidelity. Cultivation reduces the error by a factor of 40, with a state fidelity of at least 0.9999(1) (retaining 8% of attempts). Our results experimentally establish magic state cultivation as a viable solution to one of quantum computing's most important challenges.

E Rosenfeld, C Gidney, G Roberts, A Morvan, N Lacroix, D Kafri, J Marshall, M Li, V Sivak, D Abanin, A Abbas, R Acharya, L Aghababaie Beni, G Aigeldinger, R Alcaraz, S Alcaraz, T I Andersen, M Ansmann, F Arute, K Arya, W Askew, N Astrakhantsev, J Atalaya, R Babbush, B Ballard, J C Bardin, H Bates, A Bengtsson, M Bigdeli Karimi, A Bilmes, et al.

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
Novelty3 / 5: A genuinely new approach to an open problem.; 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

Dimension	Level	Weight	What that level means
Leverage	███░░ 3	18%	A method or resource many groups across the field will adopt within a year.
Magnitude	███░░ 3	20%	Large gain: roughly 2x, or a clear new state of the art on a hard, unsaturated problem.
Evidence	███░░ 3	22%	Solid: multiple benchmarks or cohorts, ablations, fair baselines, released code or data.
Novelty	███░░ 3	22%	A genuinely new approach to an open problem.
Trajectory	███░░ 3	10%	A clear path to scale.
Stakes	██░░░ 2	8%	Benefits a professional community (practitioners, clinicians, engineers).

Editor’s rationale

Heuristic triage from title and abstract text only, not a reading of the paper. Cues found: method (we propose); breadth (general-purpose); scale (efficient).

How the score was computed

rank-2026-10-18

Score█████░░░░░5.1

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.8 / 10; Weighted rubric, evidence-gated.
Adjusted merit: 4.7 / 10; Shrunk toward the desk prior by editor confidence (36%).
Attention: 74%; Citations, upvotes, points, mentions.
Freshness: 54%; Half-life decay since publication.

Citations52 (reference 20, via semantic-scholar, Oct 21, 2026, 07:29 UTC)

The record

Reviewed by heuristic-v7 on Oct 20, 2026, 07:29 UTC. Paper type: method.
Categories: Journal Article
LEAD, No.1 in the Physics edition of October 21, 2026.