Quantum Random Access Codes Implementation for Resource Allocation and Coexistence with Classical Telecommunication

Investigating Quantum Network Constraints with Quantum Random Access Codes

In a world where Quantum Networks are rapidly becoming a reality, the development of the Quantum Internet is gaining increasing interest. Nevertheless, modern quantum networks are still in the early stages of development and have limited capacity to distribute resources among different users. This work aims to investigate these constraints, using a novel setup for implementing Quantum Random Access Codes (QRACs), communication protocols known for their quantum advantage over their classical counterparts and semi-device-independent self-testing applications.

We made the QRAC states, for the first time, using weak coherent pulses instead of entangled single photons. This allows us to experimentally test the encoding and decoding strategy from the resource allocation perspective. Moreover, by emulating a coexistent classical communication, we test the resilience of the implementation in the presence of noise. The achieved results represent a significant milestone both for theoretical studies of quantum resource allocation and for the implementation of quantum infrastructures capable of coexisting with regular telecommunication networks.

Achieving Optimal Quantum Resource Allocation

For the first time, a setup capable of performing Quantum Random Access Code, a communication protocol known for showing quantum advantage, is implemented utilizing weak coherent pulses instead of real single photons. The results for 2 and 4D quantum states demonstrate an optimal allocation of quantum resources, a question of utmost importance in quantum networks and quantum internet.image

Quantum Random Access Codes

Reference paper

Quantum Random Access Codes Implementation for Resource Allocation and Coexistence with Classical Telecommunication, Ribezzo, D (Ribezzo, Domenico); Salazar, R (Salazar, Roberto)Czartowski, J (Czartowski, Jakub)Segur, F (Segur, Flora); Lemmi, G (Lemmi, Gianmarco); Petitjean, A (Petitjean, Antoine)Farrugia, N (Farrugia, NoelBacco, D (Bacco, Davide)Xuereb, A (Xuereb, Andre)Zavatta, A (Zavatta, Alessandro), 2023, 7, 4, doi: 10.1002/qute.202300162