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

IET conference proceedings.

QRAC implementation with optimal resource allocation

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

Published Nov 13, 2023• 0 citations
Publisher

Abstract

We implement a novel quantum random access code protocol exploiting weak pulses and made by a fiber setup fully integrable in the standard telecomunication infrastructure. We demonstrate a quantum advantage compared to the classical RAC schemes for two and four-dimensional encoding for different noise level.
DOI
10.1049/icp.2023.2570

Related papers

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

Domenico Ribezzo, Roberto Salazar, Jakub Czartowski +7 more

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.

arXiv:2403.19000•Advanced Quantum Technologies•Dec 20, 2023•0 citations

Semidefinite-programming-based optimization of quantum random access codes over noisy channels

Rafael A. da Silva, Breno Marques

There are many approaches when it comes to exploring the potential of the random access code (RAC) communication protocol. Given its versatility, the RAC is particularly useful when the communication between parties is restricted. In previous works, it has been proven that ${2}^{(d)}\ensuremath{\rightarrow}1$ quantum random access codes (QRAC), in the absence of noise, outperform their classical counterpart (the ${2}^{(d)}\ensuremath{\rightarrow}1$ CRAC) for any dimension $d$. Here, building upon these works, we showed that noisy channels can significantly decrease the performance of ${2}^{(d)}\ensuremath{\rightarrow}1$ QRAC. In order to mitigate noise-driven efficiency losses, we employed the see-saw optimization algorithm with semidefinite programming (SDP) to find the best quantum encoding and decoding strategies for the QRAC given a known quantum channel.

arXiv:2204.09485•Physical Review A•Apr 28, 2023•9 citations

Improved classical and quantum random access codes

Ola Liabøtrø

A (quantum) random access code ((Q)RAC) is a scheme that encodes $n$ bits into $m$ (qu)bits such that any of the $n$ bits can be recovered with a worst case probability $p>\frac{1}{2}$. We generalize (Q)RACs to a scheme encoding $n$ $d$-levels into $m$ (quantum) $d$-levels such that any $d$-level can be recovered with the probability for every wrong outcome value being less than $\frac{1}{d}$. We construct explicit solutions for all $n\ensuremath{\le}\frac{{d}^{2m}\ensuremath{-}1}{d\ensuremath{-}1}$. For $d=2$, the constructions coincide with those previously known. We show that the (Q)RACs are $d$-parity oblivious, generalizing ordinary parity obliviousness. We further investigate optimization of the success probabilities. For $d=2$, we use the measure operators of the previously best-known solutions, but improve the encoding states to give a higher success probability. We conjecture that for maximal $(n={4}^{m}\ensuremath{-}1,m,p)$ QRACs, $p=\frac{1}{2}{1+{[{(\sqrt{3}+1)}^{m}\ensuremath{-}1]}^{\ensuremath{-}1}}$ is possible, and show that it is an upper bound for the measure operators that we use. We then compare $(n,m,{p}_{q})$ QRACs with classical $(n,2m,{p}_{c})$ RACs. We can always find ${p}_{q}\ensuremath{\ge}{p}_{c}$, but the classical code gives information about every input bit simultaneously, while the QRAC only gives information about a subset. For several different $(n,2,p)$ QRACs, we see the same trade-off, as the best $p$ values are obtained when the number of bits that can be obtained simultaneously is as small as possible. The trade-off is connected to parity obliviousness, since high certainty information about several bits can be used to calculate probabilities for parities of subsets.

arXiv:1607.02667•Physical Review A•May 8, 2017•22 citations

Noise-resilient quantum random access codes

H. S. Karthik, Santiago Gómez, Felipe Quinteros +5 more

A ${n}^{d}\stackrel{p}{\ensuremath{\rightarrow}}1$ quantum random access code (QRAC) is a communication task where Alice encodes $n$ classical bits into quantum states of dimension $d$ and transmits them to Bob, who performs appropriate measurements to recover the required bit with probability $p$. In the presence of a noisy environment, the performance of a QRAC is degraded, losing the advantage over classical strategies. We propose a practical technique that enables noise tolerance in such scenarios, recovering the quantum advantage in retrieving the required bit. We perform a photonic implementation of a ${2}^{2}\stackrel{\text{p}}{\ensuremath{\rightarrow}}1$ QRAC using polarization-encoded qubits under an amplitude-damping channel, where simple operations allow for noise robustness showing the revival of the quantum advantage when the noisy channel degrades the performance of the QRAC. This revival can be observed by violating a suitable dimension witness, which is closely related to the average success probability of the QRAC. This technique can be extended to other applications in the so-called prepare-and-measure scenario, enhancing the semi-device-independent protocol implementations.

