Free versus bound entanglement, a NP-hard problem tackled by machine learning

Abstract Entanglement detection in high dimensional systems is a NP-hard problem since it is lacking an efficient way. Given a bipartite quantum state of interest free entanglement can be detected efficiently by the PPT-criterion (Peres-Horodecki criterion), in contrast to detecting bound entangleme...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Beatrix C. Hiesmayr
Formato: article
Lenguaje:EN
Publicado: Nature Portfolio 2021
Materias:
R
Q
Acceso en línea:https://doaj.org/article/636ea1ea90104a98a623300f4d0a620a
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!