Publications

Preprints

• Semidefinite programming formulations for the completely bounded norm of a tensor (with Monique Laurent), PDF. (Accepted as part of a talk to QIP'19)
• Convex optimization using quantum oracles (with Joran van Apeldoorn, Andras Gilyen & Ronald de Wolf), PDF. (Accepted to QIP'19)
• Simon's problem for linear functions (with Joran van Apeldoorn), PDF.
• Quantum SDP-Solvers: Better upper and lower bounds (with Joran van Apeldoorn, Andras Gilyen & Ronald de Wolf), PDF. (Accepted to FOCS'17, conference version)

Publications:

• Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (with David de Laat & Monique Laurent), PDF & code.
  • Foundations of Computational Mathematics, available online since Jan 2019.
• Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization (with David de Laat & Monique Laurent),
  • Mathematical Programming Series B (2018), 38 pages, https://doi.org/10.1007/s10107-018-1287-z, PDF.
• Matrices with high completely positive semidefinite rank (with David de Laat & Monique Laurent)
  • Linear Algebra and Its Applications, 513, 122-148 (2017), 27 pages, PDF.

Theses:

• Applications of optimization to factorization ranks and quantum information theory. PhD thesis (2019). Advisors: Monique Laurent & Ronald de Wolf.
• A local search approach to resolving capacity issues in mobile cellular networks. Master thesis (2015). Advisors: Karen Aardal, Dion Gijswijt, Tanneke Ouboter, Hans van den Berg.
• The ellipsoid method and an application to the Lovász-theta-function. Bachelor thesis (2013). Advisor: Frank Vallentin.