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:1701.08713 · Physical Review A

Complementarity between entanglement-assisted and quantum distributed random access code

Alley Hameedi, Debashis Saha, Piotr Mironowicz, Marcin Pawłowski, Mohamed Bourennane

Published May 25, 2017• 25 citations
arXivHTMLPDF

Abstract

Collaborative communication tasks such as random access codes (RACs) employing quantum resources have manifested great potential in enhancing information processing capabilities beyond the classical limitations. The two quantum variants of RACs, namely, quantum random access code (QRAC) and the entanglement-assisted random access code (EARAC), have demonstrated equal prowess for a number of tasks. However, there do exist specific cases where one outperforms the other. In this article, we study a family of $3\ensuremath{\rightarrow}1$ distributed RACs [J. Bowles, N. Brunner, and M. Paw\l{}owski, Phys. Rev. A 92, 022351 (2015)] and present its general construction of both the QRAC and the EARAC. We demonstrate that, depending on the function of inputs that is sought, if QRAC achieves the maximal success probability then EARAC fails to do so and vice versa. Moreover, a tripartite Bell-type inequality associated with the EARAC variants reveals the genuine multipartite nonlocality exhibited by our protocol. We conclude with an experimental realization of the $3\ensuremath{\rightarrow}1$ distributed QRAC that achieves higher success probabilities than the maximum possible with EARACs for a number of tasks.

DOI
10.1103/physreva.95.052345

Related papers

Entanglement-assisted random access codes

Marcin Pawłowski, Marek Żukowski

An $(n,m,p)$ random access code (RAC) makes it possible to encode $n$ bits in an $m$-bit message in such a way that a receiver of the message can guess any of the original $n$ bits with probability $p$ greater than $\frac{1}{2}$. In quantum RACs (QRACs), one transmits $n$ qubits. The full set of primitive entanglement-assisted random access codes (EARACs) is introduced, in which parties are allowed to share a two-qubit singlet. It is shown that via a concatenation of these, one can build for any $n$ an $(n,1,p)$ EARAC. QRACs for $n>3$ exist only if parties also share classical randomness. We show that EARACs outperform the best of known QRACs not only in the success probabilities but also in the amount of communication needed in the preparatory stage of the protocol. Upper bounds on the performance of EARACs are given and shown to limit also QRACs.

arXiv:0906.0524•Physical Review A•Apr 27, 2010•106 citations

Experimental generation of entanglement-assisted quantum random access code

Xiao-Run Wang, Luyan Wu, Chenxi Liu +3 more

$n\ensuremath{\rightarrow}m$ random access code (RAC) is an information task to encode an $n$-bit random message into a shorter $m$-bit string. Resulting from the compression loss from $n$ to $m$ bits, there exists success probabilities for the string receiver to recover any bits of the initial message. It has been shown that success probabilities of bit recovery can be enhanced by employing quantum resources. Here we present experimental realizations of $2\ensuremath{\rightarrow}1$ and $3\ensuremath{\rightarrow}1$ distributed entanglement-assisted random access codes (EARACs) with a two-photon entangled source. The average success probabilities obtained in our experiment are $0.8491(41)$ for a $2\ensuremath{\rightarrow}1$ EARAC and $0.7724(34)$ for a $3\ensuremath{\rightarrow}1$ EARAC, exceeding the classical counterparts, respectively. Moreover, through the existing experimental data, success probabilities for $n$ varying from 4 to 10 ($m=1$) are estimated.

Physical Review A•May 9, 2019•8 citations

Quantum Random Access Codes for Boolean Functions

João Fernando Doriguello, Ashley Montanaro

An n↦pm random access code (RAC) is an encoding of n bits into m bits such that any initial bit can be recovered with probability at least p , while in a quantum RAC (QRAC), the n bits are encoded into m qubits. Since its proposal, the idea of RACs was generalized in many different ways, e.g. allowing the use of shared entanglement (called entanglement-assisted random access code, or simply EARAC) or recovering multiple bits instead of one. In this paper we generalize the idea of RACs to recovering the value of a given Boolean function f on any subset of fixed size of the initial bits, which we call f -random access codes. We study and give protocols for f -random access codes with classical ( f -RAC) and quantum ( f -QRAC) encoding, together with many different resources, e.g. private or shared randomness, shared entanglement ( f -EARAC) and Popescu-Rohrlich boxes ( f -PRRAC). The success probability of our protocols is characterized by the noise stability of the Boolean function f . Moreover, we give an upper bound on the success probability of any f -QRAC with shared randomness that matches its success probability up to a multiplicative constant (and f -RACs by extension), meaning that quantum protocols can only achieve a limited advantage over their classical counterparts.

