181 citations · 332 across the 25 of their papers we have counts for
3 papers · 1 filter
Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
Sander Gribling, David de Laat, Monique Laurent
In this paper we study bipartite quantum correlations using techniques from tracial noncommutative polynomial optimization. We construct a hierarchy of semidefinite programming low…
Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
Sander Gribling, David de Laat, Monique Laurent
We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of semidefinite programming lower bounds on matrix factorization ranks. In particul…
Quantum SDP-Solvers: Better upper and lower bounds
Joran van Apeldoorn, András Gilyén, Sander Gribling +1
Brandão and Svore very recently gave quantum algorithms for approximately solving semidefinite programs, which in some regimes are faster than the best-possible classical algorithm…