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.27992

Beyond Shor's Conjecture: Optimal Quantum Measurements at Fixed Error

Jinbo Wang, Qihang Wang, Pengcheng Hou, Kun Chen

quant-phmath-phSubmitted Sep 23, 2026• Announced Sep 24, 2026• 0 citations• Revised Oct 27, 2026 (v2)
v1 · Sep 23, 2026v2 · Oct 27, 2026
arXivHTMLPDF

Abstract

We prove Shor's conjecture: an orthogonal measurement maximizes the information obtainable from any two quantum states in finite dimension. We then show that an error constraint can require three outcomes. For a class of full-rank qubit pairs, the best orthogonal basis switches abruptly as the error penalty increases. Near the switch, three outcomes yield more information at the same error than any orthogonal measurement or random mixture of them. The extra outcome distinguishes confidence levels in one guess; every outcome is used.

AI Summary

The paper asks when projective measurements suffice to extract information from two quantum states, and whether this remains true under a guessing-error constraint. It gives a constructive proof of Shor’s conjecture in arbitrary finite dimension, including singular states: a rank-one projective measurement attains accessible information. Projective sufficiency also follows from an earlier measured-$f$-divergence theorem; the direct construction additionally classifies all optimal finite-outcome measurements. The construction maximizes a concave objective over one Hermitian matrix. Operator concavity of the logarithm supplies an information upper bound, while Gibbs’ inequality shows that the optimizer’s eigenbasis attains it. Every optimal POVM refines its spectral projectors and is statistically equivalent on the ensemble under classical postprocessing. A multistate extension attains its bound exactly when the optimized posterior operators commute. For full-rank qubit pairs, the paper studies $I-\lambda P_e$ and proves that three outcomes suffice. If two distinct projective bases tie at positive $\lambda$, a three-outcome POVM strictly outperforms every projective measurement and random mixture thereof. A sufficient condition forces such a basis switch. Proofs reduce the problem to scalar moment optimization and dual contact certificates; the extra outcome distinguishes confidence levels within one guess, without discarding results. Certified advantages occur in $5.5\%$ of 20,000 sampled pairs, with median maximal gap $3.4\times10^{-4}$ nat among gapped pairs. Gains are usually small. The switch condition is not necessary; higher-dimensional outcome counts, extension to rank-deficient pairs, and whether advantage windows can be disconnected remain open.

No sign of AI-generated textAI use disclosed
The use of generative AI in analytical checks and in reviewing the numerical protocols and results is disclosed at the end of the main text.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
33 pages, 6 figures, 4 tables. Substantially expanded to include information-error trade-offs, a three-outcome measurement advantage, and generalized losses. Title and author list updated. The original version was publicly available on Zenodo on 13 August 2026: https://doi.org/10.5281/zenodo.21911604

Related papers

Optimal Quantum Measurement Design under Quartic and Self-Overlap Constraints

Akihiro Koide

We optimize finite rank-one quantum measurements on a complex zero-sum subspace under constraints on the fourth moment of the coordinates and squared self-overlap under conjugation. A sharp quartic inequality determines the least feasible cost and its equality cases in the interior regime for odd coordinate counts. We derive the optimal Fisher information spectrum with prescribed or free self-overlap and construct finite measurements attaining it. We give the exact Hilbert-Schmidt risk for unbiased linear reconstruction from independent repetitions and an explicit finite-sample improvement from projection onto density matrices. With zero self-overlap in dimension three, we construct optimal measurements with the same costs at each outcome and prove a quantitative information gap for measurements with at most nine outcomes. The files include the manuscript, TeX source, and reproducible computations.

•Nov 15, 2026•0 citations

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

Sunghyeon Jo

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.

quant-pharXiv:2609.19003•Aug 6, 2026•0 citations

State Discrimination with Post-Measurement Information

Manuel A. Ballester, Stephanie Wehner, Andreas Winter

We introduce a new state discrimination problem in which we are given additional information about the state after the measurement, or more generally, after a quantum memory bound applies. In particular, the following special case plays an important role in quantum cryptographic protocols in the bounded storage model: Given a string x encoded in an unknown basis chosen from a set of mutually unbiased bases, you may perform any measurement, but then store at most q qubits of quantum information. Later on, you learn which basis was used. How well can you compute a function f(x) of x, given the initial measurement outcome, the q qubits and the additional basis information? We first show a lower bound on the success probability for any balanced function, and any number of mutually unbiased bases, beating the naive strategy of simply guessing the basis. We then show that for two bases, any Boolean function f(x) can be computed perfectly if you are allowed to store just a single qubit, independent of the number of possible input strings x. We then investigate how much advantage the additional basis information can give for a Boolean function. To this end, we prove optimal bounds for the success probability for the AND and the XOR function for up to three mutually unbiased bases. Our result shows that the gap in success probability can be maximal: without the basis information, you can never do better than guessing the basis, but with this information, you can compute f(x) perfectly. We also exhibit an example where the extra information does not give any advantage at all. Interestingly, choosing the string x uniformly at random is not always the hardest distribution, even when f is balanced.

•Aug 1, 2006•29 citations

Exact value and rigidity of the $2\times3$ magic rectangle

Isaac Barouch Essayag, Aryeh Lev Zabokritskiy

The $2\times3$ magic rectangle is a nonlocal game in which two players match entries subject to incompatible parity constraints. Its quantum value was suggested by numerical bounds and known quantum random access codes. We prove that this value is $(1+\sqrt{2/3})/2$ and classify all optimal strategies in arbitrary finite local dimensions, allowing general measurements: up to local isometries and ancillary systems, each contains a maximally entangled pair of four-dimensional systems with fixed measurements on the local state supports. The same value holds for commuting-operator strategies and for the almost-quantum relaxation, confirming the Adamson--Wallden conjecture for this rectangle. For finite-dimensional magic-square strategies, the largest score compatible with perfect prediction of Alice's complete first row by an adversary with quantum side information is one third plus two thirds of the rectangle value. We classify the strategies attaining this threshold with perfect prediction and give linear-order upper and lower bounds on one minus the best compatible guessing probability above it. The rectangle value is also the optimal average success probability of finite-dimensional three-bit random access codes that hide the full input parity, and we classify all optimal codes.

quant-pharXiv:2610.12001•Oct 9, 2026•0 citations

State Discrimination With Post-Measurement Information

Manuel A. Ballester, Stephanie Wehner, Andreas Winter

We introduce a new state discrimination problem in which we are given additional information about the state after the measurement, or more generally, after a quantum memory bound applies. The following special case plays an important role in quantum cryptographic protocols in the bounded storage model: Given a string x encoded in an unknown basis chosen from a set of mutually unbiased bases (MUBs), you may perform any measurement, but then store at mostqqubits of quantum information, and an unlimited amount of classical information. Later on, you learn which basis was used. How well can you compute a function f(x) of x, given the initial measurement outcome, the q qubits, and the additional basis information? We first show a lower bound on the success probability for any balanced function, and any number of mutually unbiased bases, beating the naive strategy of simply guessing the basis. We then show that for two bases, any Boolean function f(x) can be computed perfectly if you are allowed to store just a single qubit, independent of the number of possible input strings x. However, we show how to construct three bases, such that you need to store all qubits in order to compute f(x) perfectly. We then investigate how much advantage the additional basis information can give for a Boolean function. To this end, we prove optimal bounds for the success probability for the AND and the XOR function for up to three mutually unbiased bases. Our result shows that the gap in success probability can be maximal: without the basis information, you can never do better than guessing the basis, but with this information, you can compute f(x) perfectly. We also give an example where the extra information does not give any advantage at all.

arXiv:quant-ph/0608014•IEEE Transactions on Information Theory•Aug 27, 2008•42 citations

Optimization of Quantum States for Signaling Across an Arbitrary Qubit Noise Channel With Minimum-Error Detection

François Chapeau‐Blondeau

For discrimination between two signaling states of a qubit, the optimal detector minimizing the probability of error is applied to the situation where detection has to be performed from a noisy qubit affected by an arbitrary quantum noise separately characterized. With no noise, any pair of orthogonal pure quantum states is optimal for signaling as it enables error-free detection. In the presence of noise, detection errors are in general inevitable, and the pairs of signaling states best resistant to such noise are investigated. With an arbitrary quantum noise, modeled as a channel affecting the qubit, and when minimum-error detection is performed from the output, a characterization of the optimal input signaling pairs and of their best detection performance is obtained through a simple maximization of a quadratic scalar criterion in three constrained real variables. This general characterization enables to establish that such optimal signaling pairs are always made of two orthogonal pure quantum states, but that they must be specifically selected to match the noise properties and prior probabilities. The maximization is explicitly solved for several generic quantum noise processes relevant to the qubit, such as the squeezed generalized amplitude damping noise which describes interaction with a thermal bath representing a decohering environment and which includes as special cases both the generalized and the regular amplitude damping noise processes, and such as general Pauli noise processes which include for instance the bit-flip noise and the depolarizing noise. Also, examined is the situation of one imposed (pure or mixed) signaling state, for which the other associated signaling state optimal for noisy detection is determined as a pure state, yet not necessarily orthogonal.

IEEE Transactions on Information Theory•Jun 12, 2015•17 citations
We prove Shor's conjecture: an orthogonal measurement maximizes the information obtainable from any two quantum states in finite dimension. We then show that an error constraint can require three outcomes. For a class of full-rank qubit pairs, the best orthogonal basis switches abruptly as the error penalty increases. Near the switch, three outcomes yield more information at the same error than any orthogonal measurement or random mixture of them. The extra outcome distinguishes confidence levels in one guess; every outcome is used.
The paper asks when projective measurements suffice to extract information from two quantum states, and whether this remains true under a guessing-error constraint. It gives a constructive proof of Shor’s conjecture in arbitrary finite dimension, including singular states: a rank-one projective measurement attains accessible information. Projective sufficiency also follows from an earlier measured-fff-divergence theorem; the direct construction additionally classifies all optimal finite-outcome measurements.
The construction maximizes a concave objective over one Hermitian matrix. Operator concavity of the logarithm supplies an information upper bound, while Gibbs’ inequality shows that the optimizer’s eigenbasis attains it. Every optimal POVM refines its spectral projectors and is statistically equivalent on the ensemble under classical postprocessing. A multistate extension attains its bound exactly when the optimized posterior operators commute.
For full-rank qubit pairs, the paper studies I−λPeI-\lambda P_eI−λPe​ and proves that three outcomes suffice. If two distinct projective bases tie at positive λ\lambdaλ, a three-outcome POVM strictly outperforms every projective measurement and random mixture thereof. A sufficient condition forces such a basis switch. Proofs reduce the problem to scalar moment optimization and dual contact certificates; the extra outcome distinguishes confidence levels within one guess, without discarding results.
Certified advantages occur in 5.5%5.5\%5.5% of 20,000 sampled pairs, with median maximal gap 3.4×10−43.4\times10^{-4}3.4×10−4 nat among gapped pairs. Gains are usually small. The switch condition is not necessary; higher-dimensional outcome counts, extension to rank-deficient pairs, and whether advantage windows can be disconnected remain open.
We optimize finite rank-one quantum measurements on a complex zero-sum subspace under constraints on the fourth moment of the coordinates and squared self-overlap under conjugation. A sharp quartic inequality determines the least feasible cost and its equality cases in the interior regime for odd coordinate counts. We derive the optimal Fisher information spectrum with prescribed or free self-overlap and construct finite measurements attaining it. We give the exact Hilbert-Schmidt risk for unbiased linear reconstruction from independent repetitions and an explicit finite-sample improvement from projection onto density matrices. With zero self-overlap in dimension three, we construct optimal measurements with the same costs at each outcome and prove a quantitative information gap for measurements with at most nine outcomes. The files include the manuscript, TeX source, and reproducible computations.
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.
We introduce a new state discrimination problem in which we are given additional information about the state after the measurement, or more generally, after a quantum memory bound applies. In particular, the following special case plays an important role in quantum cryptographic protocols in the bounded storage model: Given a string x encoded in an unknown basis chosen from a set of mutually unbiased bases, you may perform any measurement, but then store at most q qubits of quantum information. Later on, you learn which basis was used. How well can you compute a function f(x) of x, given the initial measurement outcome, the q qubits and the additional basis information? We first show a lower bound on the success probability for any balanced function, and any number of mutually unbiased bases, beating the naive strategy of simply guessing the basis. We then show that for two bases, any Boolean function f(x) can be computed perfectly if you are allowed to store just a single qubit, independent of the number of possible input strings x. We then investigate how much advantage the additional basis information can give for a Boolean function. To this end, we prove optimal bounds for the success probability for the AND and the XOR function for up to three mutually unbiased bases. Our result shows that the gap in success probability can be maximal: without the basis information, you can never do better than guessing the basis, but with this information, you can compute f(x) perfectly. We also exhibit an example where the extra information does not give any advantage at all. Interestingly, choosing the string x uniformly at random is not always the hardest distribution, even when f is balanced.
Exact value and rigidity of the 2×32\times32×3 magic rectangle
The 2×32\times32×3 magic rectangle is a nonlocal game in which two players match entries subject to incompatible parity constraints. Its quantum value was suggested by numerical bounds and known quantum random access codes. We prove that this value is (1+2/3)/2(1+\sqrt{2/3})/2(1+2/3​)/2 and classify all optimal strategies in arbitrary finite local dimensions, allowing general measurements: up to local isometries and ancillary systems, each contains a maximally entangled pair of four-dimensional systems with fixed measurements on the local state supports. The same value holds for commuting-operator strategies and for the almost-quantum relaxation, confirming the Adamson--Wallden conjecture for this rectangle. For finite-dimensional magic-square strategies, the largest score compatible with perfect prediction of Alice's complete first row by an adversary with quantum side information is one third plus two thirds of the rectangle value. We classify the strategies attaining this threshold with perfect prediction and give linear-order upper and lower bounds on one minus the best compatible guessing probability above it. The rectangle value is also the optimal average success probability of finite-dimensional three-bit random access codes that hide the full input parity, and we classify all optimal codes.
We introduce a new state discrimination problem in which we are given additional information about the state after the measurement, or more generally, after a quantum memory bound applies. The following special case plays an important role in quantum cryptographic protocols in the bounded storage model: Given a string x encoded in an unknown basis chosen from a set of mutually unbiased bases (MUBs), you may perform any measurement, but then store at mostqqubits of quantum information, and an unlimited amount of classical information. Later on, you learn which basis was used. How well can you compute a function f(x) of x, given the initial measurement outcome, the q qubits, and the additional basis information? We first show a lower bound on the success probability for any balanced function, and any number of mutually unbiased bases, beating the naive strategy of simply guessing the basis. We then show that for two bases, any Boolean function f(x) can be computed perfectly if you are allowed to store just a single qubit, independent of the number of possible input strings x. However, we show how to construct three bases, such that you need to store all qubits in order to compute f(x) perfectly. We then investigate how much advantage the additional basis information can give for a Boolean function. To this end, we prove optimal bounds for the success probability for the AND and the XOR function for up to three mutually unbiased bases. Our result shows that the gap in success probability can be maximal: without the basis information, you can never do better than guessing the basis, but with this information, you can compute f(x) perfectly. We also give an example where the extra information does not give any advantage at all.
For discrimination between two signaling states of a qubit, the optimal detector minimizing the probability of error is applied to the situation where detection has to be performed from a noisy qubit affected by an arbitrary quantum noise separately characterized. With no noise, any pair of orthogonal pure quantum states is optimal for signaling as it enables error-free detection. In the presence of noise, detection errors are in general inevitable, and the pairs of signaling states best resistant to such noise are investigated. With an arbitrary quantum noise, modeled as a channel affecting the qubit, and when minimum-error detection is performed from the output, a characterization of the optimal input signaling pairs and of their best detection performance is obtained through a simple maximization of a quadratic scalar criterion in three constrained real variables. This general characterization enables to establish that such optimal signaling pairs are always made of two orthogonal pure quantum states, but that they must be specifically selected to match the noise properties and prior probabilities. The maximization is explicitly solved for several generic quantum noise processes relevant to the qubit, such as the squeezed generalized amplitude damping noise which describes interaction with a thermal bath representing a decohering environment and which includes as special cases both the generalized and the regular amplitude damping noise processes, and such as general Pauli noise processes which include for instance the bit-flip noise and the depolarizing noise. Also, examined is the situation of one imposed (pure or mixed) signaling state, for which the other associated signaling state optimal for noisy detection is determined as a pure state, yet not necessarily orthogonal.