Quantum inputs in the prepare-and-measure scenario and stochastic teleportation

Abstract

We investigate prepare-and-measure scenarios in which a sender and a receiver use entanglement to send quantum information over a channel with limited capacity. We formalise this framework, identify its basic properties and provide numerical tools for optimising quantum protocols for generic communication tasks. The seminal protocol for sending quantum information over a classical channel is teleportation. We study a natural stochastic generalisation in which the sender holds $N$ qubits from which the receiver can recover one on demand. We show that with two bits of communication alone, this task can be solved exactly for all $N$, if the sender and receiver have access to stronger-than-quantum nonlocality. We then consider entanglement-based protocols and show that these can be constructed systematically by leveraging connections to several well-known quantum information primitives, such as teleportation, cloning machines and random access coding. In particular, we show that by using genuine multi-particle entangled measurements, one can construct a universal stochastic teleportation machine, i.e.~a device whose teleportation fidelity is independent of the quantum input.

References in corpus (38)

• Quantum Copying: Beyond the No-Cloning Theorem
• Symmetric Informationally Complete Quantum Measurements
• Advances in Quantum Teleportation
• Information Causality as a Physical Principle
• Optimal Cloning of Pure States
• A limit on nonlocality in any world in which communication complexity is not trivial
• SIC-POVMs: A new computer study
• Violation of Bell's inequality: criterion for quantum communication complexity advantage
• Popescu-Rohrlich correlations as a unit of nonlocality
• Dimension witnesses and quantum state discrimination
• Quantum Random Access Codes using Single $d$-level Systems
• Entanglement assisted random access codes
• All entangled states can demonstrate non-classical teleportation
• Semidefinite Programming in Quantum Information Science
• Enabling computation of correlation bounds for finite-dimensional quantum systems via symmetrisation
• Semidefinite programming relaxations for quantum correlations
• Entanglement-assisted quantum communication with simple measurements
• High-dimensional quantum communication complexity beyond strategies based on Bell's theorem
• Certifying an irreducible 1024-dimensional photonic state using refined dimension witnesses
• Correlations in entanglement-assisted prepare-and-measure scenarios
• Spatial versus Sequential Correlations for Random Access Coding
• Experimental certification of contextuality, coherence and dimension in a programmable universal photonic processor
• Informationally restricted quantum correlations
• Informationally restricted correlations: a general framework for classical and quantum systems
• 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?
• Quantum prescriptions are more ontologically distinct than they are operationally distinguishable
• Higher dimensional communication complexity problems: classical protocols vs quantum ones based on Bell's Theorem or prepare-transmit-measure schemes
• Scalable entanglement certification via quantum communication
• Quantum information causality
• Quantum stochastic communication via high-dimensional entanglement
• Nonsignaling quantum random access code boxes
• Correspondence between entangled states and entangled bases under local transformations
• Interplays between classical and quantum entanglement-assisted communication scenarios
• Simple and general bounds on quantum random access codes
• Absolute dimensionality of quantum ensembles
• Compression of Entanglement Improves Quantum Communication
• Two instances of random access code in the quantum regime