arXiv:2011.06535•Quantum•Mar 7, 2021•20 citations

Intraparticle entanglement-based Random Access Code protocols: Contextuality-enabled quantum advantage and implications

Nilaj Saha, Sumit Mukherjee, Dipankar Home

We provide the first explicit identification and quantitative characterization of the physical origin of the quantum advantage in the Random Access Code (RAC) protocol. This is achieved by formulating the protocol in terms of intraparticle entanglement between co-measurable degrees of freedom of a single particle and establishing a fundamental correspondence between the protocol's success probability and the underlying resource powering it. For this purpose, we use a relevant Bell-type inequality derived from the assumption of noncontextuality of measurement outcomes. The formulated analysis reveals that the magnitude of quantum-mechanical violation of this inequality, signifying a form of quantum contextuality, is quantitatively commensurate with the ``quantum enhancement" of success probability in any intraparticle entanglement-assisted $n$-bit RAC protocol. In particular, the maximal success probability achievable in a quantum $n \mapsto 1$ RAC protocol corresponds to the maximal quantum violation of the relevant Bell-type inequality. Our framework not only demonstrates how quantum contextuality entailed by intraparticle entanglement serves as an effective resource for enhancing RAC performance, but also offers a significant operational advantage: the proposed scheme is readily implementable in a single-particle interferometric setup requiring coherence preservation only for a single particle, rather than between spatially separated entangled systems.

quant-pharXiv:2605.13350•May 14, 2026•0 citations

Two instances of random access code in the quantum regime

Nitica Sakharwade, Michał Studziński, Michał Eckstein +1 more

Abstract We consider two classes of quantum generalisations of random access code (RAC) and study the bounds for probabilities of success for such tasks. It provides a useful framework for the study of certain information processing tasks with constrained resources. The first class is based on a RAC with quantum inputs and output known as the no-signalling quantum RAC (NS-QRAC) box (Grudka et al 2015 Phys. Rev. A 92 052312), where unbounded entanglement and constrained classical communication are allowed. We show that it can be seen as quantum teleportation with constrained classical communication and provide a lower quantum bound for the success probability. We consider two modifications to the NS-QRAC scenario: the first, where unbounded entanglement and constrained quantum communication is allowed and the second, where bounded entanglement and unconstrained classical communication is allowed. We find a monogamy relation for the transmission fidelities, which—in contrast to the usual communication schemes—involves multiple senders and a single receiver. We provide an upper bounds for the latter and a lower one for the former. The second class is based on a RAC with a quantum channel and shared entanglement (Tavakoli et al 2021 PRX Quantum 2 040357). We study the set of tasks where two inputs made of two digits of d-base are encoded over a qudit and a maximally entangled state. We show that such tasks can be seen as quantum dense-coding with constrained quantum communication and explicit protocols, which give lower quantum bounds for the tasks’ efficiency, in dimensions d = 2 , 3 , 4 . The employed encoding utilises Gray codes.

arXiv:2208.14422•New Journal of Physics•May 1, 2023•3 citations

Mutually unbiased balanced functions and generalized random access codes

M Vaisakh, Ram Krishna Patra, Mukta Janpandit +3 more

