Cupjin Huang

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 8

Top Topics

Quantum Computation

Directed Acyclic

Error Probability

Top Venues

IEEE Trans. Inf. Theory

Nat. Comput. Sci.

Publications

Jianxin Chen, Dawei Ding, Weiyuan Gong, Cupjin Huang, Qi Ye
One Gate Scheme to Rule Them All: Introducing a Complex Yet Reduced Instruction Set for Quantum Computing. ASPLOS (2) (2024)
Bujiao Wu, Xiaoyang Wang, Xiao Yuan, Cupjin Huang, Jianxin Chen
Leakage Benchmarking for Universal Gate Sets. Entropy 26 (1) (2024)
Fang Zhang, Xing Zhu, Rui Chao, Cupjin Huang, Linghang Kong, Guoyang Chen, Dawei Ding, Haishan Feng, Yihuai Gao, Xiaotong Ni, Liwei Qiu, Zhe Wei, Yueming Yang, Yang Zhao, Yaoyun Shi, Weifeng Zhang, Peng Zhou, Jianxin Chen
A Classical Architecture For Digital Quantum Computers. CoRR (2023)
Cupjin Huang, Fang Zhang, Michael Newman, Xiaotong Ni, Dawei Ding, Junjie Cai, Xun Gao, Tenghui Wang, Feng Wu, Gengyan Zhang, Hsiang-Sheng Ku, Zhengxiong Tian, Junyin Wu, Haihong Xu, Huanjun Yu, Bo Yuan, Mario Szegedy, Yaoyun Shi, Hui-Hai Zhao, Chunqing Deng, Jianxin Chen
Efficient parallelization of tensor network contraction for simulating quantum computation. Nat. Comput. Sci. 1 (9) (2021)
Cupjin Huang, Michael Newman, Mario Szegedy
Explicit Lower Bounds on Strong Quantum Simulation. IEEE Trans. Inf. Theory 66 (9) (2020)
Cupjin Huang, Michael Newman, Mario Szegedy
Explicit lower bounds on strong simulation of quantum circuits in terms of $T$-gate count. CoRR (2019)
Cupjin Huang, Zihan Tan, Shenghao Yang, Xuan Guang
Comments on Cut-Set Bounds on Network Function Computation. IEEE Trans. Inf. Theory 64 (9) (2018)
Cupjin Huang, Michael Newman, Mario Szegedy
Explicit lower bounds on strong quantum simulation. CoRR (2018)
Cupjin Huang, Zihan Tan, Shenghao Yang
Upper Bound on Function Computation in Directed Acyclic Networks. CoRR (2015)
Cupjin Huang, Zihan Tan, Shenghao Yang
Upper bound on function computation in directed acyclic networks. ITW (2015)