A preprint posted to arXiv at the end of September, and announced in the October 2 listing, shows that a classical computer can approximately sample the output of a noisy quantum circuit once the circuit is deep enough — and that the required depth depends only on how noisy the machine is, not on how large the problem is. Written without care, that sentence produces a headline saying quantum computing is finished. Written accurately, it is something more interesting: a map of where quantum advantage actually survives.

The result, from a group including Michael Gullans, states that any geometrically local circuit of unital operations with single-qubit depolarising noise of strength p can be approximately sampled in polynomial time once depth exceeds Ω(p-1 log p-1). Previous classical approaches for general circuits needed depth to grow like the logarithm of system size, which in practice meant the noise had to be strong enough to wash the output state down to something trivial. Removing the system-size dependence is the contribution. It is an upper bound on what is possible in principle, on a preprint, for sampling only.

Key takeaways:

  • This is a sampling result: approximate output samples, not exact amplitudes or arbitrary observables.
  • The depth threshold Ω(p-1 log p-1) depends on noise strength only, not on system size.
  • Assumes unital gates and geometrically local circuits. Non-unital operations and long-range gates are outside the theorem.
  • Modelled noise is single-qubit depolarising. Other noise models are not covered.
  • It is a complexity upper bound, not a demonstration that an existing sampler attains it.
  • Not peer reviewed. Treat it as a preprint.

Inverting the question

Most quantum advantage discussion asks how big a machine you can build before noise ruins the computation. This paper asks the reverse: how deep does a circuit have to be before an ordinary computer can read its output?

Those are different questions and they have different answers. The first is about how well you can suppress noise. The second is about when the noise has done enough damage that the output no longer carries quantum structure worth reading.

The framing matters because the second question is the one that determines whether advantage exists for a given device. A classical computer does not need to be good at simulating quantum circuits in general. It only needs to be good at simulating noisy ones deep enough, because deep noisy circuits are exactly what current hardware produces.

What changed from previous results

The prior state of the art, for general circuits, required circuit depth to grow like the logarithm of the system size. The authors describe the practical consequence plainly: that scaling means noise has to be sufficient to wash the output state down to something trivial.

Read carefully, that is a weak result in disguise. If the only classically tractable regime is one where the quantum computer’s output has been destroyed, then classical simulation “winning” says nothing about quantum computing. It is a statement about a device that is already too noisy to be useful.

The new result removes the system-size dependence. Depth scaling independently of system size suffices for approximate sampling. The tractable regime is therefore defined by the noise level alone — and it does not slide toward uselessness as you try to solve a bigger problem.

How the argument works

The method maps the circuit’s output state onto a polymer model from statistical mechanics, then combines two tools: a convergent cluster expansion, and the hypercontractivity of the depolarising channel.

The intuition behind the mapping is that a noisy quantum circuit, once you stop trying to track amplitudes exactly, behaves like a disordered statistical system. Cluster expansion is the standard way to extract the free energy of such a system in a controlled expansion, and hypercontractivity is what bounds how much the noise channel smooths the underlying function class. Together they give a bound that depends on the noise parameter rather than on the Hilbert space dimension.

That is a genuinely useful structural observation: it is why the system size drops out. The polymer description is local, so its estimates scale with local structure and noise rather than with the total state dimension.

What this is not

This section is the whole article, as far as accuracy is concerned. The failure mode for coverage of a result like this is in the caveats.

  • It is not a full simulation result. Sampling produces approximate samples of output measurements. It does not compute amplitudes or arbitrary observables. Many quantum algorithms need the latter.
  • It does not say quantum computers are useless. It says a classical bound exists for a restricted class, above a depth threshold.
  • Unital gates only. Non-unital operations sit outside the theorem. That is a real restriction, since state preparation and measurement are naturally non-unital.
  • Geometrically local circuits only. Long-range gates, and the all-to-all connectivity that error-corrected architectures aim for, are excluded.
  • Depolarising noise only. Coherent error, leakage and correlated noise are not modelled. Real devices have all three.
  • An upper bound, not a demonstration. The theorem says such a sampler could exist in polynomial time. Whether an implementable algorithm attains these bounds is not established here, and the Õ notation hides constants that matter enormously in practice.
  • In principle, not today. The bound constrains what is classically possible. It makes no claim about what a given classical supercomputer does in practice this year.
  • Not peer reviewed. It is a preprint. The bound’s correctness has not been independently checked, and a claim of this kind attracts exactly the kind of scrutiny that review is for.

Why it still matters

Set the caveats aside and the useful content is a better-shaped question than the one we usually ask. Instead of “does this computer have quantum advantage?”, the operative questions are:

  • At the noise level p my device actually achieves, how deep can a circuit be before classical sampling is in bounds?
  • Does my algorithm need exact amplitudes, or would sampling suffice?
  • Is my circuit local and unital, or is it doing something the theorem does not cover?
  • How far is p from the threshold, and which direction is it moving?

Those are answerable questions, and they are far more productive than a yes/no verdict on the field. A paper that sharpens the boundary of a contested question is worth reading even when the boundary it draws is theoretical.

It is also worth remembering the direction of travel. Error correction is the intended answer to the depth problem, and it changes the noise model — logical error rates fall below the physical ones that this bound is written in terms of. The bound is about the regime of noisy, uncorrected circuits. That regime is exactly where much of the current experimental work sits, and exactly where this result is most immediately relevant.

A note on the date

This paper’s version 1 timestamp is 30 September 2026, 18:26 UTC. It appears in the 2 October arXiv listing because arXiv announces submissions made after the Wednesday cutoff in the Friday listing. If you encounter it described as an October 2 paper, the submission date is the earlier one.

References

Related Tools

Try these companion tools on DevStackIO Tools:

  • scientific calculator — perform computations for comparing classical and quantum circuit performance.