Entanglement-assisted capacities of compound quantum channels

Creators: Berta, Mario; Gharibyan, Hrant; Walter, Michael

Abstract

We study universal quantum codes for entanglementassisted quantum communication over compound quantum channels. In this setting, sender and receiver do not know the specific channel that will be used for communication, but only know the set that the channel is selected from. We investigate different variations of the problem: uninformed users, informed receiver, informed sender, and feedback assistance. We derive single-letter formulas for all corresponding channel capacities. Our proofs are based on one-shot decoupling bounds and properties of smooth entropies.

Additional Information

© 2016 IEEE. Manuscript received March 30, 2016; revised January 12, 2017; accepted January 26, 2017. M. Berta acknowledges funding by the SNSF through a fellowship, funding by the Institute for Quantum Information and Matter (IQIM), an NSF Physics Frontiers Center (NFS Grant PHY-1125565) with support of the Gordon and Betty Moore Foundation (GBMF-12500028), and funding support form the ARO grant for Research on Quantum Algorithms at the IQIM (W911NF-12-1-0521). H. Gharibyan and M. Walter gratefully acknowledge support from FQXI and the Simons Foundation. M. Walter also gratefully acknowledges support from AFOSR grant FA9550-16-1-0082.

Attached Files

Submitted - 1603.02282v1.pdf

Files

1603.02282v1.pdf

Files (745.9 kB)

Name	Size	Download all
1603.02282v1.pdf md5:6553dfb5df41cf7ac2626fb4ebcb2d04	745.9 kB	Preview Download

Additional details

	All versions	This version
Views	0	0
Downloads	0	0
Data volume	0 Bytes	0 Bytes