Chenghua Liu

Fourth-year PhD student · Advisors: Zhengfeng Ji and Mingsheng Ying
Institute of Software, Chinese Academy of Sciences

Email

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, post-training, and—more importantly—safe self-improvement (beyond my current research).

Works & Days

  1. MiMo-V2.6
    Core contributor · Website · Technical report
  2. PinkArc Ongoing development
    Contributors: Boning Meng, Minbo Gao.
    A harness for autonomous theoretical research. Powers all Rising Sea papers below.
    Design
    Minimal by design, PinkArc encourages cross-domain thinking beyond familiar frameworks. Database-backed memory organizes research, while lightweight orchestration reduces token overhead.
  3. PinkFold Ongoing development
    A minimal harness for fast autoformalization in Lean through multi-model collaboration, currently in development.
  4. PinkYak Early experiments
    A harness for distilling AI-generated mathematics into clear, elegant proofs.
    Design
    PinkYak repeatedly examines, simplifies, and reconstructs arguments to uncover their core ideas and find proofs that help human readers understand why a result holds.
  5. CountingLib
    A Lean library for counting complexity, unifying reusable foundations, verified algorithms, and classification theorems across counting models. Website
    Counting Problems for Babies — A picture-book introduction to counting complexity.
More work
  1. Flow-Matched Motion Priors: Online Optimal-Transport Rewards for Imitation Learning
    Yilin Zou, Chenghua Liu, Chenglong Wu, and Fanghua Jiang. C
    Preprint · arXiv

Rising Sea

Repository
  1. A Simplified Proof of PARITY ∉ QAC0
    Minbo Gao, Zhengfeng Ji, and Chenghua Liu. A
    Preprint · ECCC
  2. A Simplified Proof of the FPRAS for Counting Perfect Matchings
    Chenghua Liu and Boning Meng. A
    Preprint · arXiv
  3. Simultaneously Query-Optimal Quantum Linear-System Algorithm
    Minbo Gao, Zhengfeng Ji, and Chenghua Liu. A
    Preprint · arXiv · Lean
  4. A Dichotomy for Planar Graph Homomorphisms with Nonnegative Weights
    Chenghua Liu and Boning Meng. A
    Preprint · arXiv · Lean · PDF (draft)
  5. A Generalized Stein Lemma for Quantum Channels
    Minbo Gao, Zhengfeng Ji, and Chenghua Liu. A
    Preprint · arXiv · Lean · PDF
  6. Quantum Channel Stein’s Lemma with an Exponential Strong Converse
    Minbo Gao, Zhengfeng Ji, and Chenghua Liu. A
    Preprint · arXiv · Lean · PDF
  7. Quantum Behaviors Are Not Semialgebraic
    Minbo Gao, Zhengfeng Ji, and Chenghua Liu. A
    Preprint · arXiv · Lean
  8. Hidden Circuits and Exact Counting in Ordered Graphs
    Chenghua Liu and Boning Meng. A
    Preprint · arXiv · Lean
  9. When Matchgate Base Collapse Fails: A Qutrit Trichotomy and Unbounded Exact Width
    Chenghua Liu and Boning Meng. A
    Preprint · arXiv · Lean · PDF
  10. A Full Complexity Dichotomy for Complex-Valued Boolean Holant Problems
    Chenghua Liu, Boning Meng, and Juqiu Wang. A
    Preprint · arXiv · Lean · PDF · Comic
  11. A Dichotomy for Complex Boolean Holant with Binary Disequality
    Chenghua Liu and Boning Meng. A
    Preprint · arXiv · Lean
  12. Bounded Relative Boundary Implies Narrow DNF Approximation
    Chenghua Liu and Boning Meng. A
    Preprint · arXiv · Lean
  13. From Block Orthogonality to Decidability in Complex-Weighted Counting CSP
    Chenghua Liu and Boning Meng. A
    Preprint · arXiv · Lean
More papers
  1. Approximating Combinatorial Contracts with Arbitrary Costs
    Xiaotie Deng, Hanyu Li, and Chenghua Liu. A
    SOSA 2027 · arXiv · Lean
  2. Cardinality-Constrained Randomized Assortments with Balanced Market Share
    Xiaotie Deng, Hanyu Li, and Chenghua Liu. A
    Preprint · arXiv · Lean
  3. Exact Hill Shares Are Simultaneous Guarantees
    Bo Li, Hanyu Li, and Chenghua Liu. A
    Preprint · arXiv · Lean
  4. Optimal Covariance Inflation under Gaussian Tilts
    Minbo Gao, Zhengfeng Ji, and Chenghua Liu. A
    Preprint · arXiv · Lean
  5. Independent Set Discovery on Biclique-Free Graphs Is Fixed-Parameter Tractable
    Chenghua Liu and Boning Meng. A
    Preprint · arXiv · Lean · PDF
  6. Lower Bounds for Domination-Type Problems Parameterized by Rank-Width
    Chenghua Liu and Boning Meng. A
    Preprint · arXiv · Lean
  7. A Correlation-Gap Bound for Nonlinear Gaussian PCA
    Minbo Gao, Zhengfeng Ji, and Chenghua Liu. A
    Preprint · arXiv · Lean

Publications (Ancient)

  1. Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy
    Minbo Gao, Chenghua Liu, Guangxu Yang, and Tianyi Zhang. A
    SODA 2027 · arXiv
  2. Lévy-Khintchine Structure Enables Fast-Forwardable Lindbladian Simulation
    Minbo Gao, Zhengfeng Ji, and Chenghua Liu. A
    Physical Review Letters · APS · arXiv
  3. Quantum Speedups for Log-Concave Sampling from Local Structure
    Chenghua Liu, Qisheng Wang, and Zhengfeng Ji. C
    🪦 NeurIPS 2026 casualty (R.I.P.) · arXiv
  4. Quantum Composite Hypothesis Testing with Small Error
    Chenghua Liu and Qisheng Wang. C
    NeurIPS 2026 (to appear)
  5. Accelerating Regression Tasks with Quantum Algorithms
    Chenghua Liu and Zhengfeng Ji. C
    ICML 2026 · arXiv
  6. Quantum Speedup for Hypergraph Sparsification
    Chenghua Liu, Minbo Gao, Zhengfeng Ji, and Mingsheng Ying. C
    ICML 2025 · arXiv · Poster
  7. Quantum Speedup for Sampling Random Spanning Trees
    Simon Apers, Minbo Gao, Zhengfeng Ji, and Chenghua Liu. A
    ICALP 2025 · arXiv · Poster · Lecture