Shengyu Zhang

Orcid: 0000-0001-5907-2277

Affiliations:
  • Tencent Quantum Laboratory, Hong Kong
  • Chinese University of Hong Kong (CUHK), Department of Computer Science and Engineering, Shatin, Hong Kong
  • Princeton University, Princeton, NJ, USA (PhD 2006)


According to our database1, Shengyu Zhang authored at least 105 papers between 2004 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Multipath Inter-Domain Routing Protocols for Quantum Networks With Online Path Selection.
IEEE Trans. Netw., 2026

2025
Full Characterization of the Depth Overhead for Quantum Circuit Compilation with Arbitrary Qubit Connectivity Constraint.
Quantum, 2025

Quantum Algorithms for Finite-horizon Markov Decision Processes.
Proceedings of the Forty-second International Conference on Machine Learning, 2025

2024
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., October, 2024

A Quantum Algorithm Framework for Discrete Probability Distributions With Applications to Rényi Entropy Estimation.
IEEE Trans. Inf. Theory, May, 2024

Does Qubit Connectivity Impact Quantum Circuit Complexity?
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., February, 2024

Multi-task bioassay pre-training for protein-ligand binding affinity prediction.
Briefings Bioinform., January, 2024

Quantum Approximate Optimization Algorithms for Maxmimum Cut on Low-Girth Graphs.
CoRR, 2024

Quantum BGP with Online Path Selection via Network Benchmarking.
Proceedings of the IEEE INFOCOM 2024, 2024

Invited: Leveraging Machine Learning for Quantum Compilation Optimization.
Proceedings of the 61st ACM/IEEE Design Automation Conference, 2024

2023
Asymptotically Optimal Circuit Depth for Quantum State Preparation and General Unitary Synthesis.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., October, 2023

Optimal (controlled) quantum state preparation and improved unitary synthesis by quantum circuits with any number of ancillary qubits.
Quantum, March, 2023

TensorCircuit: a Quantum Software Framework for the NISQ Era.
Quantum, February, 2023

A Scalable, Fast and Programmable Neural Decoder for Fault-Tolerant Quantum Computation Using Surface Codes.
CoRR, 2023

Error-mitigated Quantum Approximate Optimization via Learning-based Adaptive Optimization.
CoRR, 2023

Multi-Constraint Molecular Generation using Sparsely Labelled Training Data for Localized High-Concentration Electrolyte Diluent Screening.
CoRR, 2023

Protein-Ligand Complex Generator & Drug Screening via Tiered Tensor Transform.
CoRR, 2023

2022
Quantum Networks with Multiple Service Providers: Transport Layer Protocols and Research Opportunities.
IEEE Netw., 2022

An adaptive graph learning method for automated molecular interactions and properties predictions.
Nat. Mach. Intell., 2022

Optimizing quantum annealing schedules with Monte Carlo tree search enhanced with neural networks.
Nat. Mach. Intell., 2022

ALipSol: An Attention-Driven Mixture-of-Experts Model for Lipophilicity and Solubility Prediction.
J. Chem. Inf. Model., 2022

A Unified Quantum Algorithm Framework for Estimating Properties of Discrete Probability Distributions.
CoRR, 2022

ODBO: Bayesian Optimization with Search Space Prescreening for Directed Protein Evolution.
CoRR, 2022

Retroformer: Pushing the Limits of Interpretable End-to-end Retrosynthesis Transformer.
CoRR, 2022

Retroformer: Pushing the Limits of End-to-end Retrosynthesis Transformer.
Proceedings of the International Conference on Machine Learning, 2022

Suppressing ZZ crosstalk of Quantum computers through pulse and scheduling co-optimization.
Proceedings of the ASPLOS '22: 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Lausanne, Switzerland, 28 February 2022, 2022

The Secretary Problem with Competing Employers on Random Edge Arrivals.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Neural predictor based quantum architecture search.
Mach. Learn. Sci. Technol., 2021

Learning Large-scale Network Embedding from Representative Subgraph.
CoRR, 2021

Exploiting Different Levels of Parallelism in the Quantum Control Microarchitecture for Superconducting Qubits.
CoRR, 2021

TrimNet: learning molecular representation from triplet messages for biomedicine.
Briefings Bioinform., 2021

Quantum algorithms for graph problems with cut queries.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Exploiting Different Levels of Parallelism in the Quantum Control Microarchitecture for Superconducting Qubits.
Proceedings of the MICRO '21: 54th Annual IEEE/ACM International Symposium on Microarchitecture, 2021

On the Cut Dimension of a Graph.
Proceedings of the 36th Computational Complexity Conference, 2021

Fast Extraction of Word Embedding from Q-contexts.
Proceedings of the CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1, 2021

2020
Quantum Algorithms for Feedforward Neural Networks.
ACM Trans. Quantum Comput., December, 2020

Adaptive Double-Exploration Tradeoff for Outlier Detection.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Alchemy: A Quantum Chemistry Dataset for Benchmarking AI Models.
CoRR, 2019

A Meta Approach to Defend Noisy Labels by the Manifold Regularizer PSDR.
CoRR, 2019

Utilizing Edge Features in Graph Neural Networks via Variational Information Maximization.
CoRR, 2019

Rethinking the Usage of Batch Normalization and Dropout in the Training of Deep Neural Networks.
CoRR, 2019

Personalized fairness-aware re-ranking for microlending.
Proceedings of the 13th ACM Conference on Recommender Systems, 2019

Understanding and Utilizing Deep Neural Networks Trained with Noisy Labels.
Proceedings of the 36th International Conference on Machine Learning, 2019

