Since September 2022, I have been an assistant professor (tenure-track) at the Department of Information and Computational Sciences, School of Mathematics and Statistics, Wuhan University (my Alma Mater). My office is Xi-Bei Lou 209.

From November 2020 to August 2022, I was a designated assistant professor (tokunin-jokyo, 特任助教) at Graduate School of Mathematics, Nagoya university. I was part of the QLEAP theory group lead by Professor François Le Gall.

From June 2018 to June 2020, I was a Postdoctoral researcher at Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands, supervised by Prof. Ronald de Wolf and Dr. Michael Walter. I was also affiliated with the Research Center for Quantum Software (QuSoft).

I received my Ph.D. from Centre for Quantum Software and Information (QSI), University of Technology Sydney (UTS), supervised by Prof. Runyao Duan and Dr. Youming Qiao (and informally co-advised by Prof. Andreas Winter). Before that, I received my B.Sc. (with Hongyi honor) in 2014 from School of Mathematics and Statistics, Wuhan University.

From 2021 to 2022, I was the organizer of the QLEAP theory seminar. In 2020, I co-organized an online reading group “From Euclidean to Geodesic Convex Optimization”.

- Classical and quantum zero-error information theory
- Classical and quantum algorithms (e.g. for group actions and for linear algebraic problems)
- Noncommutative generalizations of the graph theory

Ph.D. in Quantum Information, 2018

University of Technology Sydney, Australia

B.Sc. in Mathematics, 2014

Wuhan University, China

Exchange student, 2013

Utrecht University, the Netherlands

[Oct. 2023] New paper posted: Dynamic quantum circuit compilation , joint with Kun Fang, Munan Zhang, Ruqi Shi.

[Oct. 2023] Together with Yunfeng Xiong and Yingzhou Li, we oganize a mini-symposium “High-dimensional problems and quantum computing” at the CSIAM Annual Meeting 2023.

[Oct. 2023] New paper posted: Provable Advantage of Parameterized Quantum Circuit in Function Approximation, joint with Zhan Yu, Qiuhao Chen, Yuling Jiao, Xiliang Lu, Xin Wang, Jerry Zhijian Yang.

[Jan. 2023] Our paper Connections between graphs and matrix spaces has been accepted for publication in Israel Journal of Mathematics.

[Dec. 2022] New paper posted: On linear-algebraic notions of expansion , joint with Youming Qiao, Avi Wigderson, Yuval Wigderson, Chuanqi Zhang.

[June 2022] New paper posted: Connections between graphs and matrix spaces , joint with Youming Qiao, Avi Wigderson, Yuval Wigderson, Chuanqi Zhang.

[May 2022] Our paper On a tracial version of Haemers bound has been accepted for publication in IEEE Transactions on Information Theory.

[Aug 2021] Our paper On a tracial version of Haemers bound has been accepted for presentation at AQIS 2021 and Beyond IID 2021.

[July 2021] New paper posted: On a tracial version of Haemers bound, joint with Li Gao and Sander Gribling.

[Apr. 2021] Our paper Quantum algorithms for matrix scaling and matrix balancing has been accepted for ICALP 2021 and TQC 2021.

[Nov. 2020] New paper posted: Quantum algorithms for matrix scaling and matrix balancing , joint with Joran van Apeldoorn, Sander Gribling, Harold Nieuwboer, Michael Walter and Ronald de Wolf.

[Oct. 2020] Our paper Quantum asymptotic spectra of graphs and non-commutative graphs, and quantum Shannon capacities was accepted for publication in IEEE Transactions on Information Theory.

[Aug. 2020] New paper posted: Interior-point methods for unconstrained geometric programming and scaling problems, joint with Peter Bürgisser, Harold Nieuwboer and Michael Walter.

[Aug. 2020] Our paper Group-theoretic generalisations of vertex and edge connectivities was published in Proceedings of the American Mathematical Society.

[Jul. 2020] Our paper The Haemers bound of noncommutative graphs was accepted for publication in IEEE Journal on Selected Areas in Information Theory.

