Quantum advantages in random access codes
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 lette...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IOP Publishing
2024-01-01
|
| Series: | New Journal of Physics |
| Subjects: | |
| Online Access: | https://doi.org/10.1088/1367-2630/ad9bdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1846116196671291392 |
|---|---|
| author | Andris Ambainis Dmitry Kravchenko Sk Sazim Joonwoo Bae Ashutosh Rai |
| author_facet | Andris Ambainis Dmitry Kravchenko Sk Sazim Joonwoo Bae Ashutosh Rai |
| author_sort | Andris Ambainis |
| collection | DOAJ |
| description | 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 and prove that a known classical strategy, called majority-encoding-identity-decoding , is 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) \!\mapsto\! 1$ RACs. |
| format | Article |
| id | doaj-art-ad0456d69df04356af20b410d40a9a3b |
| institution | Kabale University |
| issn | 1367-2630 |
| language | English |
| publishDate | 2024-01-01 |
| publisher | IOP Publishing |
| record_format | Article |
| series | New Journal of Physics |
| spelling | doaj-art-ad0456d69df04356af20b410d40a9a3b2024-12-19T10:01:48ZengIOP PublishingNew Journal of Physics1367-26302024-01-01261212302310.1088/1367-2630/ad9bdfQuantum advantages in random access codesAndris Ambainis0Dmitry Kravchenko1Sk Sazim2https://orcid.org/0000-0003-3117-0785Joonwoo Bae3https://orcid.org/0000-0002-2345-1619Ashutosh Rai4https://orcid.org/0000-0001-9393-7203Faculty of Computing, University of Latvia , Raina bulv. 19, Riga LV-1586, LatviaFaculty of Computing, University of Latvia , Raina bulv. 19, Riga LV-1586, LatviaCenter for Theoretical Physics, Polish Academy of Sciences , Aleja Lotników 32/46, 02-668 Warsaw, PolandSchool of Electrical Engineering, Korea Advanced Institute of Science and Technology (KAIST) , 291 Daehak-ro, Yuseong-gu, Daejeon 34141, Republic of KoreaSchool of Electrical Engineering, Korea Advanced Institute of Science and Technology (KAIST) , 291 Daehak-ro, Yuseong-gu, Daejeon 34141, Republic of KoreaA 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 and prove that a known classical strategy, called majority-encoding-identity-decoding , is 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) \!\mapsto\! 1$ RACs.https://doi.org/10.1088/1367-2630/ad9bdfquantum communicationrandom access codesclassical optimal boundsquantum advantages |
| spellingShingle | Andris Ambainis Dmitry Kravchenko Sk Sazim Joonwoo Bae Ashutosh Rai Quantum advantages in random access codes New Journal of Physics quantum communication random access codes classical optimal bounds quantum advantages |
| title | Quantum advantages in random access codes |
| title_full | Quantum advantages in random access codes |
| title_fullStr | Quantum advantages in random access codes |
| title_full_unstemmed | Quantum advantages in random access codes |
| title_short | Quantum advantages in random access codes |
| title_sort | quantum advantages in random access codes |
| topic | quantum communication random access codes classical optimal bounds quantum advantages |
| url | https://doi.org/10.1088/1367-2630/ad9bdf |
| work_keys_str_mv | AT andrisambainis quantumadvantagesinrandomaccesscodes AT dmitrykravchenko quantumadvantagesinrandomaccesscodes AT sksazim quantumadvantagesinrandomaccesscodes AT joonwoobae quantumadvantagesinrandomaccesscodes AT ashutoshrai quantumadvantagesinrandomaccesscodes |