Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2403.19000 · Advanced Quantum Technologies

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

Domenico Ribezzo, Roberto Salazar, Jakub Czartowski, Flora Segur, Gianmarco Lemmi, Antoine Petitjean, Noel Farrugia, André Xuereb, Davide Bacco, Alessandro Zavatta

Published Dec 20, 2023• 0 citations
arXivHTMLPDF

Abstract

Abstract 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 – a constraint that needs to be taken into account. In this work, it 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. The QRAC states, made for the first time using weak coherent pulses instead of entangled single photons, allow us to experimentally test the encoding and decoding strategy from the resource allocation perspective. Moreover, by emulating a coexistent classical communication, it test the resilience of the implementation in 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.

DOI
10.1002/qute.202300162

Related papers

Single Photon Sources and Single Quantum System enabled Communication

Muhammad Alley Hameedi

Quantum information is a highly interesting and fast emerging field that involves processing information encoded into quantum systems and their subsequent use in various information tasks. The use of quantum resources such as superposition and entanglement have shown to enhance information processing capabilities beyond classical means in a number of communication, information and computation tasks. In this thesis, we have used single photons to study the advantage of d-level quantum systems (qudits) for a communication task commonly known as random access codes (RACs). A successful experimental demonstration of quantum random access codes (QRACs) with four dimensions is realized to demonstrate that the higher dimensional QRACs not only outperform the classical RACs but also provide an advantage over their quantum bit (qubit) counterparts. QRACs are also studied in regards to two specific applications: certification of true randomness and for testing the non-classicality of quantum systems. A method for increased certification of generated randomness is realized for the former and a successful experimental demonstration of a test of non-classicality with arbitrarily low detection efficiency is provided for the latter. This is followed by an implementation of a QRAC in a one-path communication network consisting of preparation, transformation and measurement devices. We have shown that the distributed QRAC provides optimal success probabilities for a number of tasks. Moreover, a novel quantum protocol for the solution to the problem of dining cryptographers and anonymous veto voting is also presented. This single photon transmission based protocol provides an efficient solution, which is experimentally demonstrated for a 3-party description. Lastly, Nitrogen-Vacancy (NV) center in diamond is studied as a potential resource for single photon emission and two methods to enhance the photon collection efficiency are successfully explored. Due to this enhancement, single photons from an NV center may also be used in similar single quantum system based communication experiments.

•Jan 1, 2017•0 citations

Unlocking the advantage of qubit communication in multi-node network configurations

Ananya Chakraborty, Sahil Gopalkrishna Naik, Edwin Peter Lobo +5 more

Abstract The extension of point-to-point communication to multi-node configurations has significant applications in internet and telecommunication networks. Quantum resources promise notable advantages in such settings. Here, we demonstrate a novel quantum advantage in simulating multiple access channels (MACs)-a common network configuration where multiple distant senders transmit messages to a single receiver (e.g. the uplink from several mobile phones to a server). Specifically, we show that qubit transmission outperforms its classical counterpart, even when the latter is supplemented with classical shared randomness. Remarkably, unlike the seminal quantum superdense coding protocol, this advantage is achieved without any pre-shared entanglement between the senders and the receiver-a feat prohibited by Holevo and Frenkel–Weiner no-go theorems in the one-sender-one-receiver scenario. The receiver’s ability to simultaneously decode quantum systems from multiple senders underpins this distinct advantage in the MAC setup. Some of our MAC designs are inspired by constructs in quantum foundations, such as the Pusey–Barrett–Rudolph theorem and ‘quantum nonlocality without entanglement’. Beyond network applications, this quantum advantage reveals a deeper connection to ‘quantum nonlocality without inputs’ phenomenon and suggests potential for semi-device-independent certification of entangled measurements.

New Journal of Physics•Feb 1, 2025•2 citations

Quantum Random Access Codes with Shared Randomness

Andris Ambainis, Debbie Leung, Laura Mancinska +1 more

