Complementarity between entanglement-assisted and quantum distributed random access code

Abstract

Collaborative communication tasks such as random access codes (RACs) employing quantum resources have manifested great potential in enhancing information processing capabilities beyond the classical limitations. The two quantum variants of RACs, namely, quantum random access code (QRAC) and the entanglement-assisted random access code (EARAC), have demonstrated equal prowess for a number of tasks. However, there do exist specific cases where one outperforms the other. In this article, we study a family of $3\to 1$ distributed RACs \cite{network} and present its general construction of both the QRAC and the EARAC. We demonstrate that, depending on the function of inputs that is sought, if QRAC achieves the maximal success probability then EARAC fails to do so and vice versa.Moreover, a tripartite Bell-type inequality associated with the EARAC variants reveals the genuine multipartite nonlocality exhibited by our protocol. We conclude with an experimental realization of the $3\to 1$ distributed QRAC that achieves higher success probabilities than the maximum possible with EARACs for a number of tasks.

9 pages, 3 figures

References in corpus (7)

• Quantum cryptography: Public key distribution and coin tossing
• A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
• Semi-device-independent security of one-way quantum key distribution
• Almost quantum correlations
• 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 $d$-level Systems

Cited by in corpus (18)

• High-dimensional quantum communication: benefits, progress, and future challenges
• Sequential random access codes and self-testing of quantum measurement instruments
• Preparation contextuality as an essential feature underlying quantum communication advantage
• High-dimensional quantum communication complexity beyond strategies based on Bell's theorem
• Correlations in entanglement-assisted prepare-and-measure scenarios
• Informationally restricted quantum correlations
• Measurement incompatibility and quantum advantage in communication
• Does violation of a Bell inequality always imply quantum advantage in a communication complexity problem?
• Quantum Correlation Sharing: A Review On Recent Progress From Nonlocality To Other Non-Classical Correlations
• Mutually Unbiased Balanced Functions & Generalized Random Access Codes
• Quantum Random Access Codes for Boolean Functions
• Widening the sharpness modulation region of an entanglement-assisted sequential quantum random access code: Theory, experiment, and application
• Device independent witness of arbitrary dimensional quantum systems employing binary outcome measurements
• Operational nonclassicality of local multipartite correlations in the limited-dimensional simulation scenario
• Advantages of quantum communication revealed by the reexamination of hyperbit theory limitations
• Multiparty quantum random access codes
• Semi-device-independent self-testing of unitary operations
• Limits of Classical correlations and Quantum advantages under (Anti-)Distinguishability constraints in Multipartite Communication