[Jun. 2020] Our paper Improved Algorithms for Alternating Matrix Space Isometry: from Theory to Practice was accepted to European Symposium on Algorithms (ESA2020).

Dynamic quantum circuit compilation.

Kun Fang, Munan Zhang, Ruqi Shi, Y. L..

ArXiv: 2310.2310.11021, 2023.Provable Advantage of Parameterized Quantum Circuit in Function Approximation.

Zhan Yu, Qiuhao Chen, Yuling Jiao, Y. L., Xiliang Lu, Xin Wang, Jerry Zhijian Yang.

ArXiv: 2310.07528, 2023.Connections between graphs and matrix spaces.

Y. L., Youming Qiao, Avi Wigderson, Yuval Wigderson, Chuanqi Zhang.

arXiv:2206.04815, 2023.

In Israel Journal of Mathematics.On linear-algebraic notions of expansion.

Y. L., Youming Qiao, Avi Wigderson, Yuval Wigderson, Chuanqi Zhang.

ArXiv:2212.13154, ECCC-TR23-004，2022.On a tracial version of Haemers bound.

Li Gao, Sander Gribling, Y. L..

arXiv:2107.02567, 2021.

In IEEE Transactions on Information Theory.Quantum algorithms for matrix scaling and matrix balancing.

Joran van Apeldoorn, Sander Gribling, Y. L., Harold Nieuwboer, Michael Walter, Ronald de Wolf.

arXiv:2011.12823, 2020.

In 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021).Quantum asymptotic spectra of graphs and non-commutative graphs, and quantum Shannon capacities.

Y. L., Jeroen Zuiddam.

arXiv:1810.00744, 2018.

In IEEE Transactions on Information Theory.Interior-point methods for unconstrained geometric programming and scaling problems.

Peter Bürgisser, Y. L., Harold Nieuwboer, Michael Walter

arXiv: 2008.12110, 2020.The Haemers bound of noncommutative graphs.

Sander Gribling, Y. L..

arXiv: 2002.02743, 2020. In IEEE Journal on Selected Areas in Information Theory.Improved Algorithms for Alternating Matrix Space Isometry: from Theory to Practice.

Peter A. Brooksbank, Y. L., Youming Qiao, James B. Wilson.

The results appear in Section 6 of [4].

In proceedings of the European Symposium on Algorithms (ESA2020)Group-theoretic generalisations of vertex and edge connectivities.

Y. L., Youming Qiao.

arXiv: 1906.07948, 2019.

In Proceedings of the American Mathematical Society.Incorporating Weisfeiler-Leman into algorithms for group isomorphism.

Peter A. Brooksbank, Joshua A. Grochow, Y. L., Youming Qiao, James B. Wilson.

arXiv: 1905.02518, 2019.A Quantum-inspired Classical Algorithm for Separable Non-negative Matrix Factorization.

Zhihuai Chen, Y. L., Xiaoming Sun, Pei Yuan, Jialin Zhang.

In proceedings of 28th International Joint Conference on Artificial Intelligence (IJCAI), 2019.

On a tracial version of Haemers bound. [Video][Slides]

Beyond IID in Information Theory 9.

Asian Quantum Information Science Conference (AQIS 2021).

SIAM Conference on Optimization (OP21).Improved Algorithms for Alternating Matrix Space Isometry: from Theory to Practice. [Video] [Slides]

European Symposium on Algorithms, 2020.The Haemers bound of graphs and noncommutative graphs, and quantum Shannon capacities. [Slides]

Centre for the Mathematics of Quantum Theory (QMATH), University of Copenhagen, 2020.The Haemers bound of noncommutative graphs. [Slides] [Video]

23rd Annual Conference on Quantum Information Processing, Shenzhen, 2020.Bipartite perfect matching, (non-)commutative Rank, and entanglement transformation. [Slides]

Applied Math Youth Forum, Peking University, 2020.Average-case algorithm for testing pseudo-isometry of alternating matrix tuples. [Slides]

School of Mathematics, Statistics & Applied Mathematics, NUI Galway, 2019.