We consider a communication method, where the sender encodes n classical bits into 1 qubit and sends it to the receiver who performs a certain measurement depending on which of the initial bits must be recovered. This procedure is called (n,1,p) quantum random access code (QRAC) where p > 1/2 is its success probability. It is known that (2,1,0.85) and (3,1,0.79) QRACs (with no classical counterparts) exist and that (4,1,p) QRAC with p > 1/2 is not possible. We extend this model with shared randomness (SR) that is accessible to both parties. Then (n,1,p) QRAC with SR and p > 1/2 exists for any n > 0. We give an upper bound on its success probability (the known (2,1,0.85) and (3,1,0.79) QRACs match this upper bound). We discuss some particular constructions for several small values of n. We also study the classical counterpart of this model where n bits are encoded into 1 bit instead of 1 qubit and SR is used. We give an optimal construction for such codes and find their success probability exactly--it is less than in the quantum case. Interactive 3D quantum random access codes are available on-line at http://home.lanet.lv/~sd20008/racs .

arXiv:0810.2937•Oct 16, 2008•48 citations

Quantum Random Access Codes Using Single d -Level Systems

Armin Tavakoli, Alley Hameedi, Breno Marques +1 more

Random access codes (RACs) are used by a party to, with limited communication, access an arbitrary subset of information held by another party. Quantum resources are known to enable RACs that break classical limitations. Here, we study quantum and classical RACs with high-level communication. We derive average performances of classical RACs and present families of high-level quantum RACs. Our results show that high-level quantum systems can significantly increase the advantage of quantum RACs over their classical counterparts. We demonstrate our findings in an experimental realization of a quantum RAC with four-level communication.

arXiv:1504.08105•Physical Review Letters•Apr 29, 2015•128 citations

Sequential random access codes and self-testing of quantum measurement instruments

Karthik Mohan, Armin Tavakoli, Nicolas Brunner

Quantum Random Access Codes (QRACs) are key tools for a variety of protocols in quantum information theory. These are commonly studied in prepare-and-measure scenarios in which a sender prepares states and a receiver measures them. Here, we consider a three-party prepare-transform-measure scenario in which the simplest QRAC is implemented twice in sequence based on the same physical system. We derive optimal trade-off relations between the two QRACs. We apply our results to construct semi-device independent self-tests of quantum instruments, i.e. measurement channels with both a classical and quantum output. Finally, we show how sequential QRACs enable inference of upper and lower bounds on the sharpness parameter of a quantum instrument.

•Jan 1, 2019•22 citations

Sequential random access codes and self-testing of quantum measurement instruments

Karthik Mohan, Armin Tavakoli, Nicolas Brunner

Abstract Quantum random access codes (QRACs) are key tools for a variety of protocols in quantum information theory. These are commonly studied in prepare-and-measure scenarios in which a sender prepares states and a receiver measures them. Here, we consider a three-party prepare-transform-measure scenario in which the simplest QRAC is implemented twice in sequence based on the same physical system. We derive optimal trade-off relations between the two QRACs. We apply our results to construct semi-device independent self-tests of quantum instruments, i.e. measurement channels with both a classical and quantum output. Finally, we show how sequential QRACs enable inference of upper and lower bounds on the sharpness parameter of a quantum instrument.

