Fetching the paper…
Reading the bibliography…
The fully quantum reverse Shannon theorem establishes the optimal rate of noiseless classical communication required for simulating the action of many instances of a noisy quantum channel on an arbitrary input state, while also allowing for an arbitrary amount of shared entanglement of an arbitrary form.
A mathematical theory of communication
Claude E. Shannon · 1948
Earlier work this paper cites.
On general minimax theorems
Maurice Sion · 1958
Earlier work this paper cites.
On the converse to the coding theorem for discrete memoryless channels
Suguru Arimoto · 1973
Earlier work this paper cites.
Convex trace functions and the Wigner-Yanase-Dyson conjecture
Elliot H. Lieb · 1973
Earlier work this paper cites.
Studies in mathematical physics
Elliott H. Lieb and Walter Thirring · 1976
Earlier work this paper cites.
Quantum computations: algorithms and error correction
Alexei Kitaev · 1997
Earlier work this paper cites.
Quantum circuits with mixed states
Dorit Aharonov, Alexei Kitaev, and Noam Nisan · 1998
Earlier work this paper cites.
Entanglement-assisted classical capacity of noisy quantum channels
Charles H. Bennett, Peter W. Shor, John A. Smolin, and Ashish V. Thapliyal · 1999
Earlier work this paper cites.
Strong converse to the quantum channel coding theorem
Tomohiro Ogawa and Hiroshi Nagaoka · 1999
Earlier work this paper cites.
Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
Charles H. Bennett, Peter W. Shor, John A. Smolin, and Ashish V. Thapliyal · 2002
Earlier work this paper cites.
On entanglement assisted classical capacity
Alexander S. Holevo · 2002
Earlier work this paper cites.
Quantum feedback channels
Garry Bowen · 2004
Earlier work this paper cites.
Distance measures to compare real and ideal quantum processes
Alexei Gilchrist, Nathan K. Langford, and Michael A. Nielsen · 2005
Earlier work this paper cites.
On the hardness of distinguishing mixed-state quantum computations
Bill Rosgen and John Watrous · 2005
Earlier work this paper cites.
Entanglement can enhance the distinguishability of entanglement-breaking channels
Massimiliano F. Sacchi · 2005
Earlier work this paper cites.
Correcting quantum errors with entanglement
Todd A. Brun, Igor Devetak, and Min-Hsiu Hsieh · 2006
Earlier work this paper cites.
Multiplicativity of completely bounded p p -norms implies a new additivity result
Igor Devetak, Marius Junge, Christopher King, and Mary Beth Ruskai · 2006
Earlier work this paper cites.
A relation between completely bounded norms and conjugate channels
Anna Jencova · 2006
Cited alongside, same era.
The converse part of the theorem for quantum Hoeffding bound
Hiroshi Nagaoka · 2006
Cited alongside, same era.
Discriminating states: The quantum Chernoff bound
K. M. R. Audenaert, J. Calsamiglia, R. Muñoz Tapia, E. Bagan, Ll. Masanes, A. Acin, and F. Verstraete · 2007
Cited alongside, same era.
Error exponent in asymmetric quantum hypothesis testing and its application to classical-quantum channel coding
Masahito Hayashi · 2007
Cited alongside, same era.
Asymptotic error rates in quantum hypothesis testing
K. M. R. Audenaert, Michael Nussbaum, A. Szkoła, and Frank Verstraete · 2008
Cited alongside, same era.
A Minkowski type trace inequality and strong subadditivity of the quantum entropy II
From Classical to Quantum Shannon Theory
Mark M. Wilde · 2011
Later among the works it cites.
Unconditional security from noisy quantum storage
Robert Koenig, Stephanie Wehner, and Jürg Wullschleger · 2012
Later among the works it cites.
Finite blocklength converse bounds for quantum channels
William Matthews and Stephanie Wehner · 2012
Later among the works it cites.
On the strong converses for the quantum channel capacity theorems
Naresh Sharma and Naqueeb Ahmad Warsi · 2012
Later among the works it cites.
Sandwiched Rényi divergence satisfies data processing inequality
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Eric A. Carlen and Elliott H. Lieb · 2008
Cited alongside, same era.
Raúl García-Patrón, Stefano Pirandola, Seth Lloyd, and Jeffrey H. Shapiro · 2009
Cited alongside, same era.
Entanglement-assisted quantum quasicyclic low-density parity-check codes
Min-Hsiu Hsieh, Todd A. Brun, and Igor Devetak · 2009
Cited alongside, same era.
A strong converse for classical channel coding using entangled inputs
Robert Koenig and Stephanie Wehner · 2009
Cited alongside, same era.
The Chernoff lower bound for symmetric quantum hypothesis testing
Michael Nussbaum and Arleta Szkoła · 2009
Cited alongside, same era.
Trace inequalities and quantum entropy: An introductory course
Eric A. Carlen · 2010
Cited alongside, same era.
Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, and John Watrous · 2010
Cited alongside, same era.
Salman Beigi · 2013
Closest in time.
Quantum rate distortion, reverse Shannon theorems, and source-channel separation
Nilanjana Datta, Min-Hsiu Hsieh, and Mark M. Wilde · 2013
Closest in time.
Monotonicity of a relative Rényi entropy
Rupert L. Frank and Elliott H. Lieb · 2013
Closest in time.
Milán Mosonyi and Tomohiro Ogawa · 2013
Closest in time.
On quantum Rényi entropies: A new generalization and some properties
Martin Müller-Lennert, Frédéric Dupuis, Oleg Szehr, Serge Fehr, and Marco Tomamichel · 2013
Closest in time.
Simpler semidefinite programs for completely bounded norms
John Watrous · 2013
Closest in time.
Entanglement-assisted quantum turbo codes
Mark M. Wilde, Min-Hsiu Hsieh, and Zunaira Babar · 2013
Closest in time.
Quantum reverse Shannon theorem
Charles H. Bennett, Igor Devetak, Aram W. Harrow, Peter W. Shor, and Andreas Winter · 2014
Closest in time.
Catalytic quantum error correction
Todd A. Brun, Igor Devetak, and Min-Hsiu Hsieh · 2014
Closest in time.
A limit of the quantum Rényi divergence
Nilanjana Datta and Felix Leditzky · 2014
Closest in time.
“Pretty strong” converse for the quantum capacity of degradable channels
Ciara Morgan and Andreas Winter · 2014
Closest in time.
Mark M. Wilde, Andreas Winter, and Dong Yang · 2014
Closest in time.