Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.19003

Shor's Conjecture Is True: Projective Measurements Suffice for Binary Accessible Information

Sunghyeon Jo

quant-phSubmitted Aug 4, 2026• Announced Aug 6, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

Comments
6 pages, no figures

Related papers

Proof of Shor's conjecture on the accessible information of quantum dichotomies

Michele Dall'Arno

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.

quant-pharXiv:2609.20600•Sep 18, 2026•0 citations

Benign Projective Landscapes for Measured Quantum Divergences

Domingos S. P. Salazar

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.

quant-pharXiv:2609.27767•Aug 18, 2026•0 citations

On Shor's conjecture on the accessible information of quantum dichotomies

Khac Duc An Thai, Michele Dall'Arno

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.

quant-pharXiv:2512.11233•IEEE Transactions on Information Theory•Dec 15, 2025•0 citations

Concavity of the set of quantum probabilities for any given dimension

Károly F. Pál, Tamás Vértesi

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.

arXiv:0905.2915•Physical Review A•Oct 30, 2009•16 citations

Quantum Measurements

Reinhold A. Bertlmann, Nicolai Friis

Abstract In this chapter we first review projective or von Neumann measurements from the point of view of the projection postulate and the Lüders rule, before turning to more general measurements modelled using positive operator-valued measures (POVMs). After examining their mathematical description, we discuss symmetric informationally complete (SIC) POVMs and Zauner’s conjecture, as well as the representation of POVMs as projective measurements on a larger Hilbert space, a result called Naimark dilation. We then a model for non-ideal projective measurements and analyse the properties of such measurements in relation to the properties unbiasedness, faithfulness, and non-invasiveness of ideal projective measurements. Finally, we consider the problem of distinguishing non-orthogonal quantum states and examine how the use of POVMs can be beneficial for this task.

•Sep 7, 2023•0 citations

Measurement Geometry for Quantum Random Access Codes: Beyond Nayak Bound and Toward Optimality

Seiseki Akibue, Rudy Raymond, Suguru Tamaki +1 more

Quantum random access codes (QRACs) ask how well N classical bits can be encoded into M qubits while allowing any single bit to be recovered. Although the Nayak bound remains the standard general upper bound on the decoding probability, numerical evidence suggests a stronger upper bound in the small-qubit regime. In this work, we formulate the optimal decoding probability in terms of decoding measurements, reformulating QRAC design as a spectral problem for noncommuting measurements. Using this formulation, we give an elementary proof of the Nayak bound by simplifying the Chernoff-bound argument. Moreover, we refine the argument to obtain upper bounds that improve over Nayak's bound in the entire finite-size regime. The equality conditions of our bounds justify defining mutually unbiased projector-valued measurements (MUPVMs), a generalization of mutually unbiased bases. We show that decoding measurement of any two-qubit QRAC attaining the conjectured bound must form MUPVMs. We also show that any MUPVM, assisted by one ancillary qubit, yields a QRAC with optimal N-scaling decoding probability. Finally, we propose a new MUPVM-based construction for the (M+2,M)-QRAC family attaining the conjectured bound.

quant-pharXiv:2606.12700•Jun 12, 2026•0 citations
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) MMM, we form an operator TMT_MTM​ from the posterior label probabilities and show that its spectral projection-valued measure (PVM) ΠMΠ_MΠM​ satisfies IΠM(X:Y)≥IM(X:Y)I_{Π_M}(X{:}Y)\ge I_M(X{:}Y)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 fff-divergences; the proof below isolates the binary argument and makes the replacement M↦TM↦ΠMM\mapsto T_M\mapstoΠ_MM↦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 fff-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χ^2χ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.
Let us consider the set of all probabilities generated by local binary measurements on two separated quantum systems of a given local dimension ddd. 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 ddd-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 ddd 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.
Abstract In this chapter we first review projective or von Neumann measurements from the point of view of the projection postulate and the Lüders rule, before turning to more general measurements modelled using positive operator-valued measures (POVMs). After examining their mathematical description, we discuss symmetric informationally complete (SIC) POVMs and Zauner’s conjecture, as well as the representation of POVMs as projective measurements on a larger Hilbert space, a result called Naimark dilation. We then a model for non-ideal projective measurements and analyse the properties of such measurements in relation to the properties unbiasedness, faithfulness, and non-invasiveness of ideal projective measurements. Finally, we consider the problem of distinguishing non-orthogonal quantum states and examine how the use of POVMs can be beneficial for this task.
Quantum random access codes (QRACs) ask how well N classical bits can be encoded into M qubits while allowing any single bit to be recovered. Although the Nayak bound remains the standard general upper bound on the decoding probability, numerical evidence suggests a stronger upper bound in the small-qubit regime. In this work, we formulate the optimal decoding probability in terms of decoding measurements, reformulating QRAC design as a spectral problem for noncommuting measurements. Using this formulation, we give an elementary proof of the Nayak bound by simplifying the Chernoff-bound argument. Moreover, we refine the argument to obtain upper bounds that improve over Nayak's bound in the entire finite-size regime. The equality conditions of our bounds justify defining mutually unbiased projector-valued measurements (MUPVMs), a generalization of mutually unbiased bases. We show that decoding measurement of any two-qubit QRAC attaining the conjectured bound must form MUPVMs. We also show that any MUPVM, assisted by one ancillary qubit, yields a QRAC with optimal N-scaling decoding probability. Finally, we propose a new MUPVM-based construction for the (M+2,M)-QRAC family attaining the conjectured bound.