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 honour) in 2014 from School of Mathematics and Statistics, Wuhan University.
Join our online reading group “From Euclidean to Geodesic Convex Optimization”.
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-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.
[July-2020] Our paper The Haemers bound of noncommutative graphs was accepted for publication in IEEE Journal on Selected Areas in Information Theory.
[June-2020] Our paper Improved Algorithms for Alternating Matrix Space Isometry: from Theory to Practice was accepted to European Symposium on Algorithms (ESA2020).
Quantum asymptotic spectra of graphs and non-commutative graphs, and quantum Shannon capacities.
Y. L., Jeroen Zuiddam.
Accepted for publication in IEEE Transactions on Information Theory.
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 .
In proceedings of the European Symposium on Algorithms (ESA2020)
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.
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.
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.