Upper bound on function computation in directed acyclic networks. - Cupjin Huang; Zihan Tan; Shenghao Yang 001 (ITW, 2015)

Comments on Cut-Set Bounds on Network Function Computation. - Cupjin Huang; Zihan Tan; Shenghao Yang 001; Xuan Guang (IEEE Trans. Inf. Theory, 2018)

Explicit lower bounds on strong simulation of quantum circuits in terms of $T$-gate count. - Cupjin Huang; Michael Newman; Mario Szegedy (CoRR, 2019)

Explicit Lower Bounds on Strong Quantum Simulation. - Cupjin Huang; Michael Newman; Mario Szegedy (IEEE Trans. Inf. Theory, 2020)

Efficient parallelization of tensor network contraction for simulating quantum computation. - Cupjin Huang; Fang Zhang; Michael Newman; Xiaotong Ni; Dawei Ding 002; Junjie Cai; Xun Gao; Tenghui Wang; Feng Wu; Gengyan Zhang; Hsiang-Sheng Ku; Zhengxiong Tian; et al. (Nat. Comput. Sci., 2021)

A Classical Architecture For Digital Quantum Computers. - Fang Zhang; Xing Zhu; Rui Chao; Cupjin Huang; Linghang Kong; Guoyang Chen; Dawei Ding 002; Haishan Feng; Yihuai Gao; Xiaotong Ni; Liwei Qiu; Zhe Wei; et al. (CoRR, 2023)

One Gate Scheme to Rule Them All: Introducing a Complex Yet Reduced Instruction Set for Quantum Computing. - Jianxin Chen; Dawei Ding 002; Weiyuan Gong; Cupjin Huang; Qi Ye (ASPLOS (2), 2024)

Leakage Benchmarking for Universal Gate Sets. - Bujiao Wu; Xiaoyang Wang; Xiao Yuan 002; Cupjin Huang; Jianxin Chen (Entropy, 2024)