Shor conjectured that a von Neumann measurement attains the accessible information of every binary quantum ensemble. We prove the conjecture constructively in arbitrary finite dimension. For every finite-outcome positive operator-valued measure (POVM) $M$, we form an operator $T_M$ from the posterior label probabilities and show that its spectral projection-valued measure (PVM) $Π_M$ satisfies $I_{Π_M}(X{:}Y)\ge I_M(X{:}Y)$; every rank-one refinement retains the inequality. Two applications of Jensen's operator inequality prove the comparison and yield an exact concave variational formula for the accessible information. The result is a special case of the general theorem of Fang, Fawzi, and Fawzi on measured $f$-divergences; the proof below isolates the binary argument and makes the replacement $M\mapsto T_M\mapstoΠ_M$ explicit.
Shor conjectured that a von Neumann measurement attains the accessible information of every binary quantum ensemble. We prove the conjecture constructively in arbitrary finite dimension. For every finite-outcome positive operator-valued measure (POVM) M, we form an operator TM from the posterior label probabilities and show that its spectral projection-valued measure (PVM) ΠM satisfies IΠM(X:Y)≥IM(X:Y); every rank-one refinement retains the inequality. Two applications of Jensen's operator inequality prove the comparison and yield an exact concave variational formula for the accessible information. The result is a special case of the general theorem of Fang, Fawzi, and Fawzi on measured f-divergences; the proof below isolates the binary argument and makes the replacement M↦TM↦ΠM explicit.
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.
We study nonconvex optimization of measured quantum f-divergences over rank-one projective measurements. For smoothly operator-Fenchel liftable generators and faithful states, every projective local maximum and every second-order stationary point is globally optimal over all POVMs. The criterion is blockwise: a critical PVM is optimal exactly when the compressed states are proportional on each equal-score block; otherwise an explicit two-vector rotation has positive ascent curvature. Operator-convex generators admit a positive atomic curvature resolution, and the quadratic χ2 case yields two-sided residual bounds. For binary accessible information, this framework proves the known adaptive-capacity equality and shows that every nonidentical qubit ensemble has exactly two stationary projective measurements, proving conjectures of Keil and Thai--Dall'Arno. A rare-prior limit connects weighted Jensen--Shannon information to relative entropy and yields a finite counterexample to the proposed equivalence between observational-entropy and all-ensemble mutual-information orders. The landscape theorem also covers measured Rényi divergences of finite positive order and measured relative entropy.
Around the turn of the century, Shor formulated his well-known and still-open conjecture stating that the accessible information of any quantum dichotomy, that is the maximum amount of classical information that can be decoded from a binary quantum encoding, is attained by a von Neumann measurement. A quarter of a century later, new developments on the Lorenz curves of quantum dichotomies in the field of quantum majorization and statistical comparison may provide the key to unlock such a longstanding open problem. Here, we first investigate the tradeoff relations between accessible information and guessing probability in the binary case, thus disproving the claimed monotonicity of the former quantity in the latter that, if true, would have settled Shor's problem in the qubit case. Our second result is to provide a state-dependent generalization of extremality for quantum measurements, to characterize state-dependent extremality for qubit dichotomies, and to apply such results to tighten previous results on the accessible information of qubit dichotomies.
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 o Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Let us consider the set of all probabilities generated by local binary measurements on two separated quantum systems of a given local dimension d. We address the question of whether the shape of this quantum body is convex or not. We construct a point in the space of probabilities, which is on the convex hull of the local polytope, but still cannot be attained by measuring d-dimensional quantum systems if the number of measurement settings is large enough. From this it follows that this body is not convex. We also show that for finite d the quantum body with the generalized measurement associated with positive operator-valued measures allowed may contain points that cannot be achieved with only projective measurements.
We establish a qubit–qutrit equivalence for centrally symmetric prepare-and-measure correlations involving two fixed binary queries and no shared randomness between preparation and measurement devices. For arbitrary pairs of Hermitian contractions on a three-dimensional Hilbert space, we prove a spectral-domination result that implies the following: any centrally symmetric family of target expectation pairs approximable by two binary POVMs on a qutrit, within a common compact convex centrally symmetric tolerance, is equally approximable using two fixed projective measurements on a qubit. As an exact consequence, for the four rectangular targets (±a, ±b), the optimal worst-cell total-variation error in dimensions two and three is ε₂ = ε₃ = max{0, [a + b − √(2 − (a − b)²)] / 4}, whereas dimension four permits exact reproduction. In particular, a qutrit with arbitrary binary POVMs cannot improve upon the optimal qubit worst-case success probability of (1 + 1/√2)/2 for the 2-to-1 random-access code without shared randomness. The proof uses spectral subspace intersection in dimension three and does not require the measurement operators to possess common reducing subspaces. Explicit counterexamples establish the importance of the dimensional and operational assumptions. The results provide a mathematical characterization of quantum carrier-dimension constraints, with applications to prepare-and-measure correlations and operationally recoverable historical information. Status: Research preprint, prepared for independent peer review. Not peer-reviewed. Reproducibility: Supplementary proofs, exact symbolic certificates, verification scripts and a SHA-256 manifest accompany the manuscript.