Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization

In this paper we study optimization problems related to bipartite quantum correlations using techniques from tracial noncommutative polynomial optimization. First we consider the problem of finding the minimal entanglement dimension of such correlations. We construct a hierarchy of semidefinite prog...

Descripción completa

Detalles Bibliográficos
Autores principales: Gribling, Sander, de Laat, David, Laurent, Monique
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer Berlin Heidelberg 2018
Materias:
Full Length Paper
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6435212/
https://www.ncbi.nlm.nih.gov/pubmed/30996477
http://dx.doi.org/10.1007/s10107-018-1287-z

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6435212/
https://www.ncbi.nlm.nih.gov/pubmed/30996477
http://dx.doi.org/10.1007/s10107-018-1287-z

Ejemplares similares