Cupjin Huang

According to our database, Cupjin Huang authored at least 8 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Leakage Benchmarking for Universal Gate Sets.

Bujiao Wu, Xiaoyang Wang, Xiao Yuan, Cupjin Huang, Jianxin Chen

Entropy, January, 2024

One Gate Scheme to Rule Them All: Introducing a Complex Yet Reduced Instruction Set for Quantum Computing.

Jianxin Chen, Dawei Ding, Weiyuan Gong, Cupjin Huang, Qi Ye

Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, 2024

2023

A Classical Architecture For Digital Quantum Computers.

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

CoRR, 2023

2021

Efficient parallelization of tensor network contraction for simulating quantum computation.

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

Nat. Comput. Sci., 2021

2020

Explicit Lower Bounds on Strong Quantum Simulation.

Cupjin Huang, Michael Newman, Mario Szegedy

IEEE Trans. Inf. Theory, 2020

2019

Explicit lower bounds on strong simulation of quantum circuits in terms of $T$-gate count.

Cupjin Huang, Michael Newman, Mario Szegedy

CoRR, 2019

2018

Comments on Cut-Set Bounds on Network Function Computation.

Cupjin Huang, Zihan Tan, Shenghao Yang, Xuan Guang

IEEE Trans. Inf. Theory, 2018

2015

Upper bound on function computation in directed acyclic networks.

Cupjin Huang, Zihan Tan, Shenghao Yang

Proceedings of the 2015 IEEE Information Theory Workshop, 2015