How a class of quantum states cuts the cost of distinguishing them

Nathaniel Johnston of Mount Allison University and Vincent Russo of Unitary Foundation have achieved a reduction to O(n2) in optimization problems related to distinguishing quantum states. Their work focuses on locally diagonal orthogonally invariant (LDOI) states, a class encompassing important systems like Werner, isotropic, X, and Dicke states. For all two-qubit cases, the LOCC supremum equals the PPT and separable optima, establishing a definitive result for this common quantum system size. This advancement enables more efficient calculations for discerning these states, simplifying a previously complex computational challenge.

Locally Diagonal Orthogonally Invariant (LDOI) State Properties

The computational effort required to determine the distinguishability of certain quantum states has been substantially reduced; a new approach achieves a scaling reduction from n4 to O(n2) in optimization problems. This broad applicability means the new findings have implications for a wide range of previously investigated quantum systems, offering a unified framework for their analysis. The work builds upon earlier explorations of nonlocality, referencing research by Somshubhro Bandyopadhyay, who investigated connections between purity and nonlocality in 2011.

Gap Quantification Between LOCC and PPT Distinguishability

The work establishes a general upper bound on the gap between PPT and LOCC distinguishability for local dimension n; the gap is at most. This bound provides a quantifiable measure of how efficiently these states can be distinguished using different measurement strategies. The paper reports that “we establish efficiently computable bounds on the distinguishability of orthonormal LDOI bases,” indicating a practical tool for assessing the effectiveness of quantum state discrimination techniques.

👉 More information
🗞 Distinguishability of locally diagonal orthogonally invariant quantum states
✍️ Nathaniel Johnston and Vincent Russo
🧠 DOI: https://quantum-journal.org/papers/q-2026-11-18-2275/

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: