From the 1 of 8 linked papers with an AI index.
8 papers
Superadditivity for Entanglement-Assisted Communication
Hao-Chung Cheng, Mario Berta
The paper demonstrates that, although the entanglement‑assisted capacity of a quantum channel is additive, the reliability (error exponent) can be strictly superadditive, meaning j…
Distributed Quantum Hypothesis Testing under Zero-rate Communication Constraints
Sreejith Sreekumar, Christoph Hirche, Hao-Chung Cheng +1
The trade-offs between error probabilities in quantum hypothesis testing are by now well-understood in the centralized setting, but much less is known for distributed settings. Her…
Channel coding against quantum jammers via minimax
Michael X. Cao, Yongsheng Yao, Mario Berta
We introduce a minimax approach for characterizing the capacities of fully quantum arbitrarily varying channels (FQAVCs) under different shared resource models. In contrast to prev…
Tight any-shot quantum decoupling
Mario Berta, Hao-Chung Cheng, Yongsheng Yao
Quantum information decoupling is a fundamental primitive in quantum information theory, underlying various applications in quantum physics. We prove a novel one-shot decoupling th…
Quantum channel coding: Approximation algorithms and strong converse exponents
Aadil Oufkir, Mario Berta
We study relaxations of entanglement-assisted quantum channel coding and establish that non-signaling assistance and a natural semi-definite programming relaxation\, -- \,termed me…
Strong converse exponent of channel interconversion
Aadil Oufkir, Yongsheng Yao, Mario Berta
In their seminal work, Bennett et al. [IEEE Trans. Inf. Theory (2002)] showed that, with sufficient shared randomness, one noisy channel can simulate another at a rate equal to the…