Quantum achievability proof via collision relative entropy

Beigi, S

629 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/TIT.2014.2361632
  3. Abstract:
  4. In this paper, we provide a simple framework for deriving one-shot achievable bounds for some problems in quantum information theory. Our framework is based on the joint convexity of the exponential of the collision relative entropy and is a (partial) quantum generalization of the technique of Yassaee et al. from classical information theory. Based on this framework, we derive one-shot achievable bounds for the problems of communication over classical-quantum channels, quantum hypothesis testing, and classical data compression with quantum side information. We argue that our one-shot achievable bounds are strong enough to give the asymptotic achievable rates of these problems even up to the second order
  5. Keywords:
  6. achievability proof ; Classical-quantum channel coding ; collision relative entropy ; information spectrum method ; second order asymptotics ; Communication channels (information theory) ; Entropy ; Quantum communication ; Quantum entanglement ; Quantum optics ; Achievability ; Asymptotics ; Classical-quantum channels ; Information spectrum ; Relative entropy ; Data compression
  7. Source: IEEE Transactions on Information Theory ; Vol. 60, issue. 12 , 2014 , pp. 7980-7986 ; ISSN: 00189448
  8. URL: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6917029&queryText=10.1109%2FTIT.2014.2361632&newsearch=true&searchField=Search_All