Classical information storage in an n-level quantum system

DOI10.1007/S00220-015-2463-0zbMATH Open1323.81013arXiv1304.5723OpenAlexW3101768369MaRDI QIDQ500057FDOQ500057

Mihály Weiner, Péter E. Frenkel

Publication date: 7 October 2015

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1304.5723

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) 2-person games (91A05) Positive matrices and their generalizations; cones of matrices (15B48) Vector-valued measures and integration (46G10) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Games involving graphs (91A43)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Matching theory
• A gap for the maximum number of mutually unbiased bases
• Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
• Quantum information theory
• Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone
• Positive semidefinite rank
• On vector configurations that can be realized in the cone of positive matrices
• Mutually Unbiased Bases and the Complementarity Polytope
• Mixed discriminants of positive semidefinite matrices

Cited In (6)

• Title not available (Why is that?)
• Communication tasks in operational theories
• General tracking control of arbitrary \(N\)-level quantum systems using piecewise time-independent potentials
• Advantage of Quantum Theory over Nonclassical Models of Communication
• Phase of the quantum bit wave function as a resource for information storage and transfer
• Device-independent tests of quantum channels

This page was built for publication: Classical information storage in an \(n\)-level quantum system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q500057)