Fetching the paper…
Reading the bibliography…
We study quantum soft covering and privacy amplification against quantum side information.
C. E. Shannon, “A mathematical theory of communication,”
1948
Earlier work this paper cites.
J. Wolfowitz, “The coding of messages subject to chance errors,”
1957
Earlier work this paper cites.
V. Strassen, “Asymptotische abschätzungen in Shannon’s informationstheorie,”
1962
Earlier work this paper cites.
H. Umegaki, “Conditional expectation in an operator algebra. IV. entropy and information,”
1962
Earlier work this paper cites.
C. W. Helstrom, “Detection theory and quantum mechanics,”
1967
Earlier work this paper cites.
A. Holevo, “The analogue of statistical decision theory in the noncommutative probability theory,”
1972
Earlier work this paper cites.
A. Holevo, “Bounds for the quantity of information transmitted by a quantum communication channel,”
1973
Earlier work this paper cites.
C. H. Bennett, G. Brassard, and J.-M. Robert, “Privacy amplification by public discussion,”
1988
Earlier work this paper cites.
B. Schumacher and M. D. Westmoreland, “Sending classical information via noisy quantum channels,”
1997
Earlier work this paper cites.
A. Holevo, “The capacity of the quantum channel with general signal states,”
1998
Earlier work this paper cites.
A. Dembo and O. Zeitouni,
1998
Earlier work this paper cites.
T. Ogawa and H. Nagaoka, “Strong converse to the quantum channel coding theorem,”
1999
Earlier work this paper cites.
A. Winter, “Coding theorems of quantum information theory,”
1999
Earlier work this paper cites.
——, “Coding theorem and strong converse for quantum channels,”
1999
Earlier work this paper cites.
R. Canetti, “Universally composable security: a new paradigm for cryptographic protocols,” in
2001
Earlier work this paper cites.
F. Hansen and G. K. Pedersen, “Jensen’s operator inequality,”
2003
Earlier work this paper cites.
R. Renner, “Security of quantum key distribution,”
2005
Earlier work this paper cites.
R. Renner and R. König, “Universally composable privacy amplification against quantum adversaries,” in
2005
Earlier work this paper cites.
H. Nagaoka and M. Hayashi, “An information-spectrum approach to classical and quantum hypothesis testing for simple hypotheses,”
2006
Earlier work this paper cites.
M. Hayashi, “Error exponent in asymmetric quantum hypothesis testing and its application to classical-quantum channel coding,”
2007
Earlier work this paper cites.
M. Hayashi, “Information spectrum approach to second-order coding rate in channel coding,”
2009
Cited alongside, same era.
M. A. Nielsen and I. L. Chuang,
2009
Cited alongside, same era.
R. König, R. Renner, and C. Schaffner, “The operational meaning of min- and max-entropy,”
2009
Cited alongside, same era.
Y. Polyanskiy, H. V. Poor, and S. Verdu, “Channel coding rate in the finite blocklength regime,”
2010
Cited alongside, same era.
D. Unruh, “Universally composable quantum multi-party computation,” in
2010
Cited alongside, same era.
M. Tomamichel, R. Colbeck, and R. Renner, “Duality between smooth min- and max-entropies,”
2010
Cited alongside, same era.
H.-C. Cheng and M.-H. Hsieh, “Concavity of the auxiliary function for classical-quantum channels,”
2016
Later among the works it cites.
M. Hayashi and S. Watanabe, “Uniform random number generation from Markov chains: Non-asymptotic and asymptotic analyses,”
2016
Later among the works it cites.
M. Hayashi,
2017
Later among the works it cites.
H.-C. Cheng and M.-H. Hsieh, “Moderate deviation analysis for classical-quantum channels and quantum hypothesis testing,”
2017
Later among the works it cites.
J. Watrous,
2018
Later among the works it cites.
H.-C. Cheng, “Error exponent analysis in quantum information theory,”
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. Tomamichel, C. Schaffner, A. Smith, and R. Renner, “Leftover hashing against quantum side information,”
2011
Cited alongside, same era.
M. Tomamichel and M. Hayashi, “A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks,”
2013
Cited alongside, same era.
M. Hayashi, “Tight exponential analysis of universally composable privacy amplification and its applications,”
2013
Cited alongside, same era.
N. Ciganovic, N. J. Beaudry, and R. Renner, “Smooth max-information as one-shot generalization for mutual information,”
2013
Cited alongside, same era.
R. L. Frank and E. H. Lieb, “Monotonicity of a relative Rényi entropy,”
2013
Cited alongside, same era.
S. Watanabe and M. Hayashi, “Non-asymptotic analysis of privacy amplification via Rényi entropy and inf-spectral entropy,” in
2013
Cited alongside, same era.
2018
Later among the works it cites.
H.-C. Cheng, M.-H. Hsieh, and M. Tomamichel, “Quantum sphere-packing bounds with polynomial prefactors,”
2019
Later among the works it cites.
A. Anshu, M. Berta, R. Jain, and M. Tomamichel, “Partially smoothed information measures,”
2020
Later among the works it cites.
S. Khatri and M. M. Wilde, “Principles of quantum communication theory: A modern approach,”
2020
Later among the works it cites.
H.-C. Cheng, E. P. Hanson, N. Datta, and M.-H. Hsieh, “Non-asymptotic classical data compression with quantum side information,”
2020
Later among the works it cites.
F. Dupuis, “Privacy amplification and decoupling without smoothing,”
2021
Later among the works it cites.
——, “Non-asymptotic classical data compression with quantum side information,”
2021
Later among the works it cites.
H.-C. Cheng, N. Dattaand, and C. Rouźe, “Strong converse bounds in quantum network information theory,”
2021
Later among the works it cites.
K. Li and Y. Yao, “Reliability function of quantum information decoupling,”
2021
Later among the works it cites.
2022
Closest in time.
H.-C. Cheng and L. Gao, “Error exponent and strong converse for quantum soft covering,”
2022
Closest in time.
T. Tsurumaru, “Equivalence of three classical algorithms with quantum side information: Privacy amplification, error correction, and data compression,”
2022
Closest in time.
H.-C. Cheng, L. Gao, and M.-H. Hsieh, “Properties of noncommutative rényi and Augustin information,”
2022
Closest in time.