Classical information storage in an $n$-level quantum system
P\'eter E. Frenkel, Mih\'aly Weiner

TL;DR
This paper proves that for a specific information storage game, quantum $n$-level systems do not outperform classical $n$-state systems in terms of maximum expected reward or mutual information, regardless of the distribution or reward function.
Contribution
It demonstrates the equivalence of quantum and classical systems in this game, introducing new inequalities and applying advanced mathematical tools like mixed discriminants and bipartite graph theorems.
Findings
Quantum and classical systems achieve equal maximum expected rewards.
Maximum mutual information is the same for quantum and classical $n$-level systems.
New dimension-dependent inequalities for positive operators are derived.
Abstract
A game is played by a team of two --- say Alice and Bob --- in which the value of a random variable is revealed to Alice only, who cannot freely communicate with Bob. Instead, she is given a quantum -level system, respectively a classical -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 in the used system by requiring Bob to specify a value and giving a reward of value to the team. We show that whatever the probability distribution of and the reward function are, when using a quantum -level system, the maximum expected reward obtainable with the best possible team strategy is equal to that obtainable with the use of a classical -state system. The proof relies on mixed discriminants of positive matrices and --- perhaps surprisingly --- an…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
