Qian Li

Address: Room 841, Institute of Computing Technology, CAS
No.6 Kexueyuan South Road, Zhongguancun
Haidian District, Beijing 100190, China
Email: liqian@ict.ac.cn

Research Interests
Quantum Computing, Boolean function analysis, Computational Complexity
Eduction
♦ Institute of Computing Technology, CAS. PhD. 2013-2018
♦ Chongqing University, B.S. in Intergrated Circuits and Intergrated System, 2009-2013
Publications

♦ Qian Li, Xiaoming Sun: On the modulo degree complexity of Boolean functions. Theoretical Computer Science, 818, pp. 32-40.

♦ Qian Li, Xiaoming Sun, Jialin Zhang: On the Optimality of Tape Merge of Two Lists with Similar Size. Algorithmica, 82(7), pp. 2107-2132. [arXiv]

♦ Kun He, Qian Li, Xiaoming Sun, Jiapeng Zhang: Quantum Lovász local lemma: Shearer's bound is tight. In 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC 2019), pp. 461-472. [arXiv]

♦ Kun He, Qian Li, Xiaoming Sun: A tighter relation between sensitivity complexity and certificate complexity. Theoretical Computer Science, 762, pp. 1-12.

♦ Kun He, Qian Li, Xiaoming Sun: A Tighter Relation Between Sensitivity Complexity and Certificate Complexity. In 23rd International Conference on Computing and Combinatorics Conference (COCOON 2017), pp. 262-274.

♦ Qian Li, Xiaoming Sun: On the Modulo Degree Complexity of Boolean Functions. In 23rd International Conference on Computing and Combinatorics Conference (COCOON 2017), pp. 384-395.

♦ Qian Li, Xiaoming Sun: On the Sensitivity Complexity of k-Uniform Hypergraph Properties. In 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), pp. 51:1-51:12.

♦ Jia Zhang, Zheng Wang, Qian Li, Jialin Zhang, Yanyan Lan, Qiang Li, Xiaoming Sun: Efficient Delivery Policy to Minimize User Traffic Consumption in Guaranteed Advertising. In 31st AAAI Conference on Artificial Intelligence (AAAI 2017), pp. 252-258.

♦ Qian Li, Xiaoming Sun, Jialin Zhang: On the Optimality of Tape Merge of Two Lists with Similar Size. In 27th International Symposium on Algorithms and Computation (ISAAC 2016), pp. 51:1-51:17.