Here is what the quantum computing literature has classified as classically simulable, as of this week: circuits with depolarizing noise, circuits with dephasing noise, and now, circuits with amplitude-damping noise. That third entry is new.
In a paper posted to arXiv on April 6, 2026, Shravan Shravan, Mohsin Raza, and Ariel Shlosberg at the University of New Mexico present a polynomial-time classical algorithm for sampling from the output distributions of noisy IQP circuits undergoing constant amplitude-damping noise. IQP circuits are a class of quantum circuits built from diagonal gates, conjectured though not proven to be classically hard to sample from in the noiseless case. The new result shows that amplitude-damping noise, a specific kind of non-unital channel, does not preserve that hardness for this circuit family. It can be spoofed classically.
The result sits in a long chain of work on classical simulability of quantum circuits under noise. Prior results covered unital noise channels, where the maximally mixed state is a fixed point, and depolarizing noise. They relied on anti-concentration — the property that output distributions are roughly uniform — to prove classical spoofability. Amplitude-damping noise breaks that property. It is non-unital, meaning it does not spread all input states toward a uniform distribution. That distinction matters: non-unital channels cannot be anti-concentrated in the same way, which is why existing proof techniques failed for them.
Amplitude-damping noise is physically significant. It models T1 relaxation in superconducting qubits, the process where an excited qubit decays to the ground state. This is the dominant error source in many real superconducting processors. So the simulability result is not merely taxonomic. It tells you something about what kind of noise a quantum computer needs to overcome in order to stay outside the classically simulable regime.
There is a structural caveat that deserves attention. The result applies to circuits with depth d equal to Omega(log(n)), where n is the number of qubits — logarithmic depth. This is not a statement about deep circuits. It is also specific to ℓ-local diagonal gates. The authors note explicitly that some circuits undergoing non-unital noise can simulate noiseless circuits, which implies arbitrary circuits under non-unital noise are not all classically simulable. The boundary the paper draws is precise, not general.
The technical core of the algorithm exploits the structure of amplitude-damping noise acting on computational basis states. The authors show that the noise channel preserves enough structure in the Hamming weight basis to allow efficient classical sampling without anti-concentration. The appendices run to 26 pages. The algorithm is real, the bounds are real, and the proof is not trivial.
When a noise channel makes a circuit classically simulable, that circuit cannot demonstrate quantum advantage. The open question has been which physically realistic noise channels land in the simulable column. Depolarizing and dephasing were already there. Amplitude-damping now joins them, but only for IQP circuits at logarithmic depth. The boundary between classically simulable and potentially advantaged noisy hardware is narrow and precise, and this paper narrows it further.
The authors are at the University of New Mexico, not a quantum hardware lab with a product to announce. This is theoretical physics. The contribution is the noise channel classification, not a demonstration on real hardware. Read that way, it is a solid technical result that adds to the growing literature on where classical algorithms can keep up with near-term quantum systems. The headline is not that quantum advantage is dead. It is that amplitude-damping noise, the kind superconducting qubits actually produce, does not by itself get you out of the classically simulable regime for IQP circuits. That is a specific and useful thing to know.