arXiv:2411.07924•Physical Review A•Mar 18, 2025•4 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•138 citations

Quantum Random Access Codes encoding every possible number of bits into m qubits

Ola Liabøtrø

A (Quantum) Random Access Code ((Q)RAC) is a scheme that encodes $n$ bits into $m$ (qu)bits such that any of the $n$ bits can be recovered with a worst case probability $p>\frac{1}{2}$. Such a code is denoted by the triple $(n,m,p)$. It is known that $n<4^m$ for all QRACs and $n<2^m$ for classical RACs. These bounds are also known to be tight, as explicit constructions exist for $n=4^m-1$ and $n=2^m-1$ for quantum and classical codes respectively. We generalize (Q)RACs to a scheme encoding $n$ $d$-levels into $m$ (qu)-$d$-levels such that any $d$-level can be recovered with the probability for every wrong outcome value being less than $\frac{1}{d}$. We construct explicit solutions for all $n\leq \frac{d^{2m}-1}{d-1}$. For $d=2$, the constructions coincide with those previously known. We show that the (Q)RACs are $d$-parity-oblivious, generalizing ordinary parity-obliviousness. We further investigate optimization of the success probabilities. For $d=2$, we use the measure operators of the previously best known solutions, but improve the encoding states to give a higher success probability. We conjecture that for maximal $(n=4^m-1,m,p)$ QRACs, $p=\frac{1+\frac{1}{(\sqrt{3}+1)^m-1}}{2}$ is possible and show that it is an upper bound for the measure operators that we use. When we compare $(n,m,p_q)$ QRACs with classical $(n,2m,p_c)$ RACs, we can always find $p_q\geq p_c$, but the classical code gives information about every input bit simultaneously, while the QRAC only gives information about a subset. For several different $(n,2,p)$ QRACs, we see the same trade-off, as the best $p$ values are obtained when the number of bits that can be obtained simultaneously is as small as possible. The trade-off is connected to parity-obliviousness, since high certainty information about several bits can be used to calculate probabilities for parities of subsets.

•Jul 9, 2016•0 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.
There are many approaches when it comes to exploring the potential of the random access code (RAC) communication protocol. Given its versatility, the RAC is particularly useful when the communication between parties is restricted. In previous works, it has been proven that ${2}^{(d)}\ensuremath{\rightarrow}1$ quantum random access codes (QRAC), in the absence of noise, outperform their classical counterpart (the ${2}^{(d)}\ensuremath{\rightarrow}1$ CRAC) for any dimension ddd. Here, building upon these works, we showed that noisy channels can significantly decrease the performance of ${2}^{(d)}\ensuremath{\rightarrow}1$ QRAC. In order to mitigate noise-driven efficiency losses, we employed the see-saw optimization algorithm with semidefinite programming (SDP) to find the best quantum encoding and decoding strategies for the QRAC given a known quantum channel.
A (quantum) random access code ((Q)RAC) is a scheme that encodes nnn bits into mmm (qu)bits such that any of the nnn bits can be recovered with a worst case probability p>12p>\frac{1}{2}p>21​. We generalize (Q)RACs to a scheme encoding nnn ddd-levels into mmm (quantum) ddd-levels such that any ddd-level can be recovered with the probability for every wrong outcome value being less than 1d\frac{1}{d}d1​. We construct explicit solutions for all $n\ensuremath{\le}\frac{{d}^{2m}\ensuremath{-}1}{d\ensuremath{-}1}$. For d=2d=2d=2, the constructions coincide with those previously known. We show that the (Q)RACs are ddd-parity oblivious, generalizing ordinary parity obliviousness. We further investigate optimization of the success probabilities. For d=2d=2d=2, we use the measure operators of the previously best-known solutions, but improve the encoding states to give a higher success probability. We conjecture that for maximal $(n={4}^{m}\ensuremath{-}1,m,p)$ QRACs, $p=\frac{1}{2}{1+{[{(\sqrt{3}+1)}^{m}\ensuremath{-}1]}^{\ensuremath{-}1}}$ is possible, and show that it is an upper bound for the measure operators that we use. We then compare (n,m,pq)(n,m,{p}_{q})(n,m,pq​) QRACs with classical (n,2m,pc)(n,2m,{p}_{c})(n,2m,pc​) RACs. We can always find ${p}_{q}\ensuremath{\ge}{p}_{c}$, but the classical code gives information about every input bit simultaneously, while the QRAC only gives information about a subset. For several different (n,2,p)(n,2,p)(n,2,p) QRACs, we see the same trade-off, as the best ppp values are obtained when the number of bits that can be obtained simultaneously is as small as possible. The trade-off is connected to parity obliviousness, since high certainty information about several bits can be used to calculate probabilities for parities of subsets.
A ${n}^{d}\stackrel{p}{\ensuremath{\rightarrow}}1$ quantum random access code (QRAC) is a communication task where Alice encodes nnn classical bits into quantum states of dimension ddd and transmits them to Bob, who performs appropriate measurements to recover the required bit with probability ppp. In the presence of a noisy environment, the performance of a QRAC is degraded, losing the advantage over classical strategies. We propose a practical technique that enables noise tolerance in such scenarios, recovering the quantum advantage in retrieving the required bit. We perform a photonic implementation of a ${2}^{2}\stackrel{\text{p}}{\ensuremath{\rightarrow}}1$ QRAC using polarization-encoded qubits under an amplitude-damping channel, where simple operations allow for noise robustness showing the revival of the quantum advantage when the noisy channel degrades the performance of the QRAC. This revival can be observed by violating a suitable dimension witness, which is closely related to the average success probability of the QRAC. This technique can be extended to other applications in the so-called prepare-and-measure scenario, enhancing the semi-device-independent protocol implementations.
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.
A (Quantum) Random Access Code ((Q)RAC) is a scheme that encodes nnn bits into mmm (qu)bits such that any of the nnn bits can be recovered with a worst case probability p>12p>\frac{1}{2}p>21​. Such a code is denoted by the triple (n,m,p)(n,m,p)(n,m,p). It is known that n<4mn<4^mn<4m for all QRACs and n<2mn<2^mn<2m for classical RACs. These bounds are also known to be tight, as explicit constructions exist for n=4m−1n=4^m-1n=4m−1 and n=2m−1n=2^m-1n=2m−1 for quantum and classical codes respectively. We generalize (Q)RACs to a scheme encoding nnn ddd-levels into mmm (qu)-ddd-levels such that any ddd-level can be recovered with the probability for every wrong outcome value being less than 1d\frac{1}{d}d1​. We construct explicit solutions for all n≤d2m−1d−1n\leq \frac{d^{2m}-1}{d-1}n≤d−1d2m−1​. For d=2d=2d=2, the constructions coincide with those previously known. We show that the (Q)RACs are ddd-parity-oblivious, generalizing ordinary parity-obliviousness. We further investigate optimization of the success probabilities. For d=2d=2d=2, we use the measure operators of the previously best known solutions, but improve the encoding states to give a higher success probability. We conjecture that for maximal (n=4m−1,m,p)(n=4^m-1,m,p)(n=4m−1,m,p) QRACs, p=1+1(3+1)m−12p=\frac{1+\frac{1}{(\sqrt{3}+1)^m-1}}{2}p=21+(3​+1)m−11​​ is possible and show that it is an upper bound for the measure operators that we use. When we compare (n,m,pq)(n,m,p_q)(n,m,pq​) QRACs with classical (n,2m,pc)(n,2m,p_c)(n,2m,pc​) RACs, we can always find pq≥pcp_q\geq p_cpq​≥pc​, but the classical code gives information about every input bit simultaneously, while the QRAC only gives information about a subset. For several different (n,2,p)(n,2,p)(n,2,p) QRACs, we see the same trade-off, as the best ppp values are obtained when the number of bits that can be obtained simultaneously is as small as possible. The trade-off is connected to parity-obliviousness, since high certainty information about several bits can be used to calculate probabilities for parities of subsets.