Fetching the paper…
Reading the bibliography…
In the vein of the recent "pretty strong" converse for the quantum and private capacity of degradable quantum channels [Morgan/Winter, IEEE Trans.
C. E. Shannon. A Mathematical Theory of Communication. Bell Syst. Tech. J. , 27
1948
Earlier work this paper cites.
C. E. Shannon. Communication Theory of Secrecy Systems. Bell Syst. Tech. J. , 28
1949
Earlier work this paper cites.
A. D. Wyner. The Wire-Tap Channel. Bell Syst. Tech. J. , 54
1975
Earlier work this paper cites.
A. Uhlmann. The ‘Transition Probability’ in the State Space of a ∗ \ast -Algebra. Rep. Math. Phys. , 9
1976
Earlier work this paper cites.
I. Csiszár and J. Körner. Broadcast Channels with Confidential Messages. IEEE Trans. Inf. Theory , 24
1978
Earlier work this paper cites.
R. Ahlswede and I. Csiszár. Common randomness in information theory and cryptography — I. Secret sharing. IEEE Trans. Inf. Theory , 39
1993
Earlier work this paper cites.
U. M. Maurer. Secret key agreement by public discussion from common information. IEEE Trans. Inf. Theory , 39
1993
Earlier work this paper cites.
R. Jozsa. Fidelity for mixed quantum states. J. Mod. Opt. , 41
1994
Earlier work this paper cites.
C. A. Fuchs and J. van de Graaf. Cryptographic Distinguishability Measures for Quantum-Mechanical States. IEEE Trans. Inf. Theory , 45
1999
Earlier work this paper cites.
T. Ogawa and H. Nagaoka. Strong converse to the quantum channel coding theorem. IEEE Trans. Inf. Theory , 45
1999
Earlier work this paper cites.
A. Winter. Coding Theorems of Quantum Information Theory . PhD thesis, Department of Mathematics, Universität Bielefeld (1999). arXiv:quant-ph/9907077
1999
Earlier work this paper cites.
A. Winter. Coding theorem and strong converse for quantum channels. IEEE Trans. Inf. Theory , 45
1999
Earlier work this paper cites.
N. Cai, A. Winter and R. W. Yeung. Quantum Privacy and Quantum Wiretap Channels. Problems Inf. Transm. , 40
2004
Cited alongside, same era.
I. Devetak. The private classical capacity and quantum capacity of a quantum channel. IEEE Trans. Inf. Theory , 51
2005
Cited alongside, same era.
I. Devetak and P. W. Shor. The capacity of a quantum channel for simultaneous transmission of classical and quantum information. Commun. Math. Phys. , 256
2005
Cited alongside, same era.
R. Renner. Security of Quantum Key Distribution . PhD thesis, ETH Zürich (2005); arXiv:quant-ph/0512258
2005
Cited alongside, same era.
T. Cubitt, M.-B. Ruskai and G. Smith. The structure of degradable quantum channels. J. Math. Phys. , 49
2008
Cited alongside, same era.
A. Vitanov, F. Dupuis, M. Tomamichel and R. Renner. Chain Rules for Smooth Min- and Max-Entropies. arXiv[quant-ph]:1205.5231 (2012)
2012
Later among the works it cites.
L. Wang and R. Renner. One-Shot Classical-Quantum Capacity and Hypothesis Testing. Phys. Rev. Lett., 108
2012
Later among the works it cites.
F. Dupuis. private communication (January 2013)
2013
Later among the works it cites.
H. Tyagi and P. Narayan. How Many Queries Will Resolve Common Randomness? IEEE Trans. Inf. Theory , 59
2013
Later among the works it cites.
S. Watanabe and M. Hayashi. Non-Asymptotic Analysis of Privacy Amplification via Rényi Entropy and Inf-Spectral Entropy. Proc. ISIT 2013, pp. 2715–2719; arXiv[cs.IT]:1211.5252
2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
G. Smith and J. A. Smolin. Extensive Nonadditivity of Privacy. Phys. Rev. Lett. , 103
2008
Cited alongside, same era.
G. Smith, J. M. Renes and J. A. Smolin. Structured Codes Improve the Bennett-Brassard-84 Quantum Key Rate. Phys. Rev. Lett. , 100
2008
Cited alongside, same era.
2009
Cited alongside, same era.
K. Li, A. Winter, X.-B. Zou and G.-C. Guo. Private Capacity of Quantum Channels Is Not Additive. Phys. Rev. Lett. , 103
2009
Cited alongside, same era.
F. Dupuis, M. Berta, J. Wullschleger and R. Renner. The decoupling theorem. arXiv:1012.6044 (2010)
2010
Cited alongside, same era.
2011
Cited alongside, same era.
J. M. Renes and R. Renner. Noisy channel coding via privacy amplification and information reconciliation. IEEE Trans. Inf. Theory , 57
2011
Cited alongside, same era.
S. Guha, P. Hayden, H. Krovi, S. Lloyd, C. Lupo, J. H. Shapiro, M. Takeoka and M. M. Wilde, “Quantum Enigma Machines and the Locking Capacity of a Quantum Channel”, Phys. Rev. X 4
2014
Later among the works it cites.
M. Hayashi, H. Tyagi and S. Watanabe. Secret Key Agreement: General Capacity and Second-Order Asymptotics. arXiv[cs.IT]:1411.0735 (2014)
2014
Later among the works it cites.
M. Hayashi, H. Tyagi and S. Watanabe. Strong Converse for a Degraded Wiretap Channel via Active Hypothesis Testing. Proc. Allerton 2014; arXiv[quant-ph]:1410.0443
2014
Later among the works it cites.
C. Morgan and A. Winter. “Pretty Strong” Converse for the Quantum Capacity of Degradable Channels. IEEE Trans. Inf. Theory , 60
2014
Later among the works it cites.
D. Elkouss and S. Strelchuk. Superadditivity of private information for any number of uses of the channel. arXiv[quant-ph]:1502.05326 (2015)
2015
Later among the works it cites.
H. Tyagi and S. Watanabe. Converses for secret key agreement and secure computing. IEEE Trans. Inf. Theory, 61
2015
Later among the works it cites.
M. Tomamichel. Quantum Information Processing with Finite Resources: Mathematical Foundations . Springer Briefs in Mathematical Physics, vol. 5, Springer Verlag, Heidelberg New York, 2016
2016
Closest in time.