46 citations · 306 across the 28 of their papers we have counts for
7 papers · 1 filter
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…