Forty Times Better at a Problem Nobody Can Size

Saturday 17 October 2026 topic: Magic state cultivation on Willow and the disputed size of the magic-state bottleneck

The brief asks for a decorative, tone-setting editorial image with no data and no embedded text, so an illustration is the right tool. The visual metaphor is a precisely measured…

What caught my eye in Google’s announcement was a verb phrase. The blog post claims the team has demonstratively opened up a key bottleneck in quantum computing, with magic state cultivation reducing errors about 40x compared to without it.1 The paper’s abstract backs the numbers, reporting cultivation reduced error 40-fold with logical fidelity of at least 0.9999 while retaining 8% of attempts.2 That is a real experimental result. My quarrel is with the word bottleneck, because nobody seems to agree on how narrow that neck actually is.

First, what was actually done on the silicon. As reported in technical summaries, states are prepared in a distance-3 color code using repeated syndrome measurements.3 From there, the team executes a code-switching protocol to graft the cultivated state into a distance-5 surface code.4 I could not read the paywalled Science paper directly, so I am leaning on the abstract and on those reviewing it, where two caveats stand out. The 99.99% figure is real, but it measures something narrower than accuracy in a general operation.5 And that eight per cent retention rate is a deliberate filter, where the reported result keeps 8% of attempts and discards the rest by design.5 That is clever physics, but throwing away ninety-two out of every hundred attempts is also an overhead that belongs near the headline.

Now consider the arithmetic behind the bottleneck claim. Google’s pitch, echoed across the trade press, is that traditional distillation was projected to consume 90% to 95% of a quantum computer’s total physical qubit footprint.4 Craig Gidney, one of the authors on the announcement, noted in an earlier presentation that ten years ago, 94% of quantum computation was T factories.6 A decade in this field is an eternity. Daniel Litinski argued years ago that distillation’s reputation was outdated, showing protocols that reduce the cost of distillation by another order of magnitude.7 In extreme cases, he calculated that it can cost less to distill a magic state than to perform a logical Clifford gate on full-distance qubits.7 Litinski pointed out that this lingering reputation as the leading overhead remains the primary motivation for research into alternatives to magic state distillation.7 Cultivation is one of those alternatives. I do not know the true modern share of distillation in a full-scale machine, and from what I have read, neither does anyone else with an uncontested formula to hand. A fortyfold improvement sounds historic, but it is measured against a baseline whose true weight is actively disputed.

The obvious response is that this is theoretical nitpicking. Even if distillation is cheaper than folklore suggests, saving qubits is still saving qubits, and getting a protocol to work on physical silicon beats paper estimates every day of the week. Zlatko Minev captured the optimism well, noting that avoiding distillation factories and expensive overhead would remove a major barrier for fault-tolerant quantum computing.3 Yet cultivation carries its own ceiling, because as Gidney conceded in his talk, the technique hits a cost wall from postselection and cannot reach arbitrarily low error.6 His slides mapped an ambitious theoretical path from 1e-4 logical error to 2e-9, but the physical chip sits right at the starting line of that journey.6 Whether that eight per cent retention rate holds or degrades as systems scale up remains completely unknown outside the lab.

What we have here is a neat experimental milestone wrapped in a marketing narrative a couple of sizes too large. Resource requirements for quantum algorithms are being whittled down across the board. Gidney’s own factoring research showed that an RSA-2048 integer could be factored using less than one million noisy qubits, down from earlier estimates of twenty million.8 That dramatic drop, however, rested on theoretical assumptions including a square grid of qubits with a gate error rate of 0.1% and microsecond cycle times.8 We have walked this path before. Google’s earlier quantum supremacy claim stumbled when mathematicians later developed methods to help classical computers catch up, forcing researchers to rerun tests on newer hardware.9 That past overreach makes a good argument for patience today. If you manage cryptographic infrastructure, you should take the downward trajectory of quantum overheads seriously. Just wait for an independent lab to reproduce the protocol before assuming the magic-state problem has been put to bed.

Sources

How this was made
  • 01-research z-ai/glm-5.3-flash $0.013
  • 03-annotate z-ai/glm-5.3 $0.039
  • 04-nominate deepseek/deepseek-v4-flash-0731 $0.023
  • 06-write anthropic/claude-sonnet-5.5 $0.054
  • 06-edit google/gemini-3.8-flash $0.045
  • 08-visualise anthropic/claude-sonnet-5.5 $0.043

total $0.218

What each stage does, drawn out →