University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Quantum Channel Simulation and the Channel's Smooth Max-Information

Quantum Channel Simulation and the Channel's Smooth Max-Information

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact info@newton.ac.uk.

MQIW05 - Beyond I.I.D. in information theory

Co-authors: Xin Wang (Centre for Quantum Software and Information, University of Technology Sydney), Marco Tomamichel (Centre for Quantum Software and Information, University of Technology Sydney), Mario Berta (Department of Computing, Imperial College London)

We study the general framework of quantum channel simulation, that is, the ability of a quantum channel to simulate another one using different classes of codes. First, we show that the minimum error of simulation and the one-shot quantum simulation cost under no-signalling assisted codes are efficiently computable via semidefinite programming. Second, we introduce the channel's smooth max-information, which can be seen as a one-shot generalization of the mutual information of a quantum channel. We provide an exact operational interpretation of the channel's smooth max-information as the one-shot quantum simulation cost. Third, we derive the asymptotic equipartition property (AEP) of the channel's smooth max-information, i.e., it converges to the quantum mutual information of the channel in the independent and identically distributed asymptotic limit. This implies the quantum reverse Shannon theorem (QRST) in the presence of no-signalling correlations. Finally, we explore finite blocklength simulation cost of fundamental quantum channels and provide both numerical and analytical solutions.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2018 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity