Quantum Random Access Codes for Boolean Functions
arXiv:2011.06535 · doi:10.22331/q-2021-03-07-402
Abstract
An random access code (RAC) is an encoding of bits into bits such that any initial bit can be recovered with probability at least , while in a quantum RAC (QRAC), the bits are encoded into 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 on any subset of fixed size of the initial bits, which we call -random access codes. We study and give protocols for -random access codes with classical (-RAC) and quantum (-QRAC) encoding, together with many different resources, e.g. private or shared randomness, shared entanglement (-EARAC) and Popescu-Rohrlich boxes (-PRRAC). The success probability of our protocols is characterized by the \emph{noise stability} of the Boolean function . Moreover, we give an \emph{upper bound} on the success probability of any -QRAC with shared randomness that matches its success probability up to a multiplicative constant (and -RACs by extension), meaning that quantum protocols can only achieve a limited advantage over their classical counterparts.
Final version to appear in Quantum. Small improvements to Theorem 23
References in corpus (8)
- Semi-device-independent security of one-way quantum key distribution
- Preparation contextuality powers parity-oblivious multiplexing
- A lower bound on the dimension of a quantum system given measured data
- Quantum Random Access Codes using Single -level Systems
- (4,1)-Quantum Random Access Coding Does Not Exist
- Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval
- Extrema of discrete Wigner functions and applications
- Unbounded-error One-way Classical and Quantum Communication Complexity