aiqbench analysis
This paper conclusively proves Shor's conjecture regarding the accessible information of quantum dichotomies, settling a 30-year-old open problem in quantum information theory. By framing the computation as a convex problem and providing explicit constructions for optimal projective measurements, the work advances fundamental limits on data extraction from two-state quantum ensembles.
Proof of Shor's conjecture on the accessible information of quantum dichotomies
arXiv:2609.20600v1 Announce Type: new Abstract: The accessible information of any given quantum ensemble quantifies the maximum amount of Shannon information that can be extracted from the ensemble by any quantum measurement. Almost three decades ago, Shor conjectured that the accessible information of any quantum dichotomy, that is, an ensemble of two states, is attained by a projective measurement. Recently, a proof of this conjecture restricted to the qubit case was published by Keil. Here, we conclusively settle this longstanding open problem. First, we show that Shor's conjecture follows, in arbitrary dimension, from a recent result by Fang, Fawzi and Fawzi, and we provide a self-contained, elementary proof. Second, for any given dichotomy and measurement, we provide the explicit construction of a projective measurement that outperforms such a measurement in extracting information from the given dichotomy. Third, while the computation of the accessible information is known to be non-convex in general, we frame the computation of the accessible information of dihotomies as a convex problem.
Abstract:The accessible information of any given quantum ensemble quantifies the maximum amount of Shannon information that can be extracted from the ensemble by any quantum measurement. Almost three decades ago, Shor conjectured that the accessible information of any quantum dichotomy, that is, an ensemble of two states, is attained by a projective measurement. Recently, a proof of this conjecture restricted to the qubit case was published by Keil. Here, we conclusively settle this longstanding open problem. First, we show that Shor's conjecture follows, in arbitrary dimension, from a recent result by Fang, Fawzi and Fawzi, and we provide a self-contained, elementary proof. Second, for any given dichotomy and measurement, we provide the explicit construction of a projective measurement that outperforms such a measurement in extracting information from the given dichotomy. Third, while the computation of the accessible information is known to be non-convex in general, we frame the computation of the accessible information of dihotomies as a convex problem.
arXiv:2609.20600 [quant-ph]
(or arXiv:2609.20600v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2609.20600 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 250 words
Related coverage

Lattice-Based Cryptography Explained
Quantum Zeitgeist · Aug 15, 2026
Shor's Conjecture Is True: Projective Measurements Suffice for Binary Accessible Information
arXiv · Sep 17, 2026

Detection of a Rényi Index Dependent Transition in Entanglement Entropy Scaling
Quantum Journal · Aug 7, 2026
News Archive 2026
Quantum Computing Report · Jul 25, 2026