Strong supremacy of quantum systems as communication resource
arXiv:1703.01996
Abstract
We investigate the task of -level random access codes (-RACs) and consider the possibility of encoding classical strings of -level symbols (dits) into a quantum system of dimension strictly less than . We show that the average success probability of recovering one (randomly chosen) dit from the encoded string can be larger than that obtained in the best classical protocol for the task. Our result is intriguing as we know from Holevo's theorem (and more recently from Frenkel-Weiner's result [Commun. Math. Phys. 340, 563 (2015)]) that there exist communication scenarios wherein quantum resources prove to be of no advantage over classical resources. A distinguishing feature of our protocol is that it establishes a stronger quantum advantage in contrast to the existing quantum -RACs where -level quantum systems are shown to be advantageous over their classical -level counterparts.
arXiv comment5 pages; 1 figure
References in corpus (6)
- Beating the channel capacity limit for linear photonic superdense coding
- Semi-device-independent security of one-way quantum key distribution
- Preparation contextuality powers parity-oblivious multiplexing
- Quantum Random Access Codes using Single -level Systems
- Semi-device independent random number expansion without entanglement
- Limited preparation contextuality in quantum theory and its relation to the Cirel'son bound