Fetching the paper…
Reading the bibliography…
Dual to the usual noisy channel coding problem, where a noisy (classical or quantum) channel is used to simulate a noiseless one, reverse Shannon theorems concern the use of noiseless channels to simulate noisy ones, and more generally the use of one noisy channel to simulate another.
A mathematical theory of communication
C. E. Shannon · 1948
Earlier work this paper cites.
Probability inequalities for sums of bounded random variables
W. Hoeffding · 1963
Earlier work this paper cites.
Information and Information Stability of Random Variables and Processes
M. Pinsker · 1964
Earlier work this paper cites.
A continuity property of the entropy density for spin lattices
M. Fannes · 1973
Earlier work this paper cites.
The common information of two dependent random variables
A. Wyner · 1975
Earlier work this paper cites.
The ’transition probability’ in the state space of a ∗ * -algebra
A. Uhlmann · 1976
Earlier work this paper cites.
A single quantum cannot be cloned
W. Wootters and W. Zurek · 1982
Earlier work this paper cites.
Elements of Information Theory
T. M. Cover and J. A. Thomas · 1991
Earlier work this paper cites.
Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
C. H. Bennett and S. J. Wiesner · 1992
Earlier work this paper cites.
Common Randomness in Information Theory and Cryptography Part I: Secret Sharing
R. Ahlswede and I. Csiszár · 1993
Earlier work this paper cites.
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
C. H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, and W. K. Wootters · 1993
Earlier work this paper cites.
Approximation theory of output statistics
T. S. Han and S. Verdú · 1993
Earlier work this paper cites.
Concentrating partial entanglement by local operations
C. H. Bennett, H. J. Bernstein, S. Popescu, and B. Schumacher · 1996
Earlier work this paper cites.
Simulation of random processes and rate-distortion theory
Y. Steinberg and S. Verdú · 1996
Earlier work this paper cites.
von Neumann capacity of noisy quantum channels
C. Adami and N. J. Cerf · 1997
Earlier work this paper cites.
Common Randomness in Information Theory and Cryptography Part II: CR capacity
R. Ahlswede and I. Csiszár · 1998
Earlier work this paper cites.
Representations and Invariants of the Classical Groups
R. Goodman and N. Wallach · 1998
Earlier work this paper cites.
Entanglement-assisted classical capacity of noisy quantum channels
C. H. Bennett, P. W. Shor, J. A. Smolin, and A. Thapliyal · 1999
Earlier work this paper cites.
The classical communication cost of entanglement manipulation: Is entanglement an inter-convertible resource?
H.-K. Lo and S. Popescu · 1999
Earlier work this paper cites.
Conditions for a class of entanglement transformations
M. A. Nielsen · 1999
Earlier work this paper cites.
Strong converse to the quantum channel coding theorem
T. Ogawa and H. Nagaoka · 1999
Earlier work this paper cites.
Coding theorem and strong converse for quantum channels
A. Winter · 1999
Earlier work this paper cites.
Amount of information obtained by a quantum measurement
S. Massar and S. Popescu · 2000
Earlier work this paper cites.
Variable length universal entanglement concentration by local operations and its application to teleportation and dense coding, 2001, arXiv:quant-ph/0109028
M. Hayashi and K. Matsumoto · 2001
Earlier work this paper cites.
Strong converse for identification via quantum channels
R. Ahlswede and A. Winter · 2002
Earlier work this paper cites.
Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
C. H. Bennett, P. W. Shor, J. A. Smolin, and A. Thapliyal · 2002
Earlier work this paper cites.
Exponents of quantum fixed-length pure state source coding
M. Hayashi · 2002
Earlier work this paper cites.
Quantum universal variable-length source coding
M. Hayashi and K. Matsumoto · 2002
Earlier work this paper cites.
Simple construction of quantum universal variable-length source coding
M. Hayashi and K. Matsumoto · 2002
Earlier work this paper cites.
On entanglement assisted classical capacity
A. S. Holevo · 2002
Earlier work this paper cites.
Remarks on the classical capacity of quantum channel, 2002, arXiv:quant-ph/0212025
A. S. Holevo · 2002
Cited alongside, same era.
Classical and Quantum Computation
A. Y. Kitaev, A. H. Shen, and M. N. Vyalyi · 2002
Cited alongside, same era.
The entanglement of purification
B. M. Terhal, M. Horodecki, D. W. Leung, and D. P. DiVincenzo · 2002
Cited alongside, same era.
Counterexample to an additivity conjecture for output purity of quantum channels
R. F. Werner and A. S. Holevo · 2002
Cited alongside, same era.
Compression of sources of probability distributions and density operators, 2002, arXiv:quant-ph/0208131
A. Winter · 2002
Cited alongside, same era.
On the communication cost of entanglement transformations
P. Hayden and A. Winter · 2003
Cited alongside, same era.
Multiplicativity of completely bounded p-norms implies a new additivity result
I. Devetak, M. Junge, C. King, and M. B. Ruskai · 2006
Later among the works it cites.
Optimal visible compression rate for mixed states is determined by entanglement of purificatio
M. Hayashi · 2006
Later among the works it cites.
Quantum state estimation and large deviations
M. Keyl · 2006
Later among the works it cites.
The information-disturbance tradeoff and the continuity of Stinespring’s representation
D. Kretschmann, D. Schlingemann, and R. F. Werner · 2006
Later among the works it cites.
Identification via quantum channels in the presence of prior correlation and feedback
A. Winter · 2006
Later among the works it cites.
A sharp continuity estimate for the von Neumann entropy
K. M. R. Audenaert · 2007
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Universal quantum information compression and degrees of prior knowledge
R. Jozsa and S. Presnell · 2003
Cited alongside, same era.
Compression of quantum measurement operations
S. Massar and A. Winter · 2003
Cited alongside, same era.
Completely Bounded Maps and Operator Algebras
V. Paulsen · 2003
Cited alongside, same era.
Universal entanglement transformations without communication
W. van Dam and P. Hayden · 2003
Cited alongside, same era.
Continuity of quantum conditional information
R. Alicki and M. Fannes · 2004
Cited alongside, same era.
Quantum feedback channels
G. Bowen · 2004
Cited alongside, same era.
Later among the works it cites.
Universal distortion-free entanglement concentration
M. Hayashi and K. Matsumoto · 2007
Later among the works it cites.
Complementary channels and the additivity problem
A. S. Holevo · 2007
Later among the works it cites.
Communication requirements for generating correlated random variables
P. Cuff · 2008
Later among the works it cites.
A resource framework for quantum Shannon theory
I. Devetak, A. Harrow, and A. Winter · 2008
Later among the works it cites.
Exact cost of redistributing multipartite quantum states
I. Devetak and J. Yard · 2008
Later among the works it cites.
The mother of all protocols: Restructuring quantum information’s family tree
A. Abeyesinghe, I. Devetak, P. Hayden, and A. Winter · 2009
Closest in time.
Post-selection technique for quantum channels with applications to quantum cryptography
M. Christandl, R. Koenig, and R. Renner · 2009
Closest in time.
Entanglement spread and clean resource inequalities
A. W. Harrow · 2009
Closest in time.
A strong converse for classical channel coding using entangled inputs
R. Koenig and S. Wehner · 2009
Closest in time.
Extensive nonadditivity of privacy
G. Smith and J. A. Smolin · 2009
Closest in time.
Optimal quantum source coding with quantum information at the encoder and decoder
J. Yard and I. Devetak · 2009
Closest in time.
P. W. Cuff, H. H. Permuter, and T. M. Cover · 2010
Closest in time.
Universal approximation of multi-copy states and universal quantum lossless data compression
M. Hayashi · 2010
Closest in time.
User-friendly tail bounds for sums of random matrices, 2010, arXiv:1004.4389
J. A. Tropp · 2010
Closest in time.
A conceptually simple proof of the quantum reverse Shannon theorem
M. Berta, M. Christandl, and R. Renner · 2011
Closest in time.
Zero-error channel capacity and simulation assisted by non-local correlations
T. S. Cubitt, D. Leung, W. Matthews, and A. Winter · 2011
Closest in time.
Non-additivity of the entanglement of purification (beyond reasonable doubt), 2012, arXiv:1206.1307
J. Chen and A. Winter · 2012
Closest in time.
The information-theoretic costs of simulating quantum measurements
M. M. Wilde, P. Hayden, F. Buscemi, and M.-H. Hsieh · 2012
Closest in time.
Identifying the information gain of a quantum measurement, 2013, arXiv:1301.1594
M. Berta, J. M. Renes, and M. M. Wilde · 2013
Closest in time.
Quantum rate distortion, reverse shannon theorems, and source-channel separation
N. Datta, M.-H. Hsieh, and M. Wilde · 2013
Closest in time.
M. K. Gupta and M. M. Wilde · 2013
Closest in time.
The squashed entanglement of a quantum channel, 2013, arXiv:1310.0129
M. Takeoka, S. Guha, and M. M. Wilde · 2013
Closest in time.
Quantum rate-distortion coding with auxiliary resources
M. Wilde, N. Datta, M.-H. Hsieh, and A. Winter · 2013
Closest in time.
Strong converse for the classical capacity of entanglement-breaking and hadamard channels
M. M. Wilde, A. Winter, and D. Yang · 2013
Closest in time.