Researchers propose average-case norm for quantum channel testing

Researchers have identified a fundamental limit in current methods for verifying quantum channels, demonstrating that testing a channel’s identity using the diamond norm requires at least √din / ε queries, even with advanced algorithms. Motivated by this constraint, Gregory Rosenthal of the University of Cambridge and colleagues introduced the average-case imitation diamond (ACID) norm as an alternative measurement tool.

Their work shows that, for certain channel types, testing identity in ACID distance can bypass the scaling limitations of the diamond norm, achieving complexity independent of channel dimensions. The team further proved that testing identity to any fixed channel requires approximately din / ε2 queries using the ACID norm, a potential improvement over the approximately / ε2 queries needed with the standard diamond distance.

Testing the identity of a quantum channel is fundamentally limited by a requirement of at least √din / ε queries, where din represents the input dimension and ε dictates the desired accuracy. This limitation stems from the worst-case behavior of the diamond norm, a standard metric for quantifying the difference between quantum channels. This new metric offers a potential pathway to bypass the scaling limitations associated with channel dimensions for specific channel types.

Unlike the diamond norm, which sees its testing complexity increase with both input and output dimensions, the ACID norm allows for the possibility of dimension-independent testing under certain conditions. The team’s work demonstrates a concrete advantage of the ACID norm in specific scenarios, contrasting with the approximately / ε2 queries needed to achieve the same level of confidence when employing the standard diamond distance. While not universally applicable, this reduction in query complexity represents an improvement for channels amenable to ACID norm analysis.

Testing whether a quantum channel faithfully transmits information demands a minimum of √din / ε queries, even with the most sophisticated algorithms, according to work published in Quantum. The research, conducted by Gregory Rosenthal, Hugo Aaronson, Sathyawageeswar Subramanian, Animesh Datta and Tom Gur, details an alternative approach to channel verification. The researchers demonstrated that, in the simplest algorithmic model, one lacking ancillae, coherence, or adaptivity, certain channels can be tested using the ACID norm without dependence on input or output dimensions.

Further analysis revealed concrete differences in query complexity between the ACID norm and the diamond norm. The team also established tight bounds on the complexity of channel tomography specifically within the ACID distance framework, providing a comprehensive understanding of its capabilities. The study’s findings are published in Quantum, a journal supported by the Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften, and are available on arXiv.

👉 More information
🗞 Quantum Channel Testing in Average-Case Distance
✍️ Gregory Rosenthal, Hugo Aaronson, Sathyawageeswar Subramanian, Animesh Datta and Tom Gur
🧠 DOI: https://quantum-journal.org/papers/q-2026-11-18-2276/

Stay current

See today’s quantum computing news on Quantum Zeitgeist for the latest breakthroughs in qubits, hardware, algorithms, and industry deals.

Avatar of Ivy Delaney

Ivy Delaney

Ivy Delaney has been working with neural networks and machine learning since the mid-nineties, back when a couple of hidden layers and a long afternoon of training counted as ambitious. She has watched the field go from academic curiosity to the thing quietly running underneath everything, and she brings that long view to quantum computing. For Quantum Zeitgeist she covers the ground where the two fields meet. That means quantum machine learning and the variational algorithms it leans on, and it also means the less glamorous but more interesting story of classical machine learning already doing real work inside quantum machines, decoding error-correcting codes, calibrating noisy hardware and learning the error models that simulators depend on. She writes about the hardware those algorithms have to run on too, and about the post-quantum cryptography scramble that the same hardware has set off. Her stories typically start with the paper, whether that is peer-reviewed work, conference proceedings or an arXiv preprint, with the source linked so you can hold a claim up against the research it came from. She is unimpressed by benchmarks that will not say what they beat, and by demonstrations that only work in the press release.

Latest Posts by Ivy Delaney: