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.
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
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.
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.
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.
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.
Exact value and rigidity of the 2×3 magic rectangle
The 2×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 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.
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.
We study sequential state discrimination measurements performed on the same qubit by subsequent observers. Specifically, we focus on the case when the observers perform a kind of a minimum-error type state discriminating measurement where the goal of the observers is to maximize their joint probability of successfully guessing the state that the qubit was initially prepared in. We call this the Joint Best Guess strategy. In this scheme, Alice prepares a qubit in one of two possible states. The qubit is first sent to Bob, who measures it, and then on to Charlie, and so on to altogether N consecutive receivers who all perform measurements on it. The goal for all observers is to determine which state Alice sent. In the Joint Best Guess strategy, every time a system is received the observer is required to make a guess, aided by the measurement, about its state. The price to pay for this requirement is that errors must be permitted, the guess can be correct or in error. There is a nonzero probability for all the receivers to successfully identify the initially prepared state, and we maximize this joint probability of success. This work is a step toward developing a theory of nondestructive sequential quantum measurements and could be useful in multiparty quantum communication schemes based on communicating with single qubits, particularly in schemes employing continuous variable states. It also represents a case where subsequent observers can probabilistically and optimally get around both the collapse postulate and the no-broadcasting theorem.