13 citations · 13 across the 4 of their papers we have counts for
4 papers
Scalable Ground-State Certification of Quantum Spin Systems via Structured Noncommutative Polynomial Optimization
Jie Wang, David Jansen, Irénée Frerot +3
A fundamental challenge in quantum physics is determining the ground-state properties of many-body systems. Whereas standard variational approaches posit a wave-function ansatz and…
Certified bounds on optimization problems in quantum theory
Younes Naceur, Jie Wang, Victor Magron +1
Semidefinite relaxations of polynomial optimization have become a central tool for addressing the non-convex optimization problems over non-commutative operators that are ubiquitou…
Exploiting Term Sparsity in Symmetry-Adapted Basis for Polynomial Optimization
Igor Klep, Victor Magron, Tobias Metzlaff +1
Polynomial optimization problems are infinite-dimensional, nonconvex, NP-hard, and are often handled in practice with the moment-sums of squares hierarchy of semidefinite programmi…
Certifying ground-state properties of quantum many-body systems
Jie Wang, Jacopo Surace, Irénée Frérot +4
A ubiquitous problem in quantum physics is to understand the ground-state properties of many-body systems. Confronted with the fact that exact diagonalisation quickly becomes impos…