Chenghua Liu
Third-year PhD student · Advisors: Zhengfeng Ji and Mingsheng Ying
Institute of Software, Chinese Academy of Sciences
About
I received my B.Sc. in Computer Science and Technology, with a minor in Statistics, from Tsinghua University. My research interests included quantum computing, algorithms, and complexity.
Recently, my research focus has shifted to large language models, and I am currently conducting research at MiMo. I am interested in auto-research, interpretability, and—more importantly—safe self-improvement (beyond my current research).
Contact
Rising Sea
Repository- When Matchgate Base Collapse Fails: A Qutrit Trichotomy and Unbounded Exact WidthPreprint · PDF
- A Full Complexity Dichotomy for Complex-Valued Boolean Holant ProblemsPreprint · PDF
- A Dichotomy for Complex Boolean Holant with Binary DisequalityPreprint · arXiv
- Bounded Relative Boundary Implies Narrow DNF ApproximationPreprint · arXiv
- From Block Orthogonality to Decidability in Complex-Weighted Counting CSPPreprint · arXiv
More papers
- Optimal Covariance Inflation under Gaussian TiltsPreprint · arXiv
- Independent Set Discovery on Biclique-Free Graphs Is Fixed-Parameter TractablePreprint · PDF
- Lower Bounds for Domination-Type Problems Parameterized by Rank-WidthPreprint · arXiv
- A Correlation-Gap Bound for Nonlinear Gaussian PCAPreprint · arXiv
Publications (Ancient)
- Quantum Communication Lower Bounds for Search Problems via Matrix DiscrepancyPreprint · arXiv
- Ancilla-Free Fast-Forwarding Lindbladian Simulation Algorithms by Hamiltonian TwirlingPhysical Review Letters (accepted) · arXiv
- Accelerating Regression Tasks with Quantum AlgorithmsICML 2026 · arXiv
- Quantum Speedup for Hypergraph Sparsification
- Quantum Speedup for Sampling Random Spanning Trees
