Semidefinite programming relaxations for quantum correlations

Connected to paperThis paper is a preprint and has not been certified by peer review

Semidefinite programming relaxations for quantum correlations


Armin Tavakoli, Alejandro Pozas-Kerstjens, Peter Brown, Mateus Araújo


Semidefinite programs are convex optimisation problems involving a linear objective function and a domain of positive semidefinite matrices. Over the last two decades, they have become an indispensable tool in quantum information science. Many otherwise intractable fundamental and applied problems can be successfully approached by means of relaxation to a semidefinite program. Here, we review such methodology in the context of quantum correlations. We discuss how the core idea of semidefinite relaxations can be adapted for a variety of research topics in quantum correlations, including nonlocality, quantum communication, quantum networks, entanglement, and quantum cryptography.

Follow Us on


Add comment