Entanglement assisted random access codes
arXiv:0906.0524 · doi:10.1103/PhysRevA.81.042326
Abstract
An (n,m,p) Random Access Code (RAC) allows 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 bits with probability p, greater than 1/2. In Quantum RAC's (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. QRAC's for n>3 exist only if parties additionally share classical randomness (SR). 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.
4 pages, 1 figure, published version
References in corpus (3)
Cited by in corpus (64)
- High-dimensional quantum communication: benefits, progress, and future challenges
- Almost quantum correlations
- Quantum Random Access Codes using Single -level Systems
- Semi-device independent random number expansion protocol with n to 1 quantum random access codes
- Semidefinite programming relaxations for quantum correlations
- Information causality from an entropic and a probabilistic perspective
- High-dimensional quantum communication complexity beyond strategies based on Bell's theorem
- Correlations in entanglement-assisted prepare-and-measure scenarios
- Spatial versus Sequential Correlations for Random Access Coding
- Robustness of Device Independent Dimension Witnesses
- Experimental two-way communication with one photon
- Informationally restricted quantum correlations
- Hyperbits: the information quasiparticles
- When Are Popescu-Rohrlich Boxes and Random Access Codes Equivalent?
- Entanglement in prepare-and-measure scenarios: many questions, a few answers
- Semi-device-independent certification of entanglement in superdense coding
- Complementarity between entanglement-assisted and quantum distributed random access code
- Does violation of a Bell inequality always imply quantum advantage in a communication complexity problem?
- Quantum communication complexity beyond Bell nonlocality
- Relation between semi- and fully-device-independent protocols
- Improved Classical and Quantum Random Access Codes
- Mutually Unbiased Balanced Functions & Generalized Random Access Codes
- One-out-of- spacetime-constrained oblivious transfer
- Quantum Random Access Codes for Boolean Functions
- Higher dimensional communication complexity problems: classical protocols vs quantum ones based on Bell's Theorem or prepare-transmit-measure schemes
- The Magical Number Seven: An Unexpected Dimensional Threshold in Quantum Communication Complexity
- Widening the sharpness modulation region of an entanglement-assisted sequential quantum random access code: Theory, experiment, and application
- Quantum information causality
- Information Causality without concatenation
- Activating Strongest Possible Nonlocality from Local Sets: An Elimination Paradigm
- Ability of unbounded pairs of observers to achieve quantum advantage in random access codes with a single pair of qubits
- Resource theoretic efficacy of the single copy of a two-qubit entangled state in a sequential network
- Quantum stochastic communication via high-dimensional entanglement
- Adaptive advantage in entanglement-assisted communications
- Superunsteerability as a quantifiable resource for random access codes assisted by Bell-diagonal states
- Quantum Blackjack or Can MIT Bring Down the House Again?
- Nonsignaling quantum random access code boxes
- Structure of the sets of mutually unbiased bases with cyclic symmetry
- Monogamy of Information Causality
- Classical analogue of quantum superdense coding and communication advantage of a single quantum system
- Recursive Quantum Relaxation for Combinatorial Optimization Problems
- Interplays between classical and quantum entanglement-assisted communication scenarios
- Simple and general bounds on quantum random access codes
- Mutually unbiased maximally entangled bases from difference matrices
- Random access test as an identifier of nonclassicality
- Advantages of quantum communication revealed by the reexamination of hyperbit theory limitations
- Semi-device-independent certification of quantum non-Markovianity using sequential Random Access Codes
- Certifying quantumness beyond steering and nonlocality and its implications on quantum information processing
- Multiparty quantum random access codes
- Quantum Bell inequalities from Information Causality -- tight for Macroscopic Locality
- Detection Efficiency Bounds in (Semi-)Device-Independent Scenarios
- Sufficient conditions for quantum advantage in random access code protocols with two-qubit states
- Role of nonclassical temporal correlation in powering quantum random access codes
- New bounds of Mutually unbiased maximally entangled bases in C^d\otimes C^{kd}
- Limitation of maximally entangled probes for single-shot distinguishability of unitaries
- The role of entanglement in energy-restricted communication and randomness generation
- Two instances of random access code in the quantum regime
- Detecting quantum resources in a semi-device independent framework
- Semi-device-independent self-testing of unitary operations
- Random access codes via quantum contextual redundancy
- Intrinsic asymmetry with respect to adversary: new feature of Bell inequalities
- Semi-device-independent randomness certification on discretized continuous-variable platforms
- Quantum inputs in the prepare-and-measure scenario and stochastic teleportation
- Contextuality, superlocality and nonclassicality of supernoncontextuality