About

Hi! I am a quantum algorithm researcher & developer at a quantum computing startup. Currently designing and implementing hybrid quantum-classical algorithms for computational fluid dynamics, energy, and finance, spanning variational quantum circuits, QAOA, quantum annealing, and decomposition-based large-scale optimization.
Prior to that, I was a postdoctoral fellow at the Galileo Galilei Institute for Theoretical Physics, INFN. My research interests include statistical mechanics, quantum information, combinatorial physics, and their intersections with mathematical physics and high energy physics. I obtained my PhD in physics from Université Paris-Saclay under the supervision of Professor Stéphane Ouvry at LPTMS, CNRS.
I am a referee for the Physical Review journals, Reviews of Modern Physics, and SciPost Physics.

NEWS:
[Mar. 2025] 🚀New Preprint Alert arXiv:2503.02667
What is the ultimate speed limit for charging a quantum battery? We conjecture a universal bound that ties this maximum charging rate directly to "entanglement depth", i.e., how many particles must be genuinely entangled together. Comments are welcome!
[Dec. 2024] 🚀New Preprint Alert arXiv:2412.21128
Do classical lattice random walks relate to topological string theory? Using the Hofstadter model, we propose a conjecture connecting signed area enumeration to the quantum A-period of toric Calabi–Yau threefolds. Comments are welcome!

Updated: Oct. 2026

Resume

Employment

  1. 2024 — 2025 Postdoctoral Fellow, Galileo Galilei Institute

Education

  1. 2024 PhD in Physics, Université Paris-Saclay
  2. 2018 Diplôme d'ingénieur, École Centrale Paris
  3. 2015 BSc in Mathematics, École Centrale de Pékin

Publications

  1. 7. Quantum charging advantage from multipartite entanglement

    H.-L. Shi, L. Gan, K. Zhang, X.-H. Wang, W.-L. Yang, arXiv:2503.02667 (2025)

    Links: [DOI] [Google Scholar] [arXiv] [INSPIRE-HEP] [ADS] [ResearchGate] [Semantic Scholar]


  2. 6. Lattice random walks and quantum A-period conjecture

    L. Gan, SciPost Phys. 19, 053 (2025)

    Links: [DOI] [Google Scholar] [arXiv] [INSPIRE-HEP] [ADS] [ResearchGate] [Semantic Scholar]


  3. 5. Algebraic area of lattice random walks and exclusion statistics

    L. Gan, Université Paris-Saclay (2023)

    Links: [DOI] [Google Scholar] [HAL]


  4. 4. Algebraic area of cubic lattice walks

    L. Gan, Physical Review E 108, 054104 (2023)

    Links: [DOI] [Google Scholar] [arXiv] [HAL] [INSPIRE-HEP] [ADS] [ResearchGate] [Semantic Scholar]


  5. 3. Combinatorics of generalized Dyck and Motzkin paths

    L. Gan, S. Ouvry, A. P. Polychronakos, Physical Review E 106, 044123 (2022)

    Links: [DOI] [Google Scholar] [arXiv] [HAL] [INSPIRE-HEP] [ADS] [ResearchGate] [Semantic Scholar]


  6. 2. Algebraic area enumeration of random walks on the honeycomb lattice

    L. Gan, S. Ouvry, A. P. Polychronakos, Physical Review E 105, 014112 (2022)

    Links: [DOI] [Google Scholar] [arXiv] [HAL] [INSPIRE-HEP] [ADS] [ResearchGate] [Semantic Scholar]


  7. 1. Electrostatic force between two dielectric particles in electrorheological fluids: beyond spherical particles

    H.-Z. Tang, L. Gan, W. An, MATEC Web of Conferences 187,04001 (2018)

    Links: [DOI] [Google Scholar] [ResearchGate] [Semantic Scholar]

Miscellanea

  1. Quotes


    The most difficult thing is not facing setbacks and frustrations, but facing them without losing enthusiasm for life. – Ko Wen-je, former mayor of Taipei City


    My mind is very peaceful. I don't care so much about the money, or the honor. I like to be very quiet and keep working by myself. – Yitang Zhang, mathematician


    Entities must not be multiplied beyond necessity. – Occam's razor


  2. Memes

    Meme Image

    Fibonacci sequence: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ... e.g. 8 miles ≈ 13 kilometers