The bulk spectral gap is RE-complete: certifiable from above, uncomputable from below
What can algorithms tell us about spectral gaps in quantum many-body systems? We construct certified upper bounds and show why no general algorithm can compute them from below.
Selected talks: GdR TeQ 2027 JIQ 2026
- Quantum Many-Body Physics
- Noncommutative Polynomial Optimization
- Operator Algebras
Beyond qubits: fermionic nonlocality in distributed quantum computing
Can fermions do more than qubits in distributed computation? Yes—we show that their correlations cannot be reproduced by any qubit- or boson-based protocol without additional communication.
Research seminars: Nanjing University Quantum Science Center (Greater Bay Area)
- Quantum Foundations
- Quantum Nonlocality
Quantitative quantum soundness for compiled nonlocal games and the sequential NPA hierarchy for completely positive maps
Can cryptography replace spatial separation in tests of quantum correlations? We use a hierarchy for sequential quantum strategies to obtain quantitative bounds for multipartite compiled nonlocal games.
Selected talks: QIP 2026 QCrypt 2026 SIAM OP26
- Quantum Cryptography
- Quantum Foundations
- Noncommutative Polynomial Optimization
- Operator Algebras
Characterizing quantum bilocal networks with generalized NPA hierarchies
Which quantum correlations can two independent sources produce? We use operator algebras to characterize the limits of semidefinite hierarchies for the simplest quantum network.
Selected talks: CausalWorlds 2024 Defi EQIP 2023
- Quantum Nonlocality
- Operator Algebras
- Noncommutative Polynomial Optimization
Service and community
Research project coordination, seminar and workshop organization, peer review, and conference participation.
- Conferences
- Research Community