Please use this identifier to cite or link to this item:
|Title:||A resource framework for quantum Shannon theory|
|Keywords:||Asymptotic resource inequalities|
Family of quantum protocols
|Citation:||Devetak, I., Harrow, A.W., Winter, A.J. (2008). A resource framework for quantum Shannon theory. IEEE Transactions on Information Theory 54 (10) : 4587-4618. ScholarBank@NUS Repository. https://doi.org/10.1109/TIT.2008.928980|
|Abstract:||Quantum Shannon theory is loosely defined as a collection of coding theorems, such as classical and quantum source compression, noisy channel coding theorems, entanglement distillation, etc., which characterize asymptotic properties of quantum and classical channels and states. In this paper, we advocate a unified approach to an important class of problems in quantum Shannon theory, consisting of those that are bipartite, unidirectional, and memoryless. We formalize two principles that have long been tacitly understood. First, we describe how the Church of the larger Hilbert space allows us to move flexibly between states, channels, ensembles, and their purifications. Second, we introduce finite and asymptotic (quantum) information processing resources as the basic objects of quantum Shannon theory and recast the protocols used in direct coding theorems as inequalities between resources. We develop the rules of a resource calculus which allows us to manipulate and combine resource inequalities. This framework simplifies many coding theorem proofs and provides structural insights into the logical dependencies among coding theorems. We review the above-mentioned basic coding results and show how a subset of them can be unified into a family of related resource inequalities. Finally, we use this family to find optimal tradeoff curves for all protocols involving one noisy quantum resource and two noiseless ones. © 2008 IEEE.|
|Source Title:||IEEE Transactions on Information Theory|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 10, 2018
WEB OF SCIENCETM
checked on Jun 27, 2018
checked on Jun 29, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.