Quantum Random Access Code in Noisy Channels

Abstract

Random access code (RAC) communication protocol particularly useful when the communication between parties is restricted. In this work we built upon works that have previously proven quantum random access code (QRAC), in the absence of noise, to be more advantageous than classical random access code (CRAC), investigate the effects of noisy channel on QRAC performance and how the losses can be mitigated by using the see-saw method optimized by semi-definite programming when the noisy channel is known.

References in corpus (24)

• Information Causality as a Physical Principle
• Semi-device-independent security of one-way quantum key distribution
• Experimental investigation of the dynamics of entanglement: Sudden death, complementarity, and continuous monitoring of the environment
• Fighting noise with noise in realistic quantum teleportation
• Quantum Random Access Codes using Single $d$-level Systems
• Optimizing practical entanglement distillation
• Self-testing quantum states and measurements in the prepare-and-measure scenario
• Semi-device independent random number expansion protocol with n to 1 quantum random access codes
• High-dimensional quantum teleportation under noisy environments
• Sequential random access codes and self-testing of quantum measurement instruments
• All entangled states can demonstrate non-classical teleportation
• Semidefinite tests for quantum network topologies
• Noise analysis of simultaneous quantum key distribution and classical communication scheme using a true local oscillator
• Connections Between Mutually Unbiased Bases and Quantum Random Access Codes
• Experimental Tests of Classical and Quantum Dimensions
• Quantifying coherence with respect to general quantum measurements
• Quantum random access codes and incompatibility of measurements
• Correlations in entanglement-assisted prepare-and-measure scenarios
• Spatial versus Sequential Correlations for Random Access Coding
• Entanglement in prepare-and-measure scenarios: many questions, a few answers
• Holevo Capacity of Discrete Weyl Channels
• Improved Classical and Quantum Random Access Codes
• Increased Certification of Semi-device Independent Random Numbers using Many Inputs and More Postprocessing
• Quantum Steganography over Noisy Channels: Achievability and Bounds

Cited by in corpus (4)

• Semidefinite programming relaxations for quantum correlations
• Simple and general bounds on quantum random access codes
• Bound entanglement-assisted prepare-and-measure scenarios based on four-dimensional quantum messages
• Semi-device-independent certification of high-dimensional quantum channels