default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCupjin Huang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Bujiao Wu
, Xiaoyang Wang, Xiao Yuan, Cupjin Huang, Jianxin Chen:
Leakage Benchmarking for Universal Gate Sets. Entropy 26(1): 71 (2024)- [c2]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: 779-796 - 2023
- [i4]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 abs/2305.14304 (2023) - 2021
- [j3]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): 578-587 (2021) - 2020
- [j2]Cupjin Huang, Michael Newman, Mario Szegedy:
Explicit Lower Bounds on Strong Quantum Simulation. IEEE Trans. Inf. Theory 66(9): 5585-5600 (2020)
2010 – 2019
- 2019
- [i3]Cupjin Huang, Michael Newman, Mario Szegedy:
Explicit lower bounds on strong simulation of quantum circuits in terms of $T$-gate count. CoRR abs/1902.04764 (2019) - 2018
- [j1]Cupjin Huang, Zihan Tan, Shenghao Yang, Xuan Guang:
Comments on Cut-Set Bounds on Network Function Computation. IEEE Trans. Inf. Theory 64(9): 6454-6459 (2018) - [i2]Cupjin Huang, Michael Newman, Mario Szegedy:
Explicit lower bounds on strong quantum simulation. CoRR abs/1804.10368 (2018) - 2015
- [c1]Cupjin Huang, Zihan Tan, Shenghao Yang:
Upper bound on function computation in directed acyclic networks. ITW 2015: 1-5 - [i1]Cupjin Huang, Zihan Tan, Shenghao Yang:
Upper Bound on Function Computation in Directed Acyclic Networks. CoRR abs/1501.01084 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-19 00:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
