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.
The bulk spectral gap is certifiable from above but uncomputable from below
Talks and posters 2026-11 4th Colloquium GdR TeQ 2026-11 Journées Informatique Quantique (JIQ) 2026-08 CQCC & GQSF 2026 (poster) 2026-06 SIAM Conference on Optimization (OP26) (by …
Xiangling Xu
•
Two convergent NPA-like hierarchies for the quantum bilocal scenario
Talks and posters 2024-11 YQIS24 (poster) 2024-11 2nd Colloquium GdR TeQ (poster) 2024-09 CausalWorlds 2024 2023-11 Defi EQIP Workshop
Marc-Olivier Renou
•
Quantitative quantum soundness for all multipartite compiled nonlocal games
Talks and posters 2026-08 QCrypt 2026 2026-08 CQCC & GQSF 2026 (poster) 2026-06 SIAM Conference on Optimization (OP26) 2026-01 QIP 2026 2025-11 3rd Colloquium GdR TeQ 2025-10 …
Matilde Baroni
•
Quantitative Quantum Soundness for Bipartite Compiled Bell Games via the Sequential NPA Hierarchy
Talks and posters 2026-06 SIAM Conference on Optimization (OP26) 2026-01 QIP 2026 2025-11 3rd Colloquium GdR TeQ 2025-07 IWOTA 2025 2025-06 IQC–PCQT–Quantum Saclay Workshop
Igor Klep
•
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 …
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.