Quantum resources and protocols are known to outperform their classical counterparts in a variety of communication and information processing tasks. Random access codes (RACs) are one such cryptographically significant family of bipartite communication tasks, wherein the sender encodes a data set (typically a string of input bits) onto a physical system of bounded dimension and transmits it to the receiver, who then attempts to guess a randomly chosen part of the sender's data set (typically one of the sender's input bits). In this work, we introduce a generalization of this task wherein the receiver, in addition to the individual input bits, aims to retrieve randomly chosen functions of the sender's input string. Specifically, we employ sets of mutually unbiased balanced functions, such that perfect knowledge of any one of the constituent functions yields no knowledge about the others. We investigate and bound the performance of (i) classical, (ii) quantum prepare and measure, and (iii) entanglement assisted classical communication (EACC) protocols for the resultant generalized RACs (GRACs). Finally, we detail the case of GRACs with three input bits and find maximal success probabilities for classical, quantum, and EACC protocols, along with the effect of noisy quantum channels on the performance of quantum protocols. Moreover, with the help of this case study, we reveal several characteristic properties of the GRACs which deviate from the standard RACs.

arXiv:2105.03932•Physical Review A•Jul 21, 2021•17 citations
Collaborative communication tasks such as random access codes (RACs) employing quantum resources have manifested great potential in enhancing information processing capabilities beyond the classical limitations. The two quantum variants of RACs, namely, quantum random access code (QRAC) and the entanglement-assisted random access code (EARAC), have demonstrated equal prowess for a number of tasks. However, there do exist specific cases where one outperforms the other. In this article, we study a family of 3\ensuremath→13\ensuremath{\rightarrow}13\ensuremath→1 distributed RACs [J. Bowles, N. Brunner, and M. Paw\l{}owski, Phys. Rev. A 92, 022351 (2015)] and present its general construction of both the QRAC and the EARAC. We demonstrate that, depending on the function of inputs that is sought, if QRAC achieves the maximal success probability then EARAC fails to do so and vice versa. Moreover, a tripartite Bell-type inequality associated with the EARAC variants reveals the genuine multipartite nonlocality exhibited by our protocol. We conclude with an experimental realization of the 3\ensuremath→13\ensuremath{\rightarrow}13\ensuremath→1 distributed QRAC that achieves higher success probabilities than the maximum possible with EARACs for a number of tasks.
An (n,m,p)(n,m,p)(n,m,p) random access code (RAC) makes it possible to encode nnn bits in an mmm-bit message in such a way that a receiver of the message can guess any of the original nnn bits with probability ppp greater than 12\frac{1}{2}21​. In quantum RACs (QRACs), one transmits nnn qubits. The full set of primitive entanglement-assisted random access codes (EARACs) is introduced, in which parties are allowed to share a two-qubit singlet. It is shown that via a concatenation of these, one can build for any nnn an (n,1,p)(n,1,p)(n,1,p) EARAC. QRACs for n>3n>3n>3 exist only if parties also share classical randomness. We show that EARACs outperform the best of known QRACs not only in the success probabilities but also in the amount of communication needed in the preparatory stage of the protocol. Upper bounds on the performance of EARACs are given and shown to limit also QRACs.
$n\ensuremath{\rightarrow}m$ random access code (RAC) is an information task to encode an nnn-bit random message into a shorter mmm-bit string. Resulting from the compression loss from nnn to mmm bits, there exists success probabilities for the string receiver to recover any bits of the initial message. It has been shown that success probabilities of bit recovery can be enhanced by employing quantum resources. Here we present experimental realizations of $2\ensuremath{\rightarrow}1$ and $3\ensuremath{\rightarrow}1$ distributed entanglement-assisted random access codes (EARACs) with a two-photon entangled source. The average success probabilities obtained in our experiment are 0.8491(41)0.8491(41)0.8491(41) for a $2\ensuremath{\rightarrow}1$ EARAC and 0.7724(34)0.7724(34)0.7724(34) for a $3\ensuremath{\rightarrow}1$ EARAC, exceeding the classical counterparts, respectively. Moreover, through the existing experimental data, success probabilities for nnn varying from 4 to 10 (m=1m=1m=1) are estimated.
An n↦pm random access code (RAC) is an encoding of n bits into m bits such that any initial bit can be recovered with probability at least p , while in a quantum RAC (QRAC), the n bits are encoded into m qubits. Since its proposal, the idea of RACs was generalized in many different ways, e.g. allowing the use of shared entanglement (called entanglement-assisted random access code, or simply EARAC) or recovering multiple bits instead of one. In this paper we generalize the idea of RACs to recovering the value of a given Boolean function f on any subset of fixed size of the initial bits, which we call f -random access codes. We study and give protocols for f -random access codes with classical ( f -RAC) and quantum ( f -QRAC) encoding, together with many different resources, e.g. private or shared randomness, shared entanglement ( f -EARAC) and Popescu-Rohrlich boxes ( f -PRRAC). The success probability of our protocols is characterized by the noise stability of the Boolean function f . Moreover, we give an upper bound on the success probability of any f -QRAC with shared randomness that matches its success probability up to a multiplicative constant (and f -RACs by extension), meaning that quantum protocols can only achieve a limited advantage over their classical counterparts.
We provide the first explicit identification and quantitative characterization of the physical origin of the quantum advantage in the Random Access Code (RAC) protocol. This is achieved by formulating the protocol in terms of intraparticle entanglement between co-measurable degrees of freedom of a single particle and establishing a fundamental correspondence between the protocol's success probability and the underlying resource powering it. For this purpose, we use a relevant Bell-type inequality derived from the assumption of noncontextuality of measurement outcomes. The formulated analysis reveals that the magnitude of quantum-mechanical violation of this inequality, signifying a form of quantum contextuality, is quantitatively commensurate with the ``quantum enhancement" of success probability in any intraparticle entanglement-assisted nnn-bit RAC protocol. In particular, the maximal success probability achievable in a quantum n↦1n \mapsto 1n↦1 RAC protocol corresponds to the maximal quantum violation of the relevant Bell-type inequality. Our framework not only demonstrates how quantum contextuality entailed by intraparticle entanglement serves as an effective resource for enhancing RAC performance, but also offers a significant operational advantage: the proposed scheme is readily implementable in a single-particle interferometric setup requiring coherence preservation only for a single particle, rather than between spatially separated entangled systems.
Abstract We consider two classes of quantum generalisations of random access code (RAC) and study the bounds for probabilities of success for such tasks. It provides a useful framework for the study of certain information processing tasks with constrained resources. The first class is based on a RAC with quantum inputs and output known as the no-signalling quantum RAC (NS-QRAC) box (Grudka et al 2015 Phys. Rev. A 92 052312), where unbounded entanglement and constrained classical communication are allowed. We show that it can be seen as quantum teleportation with constrained classical communication and provide a lower quantum bound for the success probability. We consider two modifications to the NS-QRAC scenario: the first, where unbounded entanglement and constrained quantum communication is allowed and the second, where bounded entanglement and unconstrained classical communication is allowed. We find a monogamy relation for the transmission fidelities, which—in contrast to the usual communication schemes—involves multiple senders and a single receiver. We provide an upper bounds for the latter and a lower one for the former. The second class is based on a RAC with a quantum channel and shared entanglement (Tavakoli et al 2021 PRX Quantum 2 040357). We study the set of tasks where two inputs made of two digits of d-base are encoded over a qudit and a maximally entangled state. We show that such tasks can be seen as quantum dense-coding with constrained quantum communication and explicit protocols, which give lower quantum bounds for the tasks’ efficiency, in dimensions d = 2 , 3 , 4 . The employed encoding utilises Gray codes.
Quantum resources and protocols are known to outperform their classical counterparts in a variety of communication and information processing tasks. Random access codes (RACs) are one such cryptographically significant family of bipartite communication tasks, wherein the sender encodes a data set (typically a string of input bits) onto a physical system of bounded dimension and transmits it to the receiver, who then attempts to guess a randomly chosen part of the sender's data set (typically one of the sender's input bits). In this work, we introduce a generalization of this task wherein the receiver, in addition to the individual input bits, aims to retrieve randomly chosen functions of the sender's input string. Specifically, we employ sets of mutually unbiased balanced functions, such that perfect knowledge of any one of the constituent functions yields no knowledge about the others. We investigate and bound the performance of (i) classical, (ii) quantum prepare and measure, and (iii) entanglement assisted classical communication (EACC) protocols for the resultant generalized RACs (GRACs). Finally, we detail the case of GRACs with three input bits and find maximal success probabilities for classical, quantum, and EACC protocols, along with the effect of noisy quantum channels on the performance of quantum protocols. Moreover, with the help of this case study, we reveal several characteristic properties of the GRACs which deviate from the standard RACs.