Researchers Cut Quantum State Calculation Cost to O(n2)
Nathaniel Johnston and Vincent Russo reduced the computational scaling for distinguishing a class of quantum states from n4 to O(n2).
Updated on Nov. 18, 2026 in Quantum Computing

Nathaniel Johnston of Mount Allison University and Vincent Russo of Unitary Foundation reduced the scaling of optimization problems for distinguishing quantum states to O(n2). The work focuses on locally diagonal orthogonally invariant (LDOI) states, a class that includes Werner, isotropic, X, and Dicke states.
Why it matters
Efficiently computable bounds on distinguishing quantum states help clarify the limits of what can be achieved with local operations and classical communication. The research builds on earlier work by Somshubhro Bandyopadhyay from 2011 on purity and nonlocality.
The optimization problems for distinguishing LDOI states now scale as O(n2), down from n4. For all two-qubit cases, the LOCC optimum matches the PPT and separable optima.
The players
Nathaniel Johnston
Johnston is a researcher affiliated with Mount Allison University who co-authored the study on distinguishing quantum states.
Vincent Russo
Russo is a researcher affiliated with the Unitary Foundation who co-authored the study on distinguishing quantum states.
Somshubhro Bandyopadhyay
Bandyopadhyay is a physicist whose 2011 research on purity and nonlocality provided groundwork for the new results.
The details
The paper establishes efficiently computable bounds on the distinguishability of orthonormal LDOI bases, and also derives a general upper bound on the gap between PPT and LOCC distinguishability for local dimension n.
Timeline
2011: Bandyopadhyay investigated purity and nonlocality connections that this work builds upon.
November 18, 2026: Article reporting the new quantum state results was published.
The Tech Race
The work extends Somshubhro Bandyopadhyay's 2011 research on purity and nonlocality into efficiently computable distinguishability bounds. It advances the study of quantum state distinguishability beyond the earlier analysis of purity and nonlocality connections.
Cheaper computation for distinguishing quantum states could make these analyses more practical for researchers working on quantum communication and information processing. The immediate effect is on the research community rather than on everyday users.
The takeaway
Lower computational scaling for quantum state distinguishability means researchers can analyze larger systems with less cost. Progress in this area steadily narrows the gap between theoretical limits and practical calculation.
Further reading
Explore more on Quantum Computing to see how distinguishability bounds fit into the field's broader progress.
Source note: This article includes information reported by Quantum Zeitgeist.



