3 citations · 4 across the 5 of their papers we have counts for
12 papers · 1 filter
A Mirror-Descent Algorithm for Computing the Petz-Rényi Capacity of Classical-Quantum Channels
Yu-Hong Lai, Hao-Chung Cheng
We study the computation of the -Rényi capacity of a classical-quantum (c-q) channel for . We propose an exponentiated-gradient (mirror descent) iteration that genera…
Adversarial Hypothesis Testing for Quantum Channels
Masahito Hayashi, Hao-Chung Cheng, Li Gao
This paper presents a systematic study of adversarial hypothesis testing for both quantum-quantum (QQ) and classical-quantum (CQ) channels. Unlike conventional channel discriminati…
The operator layer cake theorem is equivalent to Frenkel's integral formula
Hao-Chung Cheng, Gilad Gour, Ludovico Lami +1
The operator layer cake theorem provides an integral representation for the directional derivative of the operator logarithm in terms of a family of projections [arXiv:2507.06232].…
Sharp estimates of quantum covering problems via a novel trace inequality
Hao-Chung Cheng, Li Gao, Christoph Hirche +2
In this paper, we prove a novel trace inequality involving two operators. As applications, we sharpen the one-shot achievability bound on the relative entropy error in a wealth of…
Layer Cake Representations for Quantum Divergences
Po-Chieh Liu, Christoph Hirche, Hao-Chung Cheng
Defining suitable quantum extensions of classical divergences often poses a challenge due to the non-commutative nature of quantum information. In this work, we propose a new appro…
Error Exponents for Quantum Packing Problems via An Operator Layer Cake Theorem
Hao-Chung Cheng, Po-Chieh Liu
In this work, we prove a one-shot random coding bound for classical-quantum channel coding, a problem conjectured by Burnashev and Holevo in 1998. By choosing the optimal input dis…