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.
AI Summary
The paper addresses Shor’s conjecture on accessible information for a quantum dichotomy: an ensemble $\{p,\rho_0;1-p,\rho_1\}$ containing two quantum states. Accessible information is the maximum classical mutual information between the ensemble label and the outcome of a quantum measurement. The conjecture asserts that this maximum can always be attained by a projective measurement, rather than requiring a general POVM.
The stated main result establishes the conjecture in arbitrary dimension, extending a recent proof restricted to qubits. Two routes to the result are presented: a derivation from a recent result of Fang, Fawzi and Fawzi, and a self-contained elementary proof. Beyond the existence of an optimal projective measurement, the paper gives an explicit construction that takes a dichotomy and a measurement and produces a projective measurement extracting at least as much information.
The paper also formulates the computation of accessible information for dichotomies as a convex optimization problem, in contrast to the generally non-convex optimization for quantum ensembles. The scope is ensembles of two states; the abstract does not claim an extension to larger ensembles. Only the title and abstract are available, so the proof details, the form and computational cost of the convex formulation, and any further qualifications or limitations cannot be assessed here.
No sign of AI-generated text
Written by gpt-6.1-sol from the abstract only. Automated: it can be wrong.
Comments
This submission is being withdrawn because it is superseeded by arXiv:2609.27992
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.
The paper addresses Shor’s conjecture on accessible information for a quantum dichotomy: an ensemble {p,ρ0;1−p,ρ1} containing two quantum states. Accessible information is the maximum classical mutual information between the ensemble label and the outcome of a quantum measurement. The conjecture asserts that this maximum can always be attained by a projective measurement, rather than requiring a general POVM.
The stated main result establishes the conjecture in arbitrary dimension, extending a recent proof restricted to qubits. Two routes to the result are presented: a derivation from a recent result of Fang, Fawzi and Fawzi, and a self-contained elementary proof. Beyond the existence of an optimal projective measurement, the paper gives an explicit construction that takes a dichotomy and a measurement and produces a projective measurement extracting at least as much information.
The paper also formulates the computation of accessible information for dichotomies as a convex optimization problem, in contrast to the generally non-convex optimization for quantum ensembles. The scope is ensembles of two states; the abstract does not claim an extension to larger ensembles. Only the title and abstract are available, so the proof details, the form and computational cost of the convex formulation, and any further qualifications or limitations cannot be assessed here.
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
The accessible information and the informational power quantify the maximum amount of information that can be extracted from a quantum ensemble and by a quantum measurement, respectively. Here, we investigate the tradeoff between the accessible information (informational power, respectively) and the purity of the states of the ensemble (the elements of the measurement, respectively). Under any given lower bound on the purity, 1) we compute the minimum informational power and show that it is attained by the depolarized uniformly-distributed measurement; and 2) we give a lower bound on the accessible information. Under any given upper bound on the purity, 1) we compute the maximum accessible information and show that it is attained by an ensemble of pairwise commuting states with at most two distinct non-null eigenvalues; and 2) we give a lower bound on the maximum informational power. The present results provide, as a corollary, novel sufficient conditions for the tightness of the Jozsa-Robb-Wootters lower bound to the accessible information.
The accessible information quantifies the amount of classical information that can be extracted from an ensemble of quantum states. Analogously, the informational power quantifies the amount of classical information that can be extracted by a quantum measurement. For both quantities, we provide upper and lower bounds that depend only on the dimension of the system, and we prove their tightness. In the case of symmetric informationally complete (SIC) ensembles and measurements, stronger bounds are provided and their tightness proved for qubits and qutrits. From our upper bounds, we notice, perhaps surprisingly, that the statistics generated by SIC ensembles or measurements in arbitrary dimension, though optimal for tomographic purposes, in fact never contain more than just one bit of information, the rest being constituted by completely random bits. On the other hand, from our lower bounds, we obtain an explicit strategy beating the so-called pretty-good one for the extraction of mutual information in the case of SIC ensembles and measurements.
The problem of estimating quantity of information, which can be obtained in the process of binary consecutive measuring a qubit state, is considered in the paper. The studied quantity is expressed as Shannon mutual information between the initial qubit state and the outcomes of a consecutive measurement. It is demonstrated that the maximum of information is reached by projective measurements. The maximum quantity of accessible information is calculated. It is proved that in the case of arbitrary binary test the maximum is reached asymptotically for consecutive measurements.
Abstract Computing accessible information for an ensemble of quantum states is a basic problem in quantum information theory. We show that the recently obtained optimality criterion (A.S. Holevo, Lobachevskii J. Math., 43, 1646–1650 (2022)), when applied to specific ensembles of states leads to nontrivial tight entropy inequalities that are discrete relatives of the famous log-Sobolev inequality. In this light, the hypothesis of globally information-optimal measurement for an ensemble of equiangular equiprobable states (quantum pyramids) (B.-G. Englert and J. Řeháček, J. Mod. Optics 57 (3), 218–226 (2010)) is reconsidered and the corresponding entropy inequalities are proposed. Via the optimality criterion, this suggests also an approach to the proof of the conjectures concerning globally information-optimal observables for quantum pyramids.