17 citations · 30 across the 4 of their papers we have counts for
4 papers
A Sparse Flat Extension Theorem for Moment Matrices
Monique Laurent, Bernard Mourrain
In this note we prove a generalization of the flat extension theorem of Curto and Fialkow for truncated moment matrices. It applies to moment matrices indexed by an arbitrary set o…
A prolongation-projection algorithm for computing the finite real variety of an ideal
J. B. Lasserre, M. Laurent, P. Rostalski
We provide a real algebraic symbolic-numeric algorithm for computing the real variety of an ideal , assuming it is finite while may not be. Our approach uses s…
Block-diagonal semidefinite programming hierarchies for 0/1 programming
N. Gvozdenovic, M. Laurent, F. Vallentin
Lovasz and Schrijver, and later Lasserre, proposed hierarchies of semidefinite programming relaxations for general 0/1 linear programming problems. In this paper these two construc…
New Limits on Fault-Tolerant Quantum Computation
Harry Buhrman, Richard Cleve, Monique Laurent +3
We show that quantum circuits cannot be made fault-tolerant against a depolarizing noise level of approximately 45%, thereby improving on a previous bound of 50% (due to Razborov).…