arXiv:1905.06726•New Journal of Physics•Jul 31, 2019•85 citations
Abstract 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 – a constraint that needs to be taken into account. In this work, it 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. The QRAC states, made for the first time using weak coherent pulses instead of entangled single photons, allow us to experimentally test the encoding and decoding strategy from the resource allocation perspective. Moreover, by emulating a coexistent classical communication, it test the resilience of the implementation in 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.
Quantum information is a highly interesting and fast emerging field that involves processing information encoded into quantum systems and their subsequent use in various information tasks. The use of quantum resources such as superposition and entanglement have shown to enhance information processing capabilities beyond classical means in a number of communication, information and computation tasks. In this thesis, we have used single photons to study the advantage of d-level quantum systems (qudits) for a communication task commonly known as random access codes (RACs). A successful experimental demonstration of quantum random access codes (QRACs) with four dimensions is realized to demonstrate that the higher dimensional QRACs not only outperform the classical RACs but also provide an advantage over their quantum bit (qubit) counterparts. QRACs are also studied in regards to two specific applications: certification of true randomness and for testing the non-classicality of quantum systems. A method for increased certification of generated randomness is realized for the former and a successful experimental demonstration of a test of non-classicality with arbitrarily low detection efficiency is provided for the latter. This is followed by an implementation of a QRAC in a one-path communication network consisting of preparation, transformation and measurement devices. We have shown that the distributed QRAC provides optimal success probabilities for a number of tasks. Moreover, a novel quantum protocol for the solution to the problem of dining cryptographers and anonymous veto voting is also presented. This single photon transmission based protocol provides an efficient solution, which is experimentally demonstrated for a 3-party description. Lastly, Nitrogen-Vacancy (NV) center in diamond is studied as a potential resource for single photon emission and two methods to enhance the photon collection efficiency are successfully explored. Due to this enhancement, single photons from an NV center may also be used in similar single quantum system based communication experiments.
Abstract The extension of point-to-point communication to multi-node configurations has significant applications in internet and telecommunication networks. Quantum resources promise notable advantages in such settings. Here, we demonstrate a novel quantum advantage in simulating multiple access channels (MACs)-a common network configuration where multiple distant senders transmit messages to a single receiver (e.g. the uplink from several mobile phones to a server). Specifically, we show that qubit transmission outperforms its classical counterpart, even when the latter is supplemented with classical shared randomness. Remarkably, unlike the seminal quantum superdense coding protocol, this advantage is achieved without any pre-shared entanglement between the senders and the receiver-a feat prohibited by Holevo and Frenkel–Weiner no-go theorems in the one-sender-one-receiver scenario. The receiver’s ability to simultaneously decode quantum systems from multiple senders underpins this distinct advantage in the MAC setup. Some of our MAC designs are inspired by constructs in quantum foundations, such as the Pusey–Barrett–Rudolph theorem and ‘quantum nonlocality without entanglement’. Beyond network applications, this quantum advantage reveals a deeper connection to ‘quantum nonlocality without inputs’ phenomenon and suggests potential for semi-device-independent certification of entangled measurements.
We consider a communication method, where the sender encodes n classical bits into 1 qubit and sends it to the receiver who performs a certain measurement depending on which of the initial bits must be recovered. This procedure is called (n,1,p) quantum random access code (QRAC) where p > 1/2 is its success probability. It is known that (2,1,0.85) and (3,1,0.79) QRACs (with no classical counterparts) exist and that (4,1,p) QRAC with p > 1/2 is not possible. We extend this model with shared randomness (SR) that is accessible to both parties. Then (n,1,p) QRAC with SR and p > 1/2 exists for any n > 0. We give an upper bound on its success probability (the known (2,1,0.85) and (3,1,0.79) QRACs match this upper bound). We discuss some particular constructions for several small values of n. We also study the classical counterpart of this model where n bits are encoded into 1 bit instead of 1 qubit and SR is used. We give an optimal construction for such codes and find their success probability exactly--it is less than in the quantum case. Interactive 3D quantum random access codes are available on-line at http://home.lanet.lv/~sd20008/racs .
Random access codes (RACs) are used by a party to, with limited communication, access an arbitrary subset of information held by another party. Quantum resources are known to enable RACs that break classical limitations. Here, we study quantum and classical RACs with high-level communication. We derive average performances of classical RACs and present families of high-level quantum RACs. Our results show that high-level quantum systems can significantly increase the advantage of quantum RACs over their classical counterparts. We demonstrate our findings in an experimental realization of a quantum RAC with four-level communication.
Quantum Random Access Codes (QRACs) are key tools for a variety of protocols in quantum information theory. These are commonly studied in prepare-and-measure scenarios in which a sender prepares states and a receiver measures them. Here, we consider a three-party prepare-transform-measure scenario in which the simplest QRAC is implemented twice in sequence based on the same physical system. We derive optimal trade-off relations between the two QRACs. We apply our results to construct semi-device independent self-tests of quantum instruments, i.e. measurement channels with both a classical and quantum output. Finally, we show how sequential QRACs enable inference of upper and lower bounds on the sharpness parameter of a quantum instrument.
Abstract Quantum random access codes (QRACs) are key tools for a variety of protocols in quantum information theory. These are commonly studied in prepare-and-measure scenarios in which a sender prepares states and a receiver measures them. Here, we consider a three-party prepare-transform-measure scenario in which the simplest QRAC is implemented twice in sequence based on the same physical system. We derive optimal trade-off relations between the two QRACs. We apply our results to construct semi-device independent self-tests of quantum instruments, i.e. measurement channels with both a classical and quantum output. Finally, we show how sequential QRACs enable inference of upper and lower bounds on the sharpness parameter of a quantum instrument.