Quantum Advantages in (n,d)->1 Random Access Codes
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2015
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866929641409740800 |
|---|---|
| author | Ambainis, Andris Kravchenko, Dmitry Sazim, Sk Bae, Joonwoo Rai, Ashutosh |
| author_facet | Ambainis, Andris Kravchenko, Dmitry Sazim, Sk Bae, Joonwoo Rai, Ashutosh |
| contents | A random access code (RAC), corresponding to a communication primitive with various applications in quantum information theory, is an instance of a preparation-and-measurement scenario. In this work, we consider (n,d)-RACs constituting an "n"-length string, constructed from a "d" size set of letters, and send an encoding of the string in a single d-level physical system and present their quantum advantages. We first characterize optimal classical RACs, proving that the well-known classical strategy known as majority-encoding-identity-decoding is indeed optimal. We then construct a quantum protocol by exploiting only two incompatible measurements, the minimal requirement, and show the advantages beyond the classical one. We also discuss the generality of our results and whether quantum advantages are valid for all types of (n, d)->1 RACs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1510_03045 |
| institution | arXiv |
| publishDate | 2015 |
| record_format | arxiv |
| spellingShingle | Quantum Advantages in (n,d)->1 Random Access Codes Ambainis, Andris Kravchenko, Dmitry Sazim, Sk Bae, Joonwoo Rai, Ashutosh Quantum Physics Computational Complexity Information Theory A random access code (RAC), corresponding to a communication primitive with various applications in quantum information theory, is an instance of a preparation-and-measurement scenario. In this work, we consider (n,d)-RACs constituting an "n"-length string, constructed from a "d" size set of letters, and send an encoding of the string in a single d-level physical system and present their quantum advantages. We first characterize optimal classical RACs, proving that the well-known classical strategy known as majority-encoding-identity-decoding is indeed optimal. We then construct a quantum protocol by exploiting only two incompatible measurements, the minimal requirement, and show the advantages beyond the classical one. We also discuss the generality of our results and whether quantum advantages are valid for all types of (n, d)->1 RACs. |
| title | Quantum Advantages in (n,d)->1 Random Access Codes |
| topic | Quantum Physics Computational Complexity Information Theory |
| url | https://arxiv.org/abs/1510.03045 |