Changpeng Shao (邵长鹏)

320 Siyuan Building, NO 55 Zhongguancun East Road, Beijing China

Associate Professor, Key Laboratory of Mathematics Mechanization, Chinese Academy of Sciences. (Prior to this, I was a research associate at the School of Mathematics, University of Bristol working with Ashley Montanaro and Noah Linden.)

Research interests: quantum computation and symbolic computation

My research aims to better understand the power of quantum computers. I am especially interested in quantum algorithms, quantum query and communication complexity. I am also interested in symbolic computation, where I use tools from Clifford algebra, computational algebraic geometry and invariant theory to automated reasoning. Some other interesting research topics include the Kaczmarz method, randomized numerical linear algebra.

"If you can't do great things, do small things in a great way." --- Napoleon Hill

Feel free to contact if you want to study quantum computing with me: as a postdoc, or a graduate student. I also have funding for academic visitors.


Google Scholar, arXiv, Some talks, Full list of paper, the following is a list of preprints

  1. Worst-case Harrow-Hassidim-Lloyd algorithm with average-case correct quantum Fourier transform
    with Noah Linden
    to appear

  2. Lower bounds analysis of quantum-inspired classical algorithms and quantum query algorithms through communication complexity
    with Nikhil S. Mande
    to appear

  3. Quantum and query complexities of functions of matrices
    with Ashley Montanaro
    QIP 2024

  4. Testing quantum satisfiability
    with Ashley Montanaro, Dominic Verdon
    QIP 2024

  5. Quantum speedup of leverage score sampling and its application

  6. Quantum algorithms for spectral sums
    with Alessandro Luongo

Quantum and beyond