3 citations · 6 across the 11 of their papers we have counts for
14 papers
On the geometry of the second Lagrange spectra
Hao Cheng, Harold Erazo, Carlos Gustavo Moreira +1
The Lagrange spectrum is the set of finite values of the best approximation constants , where $α\in \mathbb{R}\setminus \mathbb{…
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…
On Araki-Type Trace Inequalities
Po-Chieh Liu, Hao-Chung Cheng
In this paper, we prove a trace inequality for any positive and monotone increasing function , $s\in[0,…
Resolvability of classical-quantum channels
Masahito Hayashi, Hao-Chung Cheng, Li Gao
Channel resolvability concerns the minimum resolution for approximating the channel output. We study the resolvability of classical-quantum channels in two settings, for the channe…
Global Coherence in Quantum Discord as a Resource
Chellasamy Jebarathinam, Huan-Yu Ku, Hao-Chung Cheng +1
This work addresses which aspect of \textit{bipartite coherence} in \textit{quantum discord} is essential for \textit{genuinely quantum correlation}. To this end, \textit{global co…
Joint State-Channel Decoupling and One-Shot Quantum Coding Theorem
Hao-Chung Cheng, Frédéric Dupuis, Li Gao
In this work, we consider decoupling a bipartite quantum state via a general quantum channel. We propose a joint state-channel decoupling approach to obtain a one-shot error expone…
Collectively induced transparency and absorption in waveguide QED with Bragg atom arrays
Haolei Cheng, Wei Nie
Collective quantum states, such as subradiant and superradiant states, are useful for controlling optical responses in many-body quantum systems. In this work, we study novel colle…
On Strong Converse Theorems for Quantum Hypothesis Testing and Channel Coding
Hao-Chung Cheng, Li Gao
Strong converse theorems refer to the study of impossibility results in information theory. In particular, Mosonyi and Ogawa established a one-shot strong converse bound for quantu…
Privacy Amplification Against Quantum Side Information Via Regular Random Binning
Yu-Chen Shen, Li Gao, Hao-Chung Cheng
We consider privacy amplification against quantum side information by using regular random binning as an effective extractor. For constant-type sources, we obtain error exponent an…