Tongyang Li
Assistant Professor
Designs quantum algorithms for machine learning and optimization and studies quantum query complexity.
Tongyang Li's lab at Peking works on learning theory & optimization. 32 papers since 2023, 3 at top venues, mostly AAAI and ICML. 8 PhD students. Applications close .
At a glance
- papers, 2023–2026
- 8/ year
- at T1 venues
- 9%
- PhD students
- 8
- MS students
- 0
- alumni listed
- —
Papers by yearfrom the lab homepage, 2023–2026
- 7 papers2026 · T1 0 · collecting
- 9 papers2025 · T1 1
- 9 papers2024 · T1 0
- 7 papers2023 · T1 2
T1 venuesOtherVenues: AAAI, ICML, Nature Communications
Research focuspaper titles that use each topic's words
- quantum27 papers
- Learning theory & optimization8 papers
- quantum algorithms4 papers
- complexity1 paper
- query0 papers
Paper list
From the lab homepage.
20267 papers
- Accepted by the IEEE International Symposium on High Performance Computer Architecture (HPCA ).DC-MBQC: A Distributed Quantum Compilation Framework for Measurement-Based Quantum Computing (opens in a new tab)
- Accepted by the Annual Symposium on Foundations of Computer Science (FOCS ).DQC1-completeness of normalized trace estimation for functions of log-local Hamiltonians (opens in a new tab)
- Accepted by the International Conference on Machine Learning (ICML ).Finding Stationary Points by Comparisons (opens in a new tab)
- Accepted by the International Conference on Machine Learning (ICML ).Gradient Testing and Estimation by Comparisons (opens in a new tab)
- Accepted by the International Conference on Machine Learning (ICML ).Matrix-Free GPU Semidefinite Programming for Quantum Ordered Search at the k=6 Frontier
- Quantum Science and TechnologyPerformance guarantees of light-cone variational quantum algorithms for the maximum cut problem (opens in a new tab)
- Accepted by the International Colloquium on Automata, Languages, and Programming (ICALP ).Quantum Multi-Level Estimation of Functionals of Discrete Distributions (opens in a new tab)
20259 papers
- Nature Communications (T1)Efficient classical sampling from Gaussian boson sampling distributions on unweighted graphs (opens in a new tab)
- Communications in Mathematical PhysicsExponential speedups for quantum walks in random hierarchical graphs (opens in a new tab)
- Accepted by the Annual Conference on Neural Information Processing Systems (NeurIPS ).Near-Optimal Quantum Algorithms for Computing (Coarse) Correlated Equilibria of General-Sum Games (opens in a new tab)
- Accepted by the Annual Conference on Neural Information Processing Systems (NeurIPS ).QCircuitBench: A Large-Scale Dataset for Benchmarking Quantum Algorithm Design (opens in a new tab)
- Physical Review Research, 7, 033014, .Quantum Approximate Optimization Algorithms for Maxmimum Cut on Low-Girth Graphs (opens in a new tab)
- Nature Physics, 21, 512-513, .Quantum computers quickly find local minima (opens in a new tab)
- Communications in Mathematical PhysicsQuantum Langevin Dynamics for Optimization (opens in a new tab)
- Accepted by the International Conference on Learning Representations (ICLR ).Robustness of Quantum Algorithms for Nonconvex Optimization (opens in a new tab)
- Frontiers of Computer ScienceShadow Tomography of Quantum States with Prediction (opens in a new tab)
20249 papers
- IEEE Transactions on Information TheoryA Quantum Algorithm Framework for Discrete Probability Distributions with Applications to Rényi Entropy Estimation (opens in a new tab)
- Quantum, 8:1471, .Adaptive Online Learning of Quantum States (opens in a new tab)
- Accepted by the Design Automation Conference (DAC ).Combining Parameterized Pulses and Contextual Subspace for More Practical VQE (opens in a new tab)
- Quantum, 8:1409, .Complexity of Digital Quantum Simulation in the Low-Energy Subspace: Applications and a Lower Bound (opens in a new tab)
- Accepted by the Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC ).Efficient Optimal Control of Open Quantum Systems (opens in a new tab)
- Accepted by the International Conference on Learning Representations (ICLR ).Near-Optimal Quantum Algorithm for Minimizing the Maximal Loss (opens in a new tab)
- Accepted by the International Conference on Machine Learning (ICML ).Provably Efficient Exploration in Quantum Reinforcement Learning with Logarithmic Worst-Case Regret (opens in a new tab)
- Accepted by the International Conference on Machine Learning (ICML ).Quantum Algorithms and Lower Bounds for Finite-Sum Optimization (opens in a new tab)
- Accepted by the Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC ).Quantum Non-Identical Mean Estimation: Efficient Algorithms and Fundamental Limits (opens in a new tab)
20237 papers
- Accepted by the Conference on Neural Information Processing Systems (NeurIPS ).Logarithmic-Regret Quantum Learning Algorithms for Zero-Sum Games (opens in a new tab)
- Accepted by the International Conference on Machine Learning (ICML ).Near-Optimal Quantum Coreset Construction Algorithms for Clustering (opens in a new tab)
- Quantum, 7:1030, .On Quantum Speedups for Nonconvex Optimization via Quantum Tunneling Walks (opens in a new tab)
- ACM Transactions on Quantum ComputingQuantum algorithm for estimating volumes of convex bodies (opens in a new tab)
- Quantum Machine IntelligenceQuantum autoencoders for communication-efficient quantum cloud computing (opens in a new tab)
- ICML (T1)Quantum Lower Bounds for Finding Stationary Points of Nonconvex Functions (opens in a new tab)
- AAAI (T1)Quantum Multi-Armed Bandits and Stochastic Linear Bandits Enjoy Logarithmic Regrets (opens in a new tab)
Where alumni went
Alumni are not listed on the lab homepage.
Apply to PekingFall 2027
Computer Science PhD (international applicants)
- Round
- Main
- Opens
- —
- GRE
- See program page
- English
- See program page
- Fee
- See program page
Not yet confirmed for this intake.
Similar labsnearest by research summary
- USUCSD
Sanjoy Dasgupta
- Learning theory & optimization
- USUMD
Furong Huang
- Generative & foundation models
- USCMU
Steven Wu
- Trustworthy & safe ML
- USUSC
Phebe Vayanos
- Trustworthy & safe ML
- USUCLA
Yuan Tian
- Trustworthy & safe ML
- USNYU
Shengjie Wang
- Learning theory & optimization
Your notes
Save this lab to keep notes.
Data
Some numbers could not be verified:
- The alumni list could not be found on the lab site.
- Collected
- Verified
- Papers
- The lab homepage
- Members
- Lab homepage
- Alumni
- Not collected
Tiers are venue classifications, not lab rankings.
Pekingcloses