2018
Achieving verifiable, dynamic and efficient auditing for outsourced database in cloud.
J. Parallel Distributed Comput., 2018

Psrec: social recommendation with pseudo ratings.
Proceedings of the 12th ACM Conference on Recommender Systems, 2018

Field-aware probabilistic embedding neural network for CTR prediction.
Proceedings of the 12th ACM Conference on Recommender Systems, 2018

Optimization of Center-of-Pressure-Based Indices for Assessing Balance Ability.
Proceedings of the 2018 IEEE International Symposium on Medical Measurements and Applications, 2018

Policy Optimization with Second-Order Advantage Information.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Contextual Dependent Click Bandit Algorithm for Web Recommendation.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

Online Clustering of Contextual Cascading Bandits.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

Algorithms for Trip-Vehicle Assignment in Ride-Sharing.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Multipartite Quantum Correlation and Communication Complexities.
Comput. Complex., 2017

Online Roommate Allocation Problem.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Networked Fairness in Cake Cutting.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Learning to Aggregate Ordinal Labels by Maximizing Separating Width.
Proceedings of the 34th International Conference on Machine Learning, 2017

Sensitivity Conjecture and Log-Rank Conjecture for Functions with Small Alternating Numbers.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Trial and Error Algorithms.
Encyclopedia of Algorithms, 2016

On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Contextual Combinatorial Cascading Bandits.
Proceedings of the 33nd International Conference on Machine Learning, 2016

Linear Time Algorithm for Quantum 2SAT.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Fourier Sparsity of GF(2) Polynomials.
Proceedings of the Computer Science - Theory and Applications, 2016

Assignment and Pricing in Roommate Market.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Semiquantum key distribution without invoking the classical party's measurement capability.
Quantum Inf. Process., 2015

Fast Relative-Error Approximation Algorithm for Ridge Regression.
Proceedings of the Thirty-First Conference on Uncertainty in Artificial Intelligence, 2015

Quantum Game Players Can Have Advantage Without Discord.
Proceedings of the Theory and Applications of Models of Computation, 2015

Secure cloud storage hits distributed string equality checking: More efficient, conceptually simpler, and provably secure.
Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

On The I/O Complexity of Dynamic Distinct Counting.
Proceedings of the 18th International Conference on Database Theory, 2015

Solving Linear Programming with Constraints Unknown.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Fast Quantum Algorithms for Least Squares Regression and Statistic Leverage Scores.
Proceedings of the Frontiers in Algorithmics - 9th International Workshop, 2015

Social Models and Algorithms for Optimization of Contact Immunity of Oral Polio Vaccine.
Proceedings of the Frontiers in Algorithmics - 9th International Workshop, 2015

A Semantic Hash Tree Based Verifiable Data Access Protocol on the Cloud.
Proceedings of the Third International Conference on Advanced Cloud and Big Data, 2015

2014
Approximate and Multipartite Quantum Correlation (Communication) Complexity.
CoRR, 2014

Efficient quantum protocols for XOR functions.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013
Full characterization of quantum correlated equilibria.
Quantum Inf. Comput., 2013

Quantum and randomized communication complexity of XOR functions in the SMP model.
Electron. Colloquium Comput. Complex., 2013

On the complexity of trial and error.
Proceedings of the Symposium on Theory of Computing Conference, 2013

Efficient protocols of generating bipartite classical distributions and quantum states.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Fourier Sparsity, Spectral Norm, and the Log-Rank Conjecture.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012
BQP-Complete Problems.
Proceedings of the Handbook of Natural Computing, 2012

Correlation/Communication complexity of generating bipartite states
CoRR, 2012

A Quantum Protocol for Sampling Correlated Equilibria Unconditionally and without a Mediator.
Proceedings of the Theory of Quantum Computation, 2012

Quantum strategic game theory.
Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

2011
Tight bounds on the randomized communication complexity of symmetric XOR functions in one-way and SMP models.
Electron. Colloquium Comput. Complex., 2011

The influence lower bound via query elimination.
Electron. Colloquium Comput. Complex., 2011

On characterizing quantum correlated equilibria
CoRR, 2011

Tight Bounds on Communication Complexity of Symmetric XOR Functions in One-Way and SMP Models.
Proceedings of the Theory and Applications of Models of Computation, 2011

On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010
On the Power of a Unique Quantum Witness.
Proceedings of the Innovations in Computer Science, 2010

Composition Theorems in Communication Complexity.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

2009
New bounds on classical and quantum one-way communication complexity.
Theor. Comput. Sci., 2009

Tight Bounds for Randomized and Quantum Local Search.
SIAM J. Comput., 2009

Combinatorial algorithms for nearest neighbors, near-duplicates and small-world design.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

On the Tightness of the Buhrman-Cleve-Wigderson Simulation.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008
Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007
Distributed rate allocation for inelastic flows.
IEEE/ACM Trans. Netw., 2007

Any AND-OR Formula of Size N can be Evaluated in time N<sup>1/2+o(1)</sup> on a Quantum Computer.
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, 2007

Streaming Algorithms Measured in Terms of the Computed Quantity.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006
The communication complexity of the Hamming distance problem.
Inf. Process. Lett., 2006

New upper and lower bounds for randomized and quantum local search.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

2005
On the power of Ambainis lower bounds.
Theor. Comput. Sci., 2005

Distributed rate allocation for inelastic flows: optimization frameworks, optimality conditions, and optimal algorithms.
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

Promised and Distributed Quantum Search.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
On the Power of Ambainis's Lower Bounds.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?
Proceedings of the 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 2004


  Loading...