Adaptive advantage in entanglement-assisted communications
arXiv:2203.05372 · doi:10.1103/PhysRevLett.129.120504
Abstract
Entanglement is known to boost the efficiency of classical communication. In distributed computation, for instance, exploiting entanglement can reduce the number of communicated bits or increase the probability to obtain a correct answer. Entanglement-assisted classical communication protocols usually consist of two successive rounds: first a Bell test round, in which the parties measure their local shares of the entangled state, and then a communication round, where they exchange classical messages. Here, we go beyond this standard approach and investigate adaptive uses of entanglement: we allow the receiver to wait for the arrival of the sender's message before measuring his share of the entangled state. We first show that such adaptive protocols improve the success probability in Random Access Codes. Second, we show that once adaptive measurements are used, an entanglement-assisted bit becomes a strictly stronger resource than a qubit in prepare-and-measure scenarios. We briefly discuss extension of these ideas to scenarios involving quantum communication and identify resource inequalities.
arXiv comment6 pages, 2 figures
References in corpus (30)
- Information Causality as a Physical Principle
- A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
- Non-locality and Communication Complexity
- Bounding the set of quantum correlations
- Substituting Quantum Entanglement for Communication
- Symmetry groups, semidefinite programs, and sums of squares
- Violation of Bell's inequality: criterion for quantum communication complexity advantage
- Quantum communication complexity protocol with two entangled qutrits
- Distinguishing Bipartitite Orthogonal States using LOCC: Best and Worst Cases
- Quantum Entanglement and Communication Complexity
- Quantum Random Access Codes using Single -level Systems
- Self-testing quantum states and measurements in the prepare-and-measure scenario
- Entanglement assisted random access codes
- Bounding the set of finite dimensional quantum correlations
- Zero-error channel capacity and simulation assisted by non-local correlations
- (4,1)-Quantum Random Access Coding Does Not Exist
- Violation of local realism vs detection efficiency
- Enabling computation of correlation bounds for finite-dimensional quantum systems via symmetrisation
- Quantum communication complexity advantage implies violation of a Bell inequality
- Connections Between Mutually Unbiased Bases and Quantum Random Access Codes
- Quantum random access codes and incompatibility of measurements
- Correlations in entanglement-assisted prepare-and-measure scenarios
- Spatial versus Sequential Correlations for Random Access Coding
- Hyperbits: the information quasiparticles
- Entanglement in prepare-and-measure scenarios: many questions, a few answers
- Does violation of a Bell inequality always imply quantum advantage in a communication complexity problem?
- Mutually Unbiased Balanced Functions & Generalized Random Access Codes
- Higher dimensional communication complexity problems: classical protocols vs quantum ones based on Bell's Theorem or prepare-transmit-measure schemes
- On entanglement assistance to a noiseless classical channel
- Robust Bell inequalities from communication complexity