default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShengyu Zhang 0002
Person information
- affiliation: Chinese University of Hong Kong, Shatin, Hong Kong
Other persons with the same name
- Shengyu Zhang (aka: Sheng-Yu Zhang) — disambiguation page
- Shengyu Zhang 0001
![[0000-0002-0030-8289]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-0030-8289")
— Zhejiang University, Department of Computer Science, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j19]Pei Yuan, Jonathan Allcock, Shengyu Zhang:
Does Qubit Connectivity Impact Quantum Circuit Complexity? IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 43(2): 520-533 (2024)- [j18]Yanghepu Li, Shengming Ma, Jonathan Allcock, Tianyu Zhang, Xiong Xu, Sainan Huai, Shengyu Zhang:
A Parametric EDA Method for Coplanar Waveguide Channel Recognition and Air-Bridge Construction in Quantum Chip Design. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 43(10): 3004-3014 (2024) - [j17]Xinzhao Wang, Shengyu Zhang, Tongyang Li:
A Quantum Algorithm Framework for Discrete Probability Distributions With Applications to Rényi Entropy Estimation. IEEE Trans. Inf. Theory 70(5): 3399-3426 (2024) - [c40]Xiangyu Ren, Tianyu Zhang, Xiong Xu, Yicong Zheng, Shengyu Zhang:
Invited: Leveraging Machine Learning for Quantum Compilation Optimization. DAC 2024: 360:1-360:4 - [c39]Maoli Liu, Zhuohua Li, Kechao Cai, Jonathan Allcock, Shengyu Zhang, John C. S. Lui:
Quantum BGP with Online Path Selection via Network Benchmarking. INFOCOM 2024: 1401-1410 - 2023
- [j16]Shi-Xin Zhang, Jonathan Allcock, Zhou-Quan Wan, Shuo Liu, Jiace Sun, Hao Yu, Xing-Han Yang, Jiezhong Qiu, Zhaofeng Ye, Yu-Qin Chen, Chee-Kong Lee, Yicong Zheng, Shao-Kai Jian, Hong Yao, Chang-Yu Hsieh, Shengyu Zhang:
TensorCircuit: a Quantum Software Framework for the NISQ Era. Quantum 7: 912 (2023) - [i39]Jonathan P. Mailoa, Zhaofeng Ye, Jiezhong Qiu, Chang-Yu Hsieh, Shengyu Zhang:
Protein-Ligand Complex Generator & Drug Screening via Tiered Tensor Transform. CoRR abs/2301.00984 (2023) - [i38]Jonathan P. Mailoa, Xin Li, Jiezhong Qiu, Shengyu Zhang:
Multi-Constraint Molecular Generation using Sparsely Labelled Training Data for Localized High-Concentration Electrolyte Diluent Screening. CoRR abs/2301.04814 (2023) - [i37]Lixue Cheng, Yu-Qin Chen, Shi-Xin Zhang, Shengyu Zhang:
Error-mitigated Quantum Approximate Optimization via Learning-based Adaptive Optimization. CoRR abs/2303.14877 (2023) - [i36]Mengyu Zhang, Xiangyu Ren, Guanglei Xi, Zhenxing Zhang, Qiaonian Yu, Fuming Liu, Hualiang Zhang, Shengyu Zhang, Yicong Zheng:
A Scalable, Fast and Programmable Neural Decoder for Fault-Tolerant Quantum Computation Using Surface Codes. CoRR abs/2305.15767 (2023) - 2022
- [j15]Yu-Qin Chen, Yu Chen, Chee-Kong Lee, Shengyu Zhang, Chang-Yu Hsieh:
Optimizing quantum annealing schedules with Monte Carlo tree search enhanced with neural networks. Nat. Mach. Intell. 4(3): 269-278 (2022) - [j14]Yuquan Li, Chang-Yu Hsieh, Ruiqiang Lu, Xiaoqing Gong, Xiaorui Wang, Pengyong Li, Shuo Liu, Yanan Tian, Dejun Jiang, Jiaxian Yan, Qifeng Bai, Huanxiang Liu, Shengyu Zhang, Xiaojun Yao:
An adaptive graph learning method for automated molecular interactions and properties predictions. Nat. Mach. Intell. 4(7): 645-651 (2022) - [j13]Maoli Liu, Jonathan Allcock, Kechao Cai, Shengyu Zhang, John C. S. Lui:
Quantum Networks with Multiple Service Providers: Transport Layer Protocols and Research Opportunities. IEEE Netw. 36(5): 56-62 (2022) - [c38]Xiaohui Bei, Shengyu Zhang:
The Secretary Problem with Competing Employers on Random Edge Arrivals. AAAI 2022: 4818-4825 - [c37]Lei Xie, Jidong Zhai, Zhenxing Zhang, Jonathan Allcock, Shengyu Zhang, Yicong Zheng:
Suppressing ZZ crosstalk of Quantum computers through pulse and scheduling co-optimization. ASPLOS 2022: 499-513 - [c36]Yue Wan, Chang-Yu Hsieh, Ben Liao, Shengyu Zhang:
Retroformer: Pushing the Limits of End-to-end Retrosynthesis Transformer. ICML 2022: 22475-22490 - [i35]Yue Wan, Benben Liao, Chang-Yu Hsieh, Shengyu Zhang:
Retroformer: Pushing the Limits of Interpretable End-to-end Retrosynthesis Transformer. CoRR abs/2201.12475 (2022) - [i34]Lixue Cheng, Ziyi Yang, Benben Liao, Chang-Yu Hsieh, Shengyu Zhang:
ODBO: Bayesian Optimization with Search Space Prescreening for Directed Protein Evolution. CoRR abs/2205.09548 (2022) - [i33]Tongyang Li, Xinzhao Wang, Shengyu Zhang:
A Unified Quantum Algorithm Framework for Estimating Properties of Discrete Probability Distributions. CoRR abs/2212.01571 (2022) - 2021
- [j12]Pengyong Li, Yuquan Li, Chang-Yu Hsieh, Shengyu Zhang, Xianggen Liu, Huanxiang Liu, Sen Song, Xiaojun Yao:
TrimNet: learning molecular representation from triplet messages for biomedicine. Briefings Bioinform. 22(4) (2021) - [j11]Shi-Xin Zhang, Chang-Yu Hsieh, Shengyu Zhang, Hong Yao:
Neural predictor based quantum architecture search. Mach. Learn. Sci. Technol. 2(4): 45027 (2021) - [c35]Junsheng Kong, Weizhao Li, Zeyi Liu, Ben Liao, Jiezhong Qiu, Chang-Yu Hsieh, Yi Cai, Shengyu Zhang:
Fast Extraction of Word Embedding from Q-contexts. CIKM 2021: 873-882 - [c34]Troy Lee, Tongyang Li, Miklos Santha, Shengyu Zhang:
On the Cut Dimension of a Graph. CCC 2021: 15:1-15:35 - [c33]Mengyu Zhang, Lei Xie, Zhenxing Zhang, Qiaonian Yu, Guanglei Xi, Hualiang Zhang, Fuming Liu, Yarui Zheng, Yicong Zheng, Shengyu Zhang:
Exploiting Different Levels of Parallelism in the Quantum Control Microarchitecture for Superconducting Qubits. MICRO 2021: 898-911 - [c32]Troy Lee, Miklos Santha, Shengyu Zhang:
Quantum algorithms for graph problems with cut queries. SODA 2021: 939-958 - [i32]Mengyu Zhang, Lei Xie, Zhenxing Zhang, Qiaonian Yu, Guanglei Xi, Huangliang Zhang, Fuming Liu, Yarui Zheng, Yicong Zheng, Shengyu Zhang:
Exploiting Different Levels of Parallelism in the Quantum Control Microarchitecture for Superconducting Qubits. CoRR abs/2108.08671 (2021) - [i31]Junsheng Kong, Weizhao Li, Zeyi Liu, Ben Liao, Jiezhong Qiu, Chang-Yu Hsieh, Yi Cai, Shengyu Zhang:
Fast Extraction of Word Embedding from Q-contexts. CoRR abs/2109.07084 (2021) - [i30]Junsheng Kong, Weizhao Li, Ben Liao, Jiezhong Qiu, Chang-Yu Hsieh, Yi Cai, Jinhui Zhu, Shengyu Zhang:
Learning Large-scale Network Embedding from Representative Subgraph. CoRR abs/2112.01442 (2021) - 2020
- [i29]Troy Lee, Miklos Santha, Shengyu Zhang:
Quantum algorithms for graph problems with cut queries. CoRR abs/2007.08285 (2020) - [i28]Troy Lee, Tongyang Li, Miklos Santha, Shengyu Zhang:
On the cut dimension of a graph. CoRR abs/2011.05085 (2020)
2010 – 2019
- 2019
- [c31]Pengfei Chen, Benben Liao, Guangyong Chen, Shengyu Zhang:
Understanding and Utilizing Deep Neural Networks Trained with Noisy Labels. ICML 2019: 1062-1070 - [c30]Weiwen Liu, Jun Guo, Nasim Sonboli, Robin Burke, Shengyu Zhang:
Personalized fairness-aware re-ranking for microlending. RecSys 2019: 467-471 - [i27]Pengfei Chen, Benben Liao, Guangyong Chen, Shengyu Zhang:
Understanding and Utilizing Deep Neural Networks Trained with Noisy Labels. CoRR abs/1905.05040 (2019) - [i26]Guangyong Chen, Pengfei Chen, Yujun Shi, Chang-Yu Hsieh, Benben Liao, Shengyu Zhang:
Rethinking the Usage of Batch Normalization and Dropout in the Training of Deep Neural Networks. CoRR abs/1905.05928 (2019) - [i25]Pengfei Chen, Weiwen Liu, Chang-Yu Hsieh, Guangyong Chen, Shengyu Zhang:
Utilizing Edge Features in Graph Neural Networks via Variational Information Maximization. CoRR abs/1906.05488 (2019) - [i24]Pengfei Chen, Benben Liao, Guangyong Chen, Shengyu Zhang:
A Meta Approach to Defend Noisy Labels by the Manifold Regularizer PSDR. CoRR abs/1906.05509 (2019) - [i23]Guangyong Chen, Pengfei Chen, Chang-Yu Hsieh, Chee-Kong Lee, Benben Liao, Renjie Liao, Weiwen Liu, Jiezhong Qiu, Qiming Sun, Jie Tang, Richard S. Zemel, Shengyu Zhang:
Alchemy: A Quantum Chemistry Dataset for Benchmarking AI Models. CoRR abs/1906.09427 (2019) - 2018
- [j10]Tao Xiang, Xiaoguo Li, Fei Chen, Yuanyuan Yang, Shengyu Zhang:
Achieving verifiable, dynamic and efficient auditing for outsourced database in cloud. J. Parallel Distributed Comput. 112: 97-107 (2018) - [j9]Itai Arad, Miklos Santha, Aarthi Sundaram, Shengyu Zhang:
Linear-Time Algorithm for Quantum 2SAT. Theory Comput. 14(1): 1-27 (2018) - [c29]Xiaohui Bei, Shengyu Zhang:
Algorithms for Trip-Vehicle Assignment in Ride-Sharing. AAAI 2018: 3-9 - [c28]Shuai Li, Shengyu Zhang:
Online Clustering of Contextual Cascading Bandits. AAAI 2018: 3554-3561 - [c27]Weiwen Liu, Shuai Li, Shengyu Zhang:
Contextual Dependent Click Bandit Algorithm for Web Recommendation. COCOON 2018: 39-50 - [c26]Jiajin Li, Baoxiang Wang, Shengyu Zhang:
Policy Optimization with Second-Order Advantage Information. IJCAI 2018: 5038-5044 - [c25]Yitong Meng, Guangyong Chen, Jiajin Li, Shengyu Zhang:
Psrec: social recommendation with pseudo ratings. RecSys 2018: 397-401 - [c24]Weiwen Liu, Ruiming Tang, Jiajin Li, Jinkai Yu, Huifeng Guo, Xiuqiang He, Shengyu Zhang:
Field-aware probabilistic embedding neural network for CTR prediction. RecSys 2018: 412-416 - [i22]Jonathan Allcock, Chang-Yu Hsieh, Iordanis Kerenidis, Shengyu Zhang:
Quantum algorithms for feedforward neural networks. CoRR abs/1812.03089 (2018) - 2017
- [j8]Rahul Jain, Zhaohui Wei, Penghui Yao, Shengyu Zhang:
Multipartite Quantum Correlation and Communication Complexities. Comput. Complex. 26(1): 199-228 (2017) - [j7]Zhaohui Wei, Shengyu Zhang:
Quantum game players can have advantage without discord. Inf. Comput. 256: 174-184 (2017) - [j6]Yang Liu, Shengyu Zhang:
Fast quantum algorithms for least squares regression and statistic leverage scores. Theor. Comput. Sci. 657: 38-47 (2017) - [c23]Guangda Huzhang, Xin Huang, Shengyu Zhang, Xiaohui Bei:
Online Roommate Allocation Problem. IJCAI 2017: 235-241 - [c22]Xiaohui Bei, Youming Qiao, Shengyu Zhang:
Networked Fairness in Cake Cutting. IJCAI 2017: 3632-3638 - [i21]Xiaohui Bei, Youming Qiao, Shengyu Zhang:
Networked Fairness in Cake Cutting. CoRR abs/1707.02033 (2017) - [i20]Shuai Li, Shengyu Zhang:
Online Clustering of Contextual Cascading Bandits. CoRR abs/1711.08594 (2017) - 2016
- [c21]Hing Yin Tsang, Ning Xie, Shengyu Zhang:
Fourier Sparsity of GF(2) Polynomials. CSR 2016: 409-424 - [c20]Itai Arad, Miklos Santha, Aarthi Sundaram, Shengyu Zhang:
Linear Time Algorithm for Quantum 2SAT. ICALP 2016: 15:1-15:14 - [c19]Shuai Li, Baoxiang Wang, Shengyu Zhang, Wei Chen:
Contextual Combinatorial Cascading Bandits. ICML 2016: 1245-1253 - [c18]Itai Arad, Adam Bouland, Daniel Grier, Miklos Santha, Aarthi Sundaram, Shengyu Zhang:
On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems. MFCS 2016: 12:1-12:14 - [r1]Xiaohui Bei, Ning Chen, Shengyu Zhang:
Trial and Error Algorithms. Encyclopedia of Algorithms 2016: 2258-2261 - [i19]Itai Arad, Adam Bouland, Daniel Grier, Miklos Santha, Aarthi Sundaram, Shengyu Zhang:
On the complexity of probabilistic trials for hidden satisfiability problems. CoRR abs/1606.03585 (2016) - 2015
- [c17]Fei Chen, Tao Xiang, Jianyong Chen, Wei Yu, Xinwen Fu, Shengyu Zhang:
A Semantic Hash Tree Based Verifiable Data Access Protocol on the Cloud. CBD 2015: 219-226 - [c16]Yang Liu, Shengyu Zhang:
Fast Quantum Algorithms for Least Squares Regression and Statistic Leverage Scores. FAW 2015: 204-216 - [c15]Xiaohui Bei, Ning Chen, Shengyu Zhang:
Solving Linear Programming with Constraints Unknown. ICALP (1) 2015: 129-142 - [c14]Fei Chen, Tao Xiang, Yuanyuan Yang, Cong Wang, Shengyu Zhang:
Secure cloud storage hits distributed string equality checking: More efficient, conceptually simpler, and provably secure. INFOCOM 2015: 2389-2397 - [c13]Zhaohui Wei, Shengyu Zhang:
Quantum Game Players Can Have Advantage Without Discord. TAMC 2015: 311-323 - [i18]Zhaohui Wei, Shengyu Zhang:
Quantum game players can have advantage without discord. CoRR abs/1502.00207 (2015) - [i17]Hing Yin Tsang, Ning Xie, Shengyu Zhang:
Fourier Sparsity of GF(2) Polynomials. CoRR abs/1508.02158 (2015) - [i16]Itai Arad, Miklos Santha, Aarthi Sundaram, Shengyu Zhang:
Linear time algorithm for quantum 2SAT. CoRR abs/1508.06340 (2015) - 2014
- [i15]Rahul Jain, Zhaohui Wei, Penghui Yao, Shengyu Zhang:
Approximate and Multipartite Quantum Correlation (Communication) Complexity. CoRR abs/1405.6015 (2014) - 2013
- [j5]Zhaohui Wei, Shengyu Zhang:
Full characterization of quantum correlated equilibria. Quantum Inf. Comput. 13(9-10): 846-860 (2013) - [j4]Rahul Jain, Yaoyun Shi, Zhaohui Wei, Shengyu Zhang:
Efficient Protocols for Generating Bipartite Classical Distributions and Quantum States. IEEE Trans. Inf. Theory 59(8): 5171-5178 (2013) - [c12]Hing Yin Tsang, Chung Hoi Wong, Ning Xie, Shengyu Zhang:
Fourier Sparsity, Spectral Norm, and the Log-Rank Conjecture. FOCS 2013: 658-667 - [c11]Rahul Jain, Yaoyun Shi, Zhaohui Wei, Shengyu Zhang:
Efficient protocols of generating bipartite classical distributions and quantum states. SODA 2013: 1503-1512 - [c10]Xiaohui Bei, Ning Chen, Shengyu Zhang:
On the complexity of trial and error. STOC 2013: 31-40 - [i14]Hing Yin Tsang, Chung Hoi Wong, Ning Xie, Shengyu Zhang:
Fourier sparsity, spectral norm, and the Log-rank conjecture. CoRR abs/1304.1245 (2013) - [i13]Xiaohui Bei, Ning Chen, Shengyu Zhang:
Solving Linear Programming with Constraints Unknown. CoRR abs/1304.1247 (2013) - 2012
- [j3]Rahul Jain, Iordanis Kerenidis, Greg Kuperberg, Miklos Santha, Or Sattath, Shengyu Zhang:
On the Power of a Unique Quantum Witness. Theory Comput. 8(1): 375-400 (2012) - [c9]Shengyu Zhang:
Quantum strategic game theory. ITCS 2012: 39-59 - [c8]Iordanis Kerenidis, Shengyu Zhang:
A Quantum Protocol for Sampling Correlated Equilibria Unconditionally and without a Mediator. TQC 2012: 13-28 - [i12]Rahul Jain, Yaoyun Shi, Zhaohui Wei, Shengyu Zhang:
Correlation/Communication complexity of generating bipartite states. CoRR abs/1203.1153 (2012) - [i11]Xiaohui Bei, Ning Chen, Shengyu Zhang:
On the Complexity of Trial and Error. CoRR abs/1205.1183 (2012) - [i10]Xiaohui Bei, Ning Chen, Shengyu Zhang:
On the Complexity of Trial and Error. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j2]Rahul Jain, Shengyu Zhang:
The Influence Lower Bound Via Query Elimination. Theory Comput. 7(1): 147-153 (2011) - [c7]Shengyu Zhang:
On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity. ICALP (1) 2011: 49-60 - [c6]Ming Lam Leung, Yang Li, Shengyu Zhang:
Tight Bounds on Communication Complexity of Symmetric XOR Functions in One-Way and SMP Models. TAMC 2011: 403-408 - [i9]Ming Lam Leung, Yang Li, Shengyu Zhang:
Tight bounds on the randomized communication complexity of symmetric XOR functions in one-way and SMP models. CoRR abs/1101.4555 (2011) - [i8]Rahul Jain, Shengyu Zhang:
The influence lower bound via query elimination. CoRR abs/1102.4699 (2011) - [i7]Iordanis Kerenidis, Shengyu Zhang:
A quantum protocol for sampling correlated equilibria unconditionally and without a mediator. CoRR abs/1104.1770 (2011) - [i6]Zhaohui Wei, Shengyu Zhang:
On characterizing quantum correlated equilibria. CoRR abs/1105.5353 (2011) - [i5]Rahul Jain, Shengyu Zhang:
The influence lower bound via query elimination. Electron. Colloquium Comput. Complex. TR11 (2011) - [i4]Ming Lam Leung, Yang Li, Shengyu Zhang:
Tight bounds on the randomized communication complexity of symmetric XOR functions in one-way and SMP models. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [c5]Rahul Jain, Hartmut Klauck, Shengyu Zhang:
Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas. COCOON 2010: 54-59 - [c4]Troy Lee, Shengyu Zhang:
Composition Theorems in Communication Complexity. ICALP (1) 2010: 475-489 - [c3]Rahul Jain, Iordanis Kerenidis, Greg Kuperberg, Miklos Santha, Or Sattath, Shengyu Zhang:
On the Power of a Unique Quantum Witness. ICS 2010: 470-481 - [i3]Troy Lee, Shengyu Zhang:
Composition theorems in communication complexity. CoRR abs/1003.1443 (2010)
2000 – 2009
- 2009
- [j1]Rahul Jain, Shengyu Zhang:
New bounds on classical and quantum one-way communication complexity. Theor. Comput. Sci. 410(26): 2463-2477 (2009) - [c2]Shengyu Zhang:
On the Tightness of the Buhrman-Cleve-Wigderson Simulation. ISAAC 2009: 434-440 - [c1]Yury Lifshits, Shengyu Zhang:
Combinatorial algorithms for nearest neighbors, near-duplicates and small-world design. SODA 2009: 318-326 - [i2]Rahul Jain, Hartmut Klauck, Shengyu Zhang:
Depth-Independent Lower bounds on the Communication Complexity of Read-Once Boolean Formulas. CoRR abs/0908.4453 (2009) - 2008
- [i1]Rahul Jain, Shengyu Zhang:
New bounds on classical and quantum one-way communication complexity. CoRR abs/0802.4101 (2008)
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-12-11 21:39 CET 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:
