李乾
职务/职称
深圳国际工业与应用数学中心 研究科学家
教育背景
中国科学院计算技术研究所 博士
重庆大学 学士
研究领域
大数据理论、理论计算机
电子邮件
liqian.sea@hotmail.com
个人介绍
李乾博士具体研究方向包括算法设计与分析，计算复杂性，量子电路优化等。于2013年在重庆大学获得集成电路设计与集成系统专业的学士学位。2018年在中国科学院计算技术研究所获得博士学位，师从孙晓明研究员，期间曾赴加州大学圣迭戈分校访问Shachar Lovett教授。2018年入职阿里巴巴任高级算法工程师，负责搜索广告的拍卖机制设计，期间为阿里巴巴设计了一套广告位拍卖机制，其每年可以为阿里巴巴集团多创造上千亿人民币的成交额以及约十亿人民币的利润。随后入职深圳计算科学研究院，跟随英国皇家科学院院士、中国科学院外籍院士樊文飞从事大数据理论方向的研究工作，期间其共同撰写的关于量子洛瓦兹局部引理的论文被理论计算机顶级会议—STOC录用。据不完全统计，这是华南地区单位首次被该会议录用论文。担任CCF理论计算机专委会执行委员。其工作发表在STOC, SODA , Theory of Computing, ACM TOCT等理论计算机科学会议/期刊上。
学术著作
[1] 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. AAAI 2017: 252-258
[2] Kun He, Qian Li, Xiaoming Sun: A tighter relation between sensitivity complexity and certificate complexity. Theor. Comput. Sci. 762: 1-12 (2019)
[3] Kun He, Qian Li, Xiaoming Sun, Jiapeng Zhang: Quantum Lovász local lemma: Shearer's bound is tight. STOC 2019: 461-472
[4] Qian Li, Xiaoming Sun, Jialin Zhang: On the Optimality of Tape Merge of Two Lists with Similar Size. Algorithmica 82(7): 2107-2132 (2020)
[5] Zhihuai Chen, Qian Li, Xiaoming Sun, Lirong Xia, Jialin Zhang: Approximate Single-Peakedness in Large Elections. ICKG 2020: 433-440
[6] Wenfei Fan, Kun He, Qian Li, Yue Wang: Graph algorithms: parallelization and scalability. Sci. China Inf. Sci. 63(10): 1-21 (2020)
[7] Qian Li, Xiaoming Sun: On the modulo degree complexity of Boolean functions. Theor. Comput. Sci. 818: 32-40 (2020)
[8] Qian Li, Xiaoming Sun: On the Sensitivity Complexity of k-Uniform Hypergraph Properties. ACM Trans. Comput. Theory 13(2): 12:1-12:13 (2021)
[9] Siyao Guo, Qian Li, Qipeng Liu, Jiapeng Zhang: Unifying Presampling via Concentration Bounds. TCC (1) 2021: 177-208.
[10] Jianer Chen, Qin Huang, Iyad Kanj, Qian Li, Ge Xia: Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time. ISAAC 2021: 48:1-48:17
[11] Kun He, Qian Li, Xiaoming Sun: Moser-Tardos Algorithm: Beyond Shearer's Bound. SODA 2023: 3362-3387
[12] Longcheng Li, Cheng Guo, Qian Li, and Xiaoming Sun: Fast Exact Synthesis of Two-qubit Unitaries Using Near Minimum Number of T Gates. Physical Review A, 2023, 107(4): 042424.
[13] Wei Zi, Qian Li, and Xiaoming Sun: Optimal Synthesis of Multi-Controlled Qudit Gates. To appear in the 60th Design Automation Conference (DAC-2023).
[14] Zhihuai Chen, Siyao Guo, Qian Li, Chengyu Lin, and Xiaoming Sun. New Distinguishers for Negation-Limited Weak Pseudorandom Functions. To appear in Theory of Computing.
