LI, Qian
POSITION/TITLE
Research Scientist of SICIAM
RESEARCH FIELD
Theoretical Computer Sciences, machine learning, optimization
liqian.sea@hotmail.com
EDUCATION BACKGROUND
Ph.D. Theoretical Computer Sciences, Institute of Computing Technology, Chinese Academy of Sciences, 2018
B.S. Integrated Circuit Design & Integrated System, Chongqing University, 2013
BIOGRAPHY
Dr. Qian Li currently serves as a research scientist at Shenzhen International Center for Industrial and Applied Mathematics, SRIBD. Prior to joining the SRIBD, he was an assistant professor at the Institute of Computing Technology, Chinese Academy of Sciences. He has a broad interest in theoretical computer science. He has worked on algorithm design, Boolean function analysis, and quantum computing. Currently, he is particularly interested in machine learning and optimization. His research is funded by Hetao Shenzhen-Hong Kong Science and Technology Innovation Cooperation Zone Project and a Young Scientists Fund of the National Natural Science Foundation of China.
ACADEMIC PUBLICATIONS (Papers with authors listed in alphabetical order are specified by a star (*).)
[1].Wei Zi, Qian Li (co-first author), and Xiaoming Sun. Optimal Synthesis of Multi-Controlled Qudit Gates. In the 60th Design Automation Conference (DAC-2023).
[2].Longcheng Li, Cheng Guo, Qian Li (corresponding author), and Xiaoming Sun. Fast Exact Synthesis of Two-qubit Unitaries Using Near Minimum Number of T Gates. Physical Review A, 2023.
[3].Kun He, Qian Li, and Xiaoming Sun. Moser-Tardos Algorithm: beyond Shearer's bound. In the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023).*
[4].Siyao Guo, Qian Li, Qipeng Liu, Jiapeng Zhang. Unifying Presampling via Concentration Bounds. In the 19th Theory of Cryptography Conference (TCC 2021). *
[5].Jianer Chen, Qin Huang, Iyad Kanj, Qian Li, Ge Xia. Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time. In the 32nd International Symposium on Algorithms and Computation (ISAAC 2021). *
[6].Kun He, Qian Li, Xiaoming Sun, and Jiapeng Zhang. Quantum Lovasz Local Lemma: Shearer’s Bound is Tight. In the 51st ACM Symposium on Theory of Computing (STOC 2019). *
