
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Published on
A hierarchy of semidefinite programming (SDP) relaxations approximates the global optimum of polynomial optimization problems of noncommuting variables. Typical applications include determining genuine multipartite entanglement, finding mutually unbiased bases, and solving groundstate energy problems. Generating the relaxations, however, is a computationally demanding task, and only problems of commuting variables have efficient generators. A closer look at the applications reveals sparse structures: either the monomial base can be reduced or the moment matrix has an inherent structure. Exploiting sparsity leads to scalable generation of relaxations, and the resulting SDP problem is also easier to solve. The current algorithm is able to generate relaxations of optimization problems of a hundred noncommuting variables and a quadratic number of constraints.
Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.
Be the first to comment