Abstract
Given a quantum channel — that is, a completely positive trace-preserving linear map — as the only communication resource available between two parties, we consider the problem of characterizing the set of classical noisy channels that can be obtained from it by means of suitable classical-quantum encodings and quantum-classical decodings, respectively, on the sender’s and the receiver’s side. We consider various classes of linear witnesses and compute their optimum values in closed form for several classes of quantum channels. The witnesses that we consider here are formulated as communication games, in which Alice’s aim is to exploit a single use of a given quantum channel to help Bob guess some information she has received from an external referee.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
