Provable algorithms for inference, optimization, and quantum computation.
Research
Three core areas
Structured inference
Bethe methods, graph covers, and message passing for counting and inference.
Provable optimization
Permanent bounds and guarantees for hard combinatorial problems.
Quantum & tensors
Tensor networks and distributed quantum systems for scalable computation.
Selected work
Representative papers
Graphical models and Bethe methods
Graph covers and Bethe approximation for inference and counting — our longest-running thread.
Latest
What's new
May 2026
Joining HKUST (GZ) as Assistant Professor
DSA Thrust, Information Hub
Mar 2026
Submitted to Quantum
Jul 2025
Submitted to IEEE TIT
2024
Published in IEEE TIT
Join the group
Building a team at HKUST (Guangzhou) starting May 2026.
Full tuition and competitive stipend
Mentorship targeting IEEE TIT, ISIT, ICML
Greater Bay Area research ecosystem
Small group, close advising
RAMPhilPhDPostdoc