Classical information storage in an $n$-level quantum system

Abstract

A game is played by a team of two --- say Alice and Bob --- in which the value of a random variable $x$ is revealed to Alice only, who cannot freely communicate with Bob. Instead, she is given a quantum $n$-level system, respectively a classical $n$-state system, which she can put in possession of Bob in any state she wishes. We evaluate how successfully they managed to store and recover the value of $x$ in the used system by requiring Bob to specify a value $z$ and giving a reward of value $f(x,z)$ to the team. We show that whatever the probability distribution of $x$ and the reward function $f$ are, when using a quantum $n$-level system, the maximum expected reward obtainable with the best possible team strategy is equal to that obtainable with the use of a classical $n$-state system. The proof relies on mixed discriminants of positive matrices and --- perhaps surprisingly --- an application of the Supply--Demand Theorem for bipartite graphs. As a corollary, we get an infinite set of new, dimension dependent inequalities regarding positive operator valued measures and density operators on complex $n$-space. As a further corollary, we see that the greatest value, with respect to a given distribution of $x$, of the mutual information $I(x;z)$ that is obtainable using an $n$-level quantum system equals the analogous maximum for a classical $n$-state system.

13 pages

References in corpus (1)

• Positive semidefinite rank

Cited by in corpus (44)

• Incompatible measurements in quantum information science
• Semidefinite programming relaxations for quantum correlations
• No-hypersignaling principle
• Witnessing irreducible dimension
• Structure of temporal correlations of a qubit
• Nonlocality Without Entanglement: Quantum Theory and Beyond
• Device-independent tests of quantum channels
• Measurement incompatibility and quantum advantage in communication
• Classical Cost of Transmitting a Qubit
• Mutually Unbiased Balanced Functions & Generalized Random Access Codes
• The Communication Value of a Quantum Channel
• Compatibility of Generalized Noisy Qubit Measurements
• Simple Information Processing Tasks with Unbounded Quantum Advantage
• On entanglement assistance to a noiseless classical channel
• Quantum Advantage for Shared Randomness Generation
• Communication tasks in operational theories
• Advantage of Quantum Theory Over Non-classical Models of Communication
• Certifying the Classical Simulation Cost of a Quantum Channel
• Quantum Advantages in (n,d)->1 Random Access Codes
• Classical simulations of communication channels
• Prepare-and-measure scenarios with photon-number constraints
• Classical analogue of quantum superdense coding and communication advantage of a single quantum system
• Interplays between classical and quantum entanglement-assisted communication scenarios
• Information capacity of quantum communication under natural physical assumptions
• Self-testing of semisymmetric informationally complete measurements in a qubit prepare-and-measure scenario
• Scalable & Noise-Robust Communication Advantage of Multipartite Quantum Entanglement
• The signaling dimension of physical systems
• Certifying measurement incompatibility in prepare-and-measure and Bell scenarios
• Quantum Advantage: A Single Qubit's Experimental Edge in Classical Data Storage
• Entanglement-breaking channels are a quantum memory resource
• Maximal Elements of Quantum Communication
• Compression of Entanglement Improves Quantum Communication
• Minimal scheme for certifying three-outcome qubit measurements in the prepare-and-measure scenario
• Identifying the value of a random variable unambiguously: Quantum versus classical approaches
• Certifying asymmetry in the configuration of three qubits
• Can a qudit carry more information than a dit?
• Partial ignorance communication tasks in quantum theory
• Theory-Independent Context Incompatibility: Quantification and Experimental Demonstration
• Random Exclusion Codes: Quantum Advantages of Single-Shot Communication
• Gottesman-Knill Limit on One-way Communication Complexity: Tracing the Quantum Advantage down to Magic Resources
• Limits of Classical correlations and Quantum advantages under (Anti-)Distinguishability constraints in Multipartite Communication
• Quantum advantage in a unified scenario and secure detection of resources
• On compatibility of binary qubit measurements
• Randomness-free Detection of Non-projective Measurements: Qubits & beyond