2 papers
cs.IT2026
On the Strong Converse Exponent and Error Exponent of the Classical Soft Covering
Xingyi He, S. Sandeep Pradhan, Andreas Winter
This paper establishes the exact strong converse exponent of the soft covering problem in the classical setting. This exponent characterizes the slowest achievable convergence spee…
cs.IT2026
Quantum Soft Covering with Relative Entropy Criterion
Xingyi He, S. Sandeep Pradhan
In this work, we propose a soft covering problem for fully quantum channels using relative entropy as a criterion for operator closeness. We establish covering lemmas by deriving o…