Entanglement assisted zero error coding
|Affiliation:||University of Waterloo|
Mathematics & Computer Building (MC) 5158
The rate at which classical information can be sent over a noisy channel with zero probability of a decoding error depends only on the properties of the channel's confusability graph, in particular the Shannon capacity of that graph. It was shown recently that a sender and receiver who share an entangled quantum system can sometimes use this to increase the rate of zero error communication beyond the Shannon capacity of the confusability graph. The entanglement assisted rate is also a property of the graph. In this talk I will introduce this quantity and discuss how we used results from graph theory to prove the existence of a separation between the assisted and unassisted rates.
200 University Avenue West
Waterloo, ON N2L 3G1