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.
A nd\ensuremath→p1 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 22\ensuremath→p1 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.
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 .
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.
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.
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>21. Such a code is denoted by the triple (n,m,p). It is known that n<4m for all QRACs and n<2m for classical RACs. These bounds are also known to be tight, as explicit constructions exist for n=4m−1 and n=2m−1 for quantum and classical codes respectively. We generalize (Q)RACs to a scheme encoding nd-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 d1. We construct explicit solutions for all n≤d−1d2m−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=4m−1,m,p) QRACs, 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) QRACs with classical (n,2m,pc) RACs, we can always find pq≥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) 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.
A quantum random access code (QRAC) is a map x↦ρx that encodes n-bit strings x into m-qubit quantum states ρx, in a way that allows us to recover any one bit of x with success probability ≥p. The measurement on ρx that is used to recover, say, x1 may destroy all the information about the other bits; this is in fact what happens in the well-known QRAC that encodes n=2 bits into m=1 qubits. Does this generalize to large n, i.e., could there exist QRACs that are so "obfuscated" that one cannot get much more than one bit out of them? Here we show that this is not the case: for every QRAC there exists a measurement that (with high probability) recovers the full n-bit string x up to small Hamming distance, even for the worst-case x.
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>21. We generalize (Q)RACs to a scheme encoding nd-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 d1. 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,pq) QRACs with classical (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) 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.