46 citations · 306 across the 28 of their papers we have counts for
28 papers
Optimal Second-Order Rates for Quantum Information Decoupling
Yu-Chen Shen, Li Gao, Hao-Chung Cheng
In this paper, we consider the standard quantum information decoupling, in which Alice aims to decouple her system from the environment by local operations and discarding some of h…
Quantum Broadcast Channel Simulation via Multipartite Convex Splitting
Hao-Chung Cheng, Li Gao, Mario Berta
We show that the communication cost of quantum broadcast channel simulation under free entanglement assistance between the sender and the receivers is asymptotically characterized…
Tight One-Shot Analysis for Convex Splitting with Applications in Quantum Information Theory
Hao-Chung Cheng, Li Gao
Convex splitting is a powerful technique in quantum information theory used in proving the achievability of numerous information-processing protocols such as quantum state redistri…
Faster Stochastic First-Order Method for Maximum-Likelihood Quantum State Tomography
Chung-En Tsai, Hao-Chung Cheng, Yen-Huan Li
In maximum-likelihood quantum state tomography, both the sample size and dimension grow exponentially with the number of qubits. It is therefore desirable to develop a stochastic f…
Robust Qubit Mapping Algorithm via Double-Source Optimal Routing on Large Quantum Circuits
Chin-Yi Cheng, Chien-Yi Yang, Yi-Hsiang Kuo +3
Qubit Mapping is a critical aspect of implementing quantum circuits on real hardware devices. Currently, the existing algorithms for qubit mapping encounter difficulties when deali…
Online Self-Concordant and Relatively Smooth Minimization, With Applications to Online Portfolio Selection and Learning Quantum States
Chung-En Tsai, Hao-Chung Cheng, Yen-Huan Li
Consider an online convex optimization problem where the loss functions are self-concordant barriers, smooth relative to a convex function , and possibly non-Lipschitz. We analy…
Simple and Tighter Derivation of Achievability for Classical Communication over Quantum Channels
Hao-Chung Cheng
Achievability in information theory refers to demonstrating a coding strategy that accomplishes a prescribed performance benchmark for the underlying task. In quantum information t…
Optimal Second-Order Rates for Quantum Soft Covering and Privacy Amplification
Yu-Chen Shen, Li Gao, Hao-Chung Cheng
We study quantum soft covering and privacy amplification against quantum side information. The former task aims to approximate a quantum state by sampling from a prior distribution…
Error Exponent and Strong Converse for Quantum Soft Covering
Hao-Chung Cheng, Li Gao
How well can we approximate a quantum channel output state using a random codebook with a certain size? In this work, we study the quantum soft covering problem. Namely, we use a r…
Strong Converse for Privacy Amplification against Quantum Side Information
Yu-Chen Shen, Li Gao, Hao-Chung Cheng
We establish a one-shot strong converse bound for privacy amplification against quantum side information using trace distance as a security criterion. This strong converse bound im…
Maximum-Likelihood Quantum State Tomography by Cover's Method with Non-Asymptotic Analysis
Chien-Ming Lin, Hao-Chung Cheng, Yen-Huan Li
We propose an iterative algorithm that computes the maximum-likelihood estimate in quantum state tomography. The optimization error of the algorithm converges to zero at an $O ( (…
Qubit-efficient encoding scheme for quantum simulations of electronic structure
Yu Shee, Pei-Kai Tsai, Cheng-Lin Hong +2
Simulating electronic structure on a quantum computer requires encoding of fermionic systems onto qubits. Common encoding methods transform a fermionic system of spin-orbitals…
Minimizing Quantum Renyi Divergences via Mirror Descent with Polyak Step Size
Jun-Kai You, Hao-Chung Cheng, Yen-Huan Li
Quantum information quantities play a substantial role in characterizing operational quantities in various quantum information-theoretic problems. We consider numerical computation…
On the Existence of the Augustin Mean
Hao-Chung Cheng, Baris Nakiboglu
The existence of a unique Augustin mean and its invariance under the Augustin operator are established for arbitrary input distributions with finite Augustin information for channe…
Learning quantum circuits of some gates
Ching-Yi Lai, Hao-Chung Cheng
In this paper, we study the problem of learning an unknown quantum circuit of a certain structure. If the unknown target is an -qubit Clifford circuit, we devise an efficient al…
Discrimination of quantum states under locality constraints in the many-copy setting
Hao-Chung Cheng, Andreas Winter, Nengkun Yu
We study quantum hypothesis testing between orthogonal states under restricted local measurements in the many-copy scenario. For testing arbitrary multipartite entangled pure state…
Refined Strong Converse for the Constant Composition Codes
Hao-Chung Cheng, Baris Nakiboglu
A strong converse bound for constant composition codes of the form is established using the Berry-Esseen the…
Strong Converse for Classical-Quantum Degraded Broadcast Channels
Hao-Chung Cheng, Nilanjana Datta, Cambyse Rouzé
We consider the transmission of classical information through a degraded broadcast channel, whose outputs are two quantum systems, with the state of one being a degraded version of…
Strong converse bounds in quantum network information theory: distributed hypothesis testing and source coding
Hao-Chung Cheng, Nilanjana Datta, Cambyse Rouzé
We consider a distributed quantum hypothesis testing problem with communication constraints, in which the two hypotheses correspond to two different states of a bipartite quantum s…
Properties of Noncommutative Renyi and Augustin Information
Hao-Chung Cheng, Li Gao, Min-Hsiu Hsieh
Rényi and Augustin information are generalizations of mutual information defined via the Rényi divergence, playing a significant role in evaluating the performance of information p…
Duality between source coding with quantum side information and c-q channel coding
Hao-Chung Cheng, Eric P. Hanson, Nilanjana Datta +1
In this paper, we establish an interesting duality between two different quantum information-processing tasks, namely, classical source coding with quantum side information, and ch…
Non-Asymptotic Classical Data Compression with Quantum Side Information
Hao-Chung Cheng, Eric P. Hanson, Nilanjana Datta +1
In this paper, we analyze classical data compression with quantum side information (also known as the classical-quantum Slepian-Wolf protocol) in the so-called large and moderate d…
Quantum Sphere-Packing Bounds with Polynomial Prefactors
Hao-Chung Cheng, Min-Hsiu Hsieh, Marco Tomamichel
We study lower bounds on the optimal error probability in classical coding over classical-quantum channels at rates below the capacity, commonly termed quantum sphere-packing bound…
Sphere-Packing Bound for Symmetric Classical-Quantum Channels
Hao-Chung Cheng, Min-Hsiu Hsieh, Marco Tomamichel
We provide a sphere-packing lower bound for the optimal error probability in finite blocklengths when coding over a symmetric classical-quantum channel. Our result shows that the p…