4 citations · 8 across the 11 of their papers we have counts for
14 papers
Second-Order Expansion of Privacy Amplification Under f-Divergence Criteria
Mario Berta, Hao-Chung Cheng, Marco Tomamichel
We derive the second-order asymptotics of randomness extraction from memoryless sources with side information under security criteria based on a broad class of Csiszàr f-divergence…
Strong Converse Exponent of Quantum State Merging
Mario Berta, Hao-Chung Cheng, Roberto Rubboli +1
We determine the strong converse exponent for the entanglement cost of quantum state merging, showing that it is characterized by the optimized - conditional Rényi entropies…
Superadditivity for Entanglement-Assisted Communication
Hao-Chung Cheng, Mario Berta
The entanglement-assisted capacity of a quantum channel admits an additive single-letter characterization, implying that joint encodings across channel uses cannot increase the ult…
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…
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…
Strong converse Exponents of Partially Smoothed Information Measures
Mario Berta, Yongsheng Yao
Partially smoothed information measures are fundamental tools in one-shot quantum information theory. In this work, we determine the exact strong converse exponents of these measur…
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…
Exponents for classical-quantum channel simulation in purified distance
Aadil Oufkir, Yongsheng Yao, Mario Berta
We determine the exact error and strong converse exponent for entanglement-assisted classical-quantum channel simulation in worst case input purified distance. The error exponent i…
Optimality of meta-converse for channel simulation
Aadil Oufkir, Omar Fawzi, Mario Berta
We study the effect of shared non-signaling correlations for the problem of simulating a channel using noiseless communication in the one-shot setting. For classical channels, we s…
Exponents for Shared Randomness-Assisted Channel Simulation
Aadil Oufkir, Michael X. Cao, Hao-Chung Cheng +1
We determine the exact error and strong converse exponents of shared randomness-assisted channel simulation in worst case total-variation distance. Namely, we find that these expon…
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 Quantum Dichotomies
Mario Berta, Yongsheng Yao
The quantum dichotomies problem asks at what rate one pair of quantum states can be approximately mapped into another pair of quantum states. In the many copy limit and for vanishi…
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…
Limit Distribution Theory for Quantum Divergences
Sreejith Sreekumar, Mario Berta
Estimation of quantum relative entropy and its Rényi generalizations is a fundamental statistical task in quantum information theory, physics, and beyond. While several estimators…