Combinatorial entanglement: detecting entanglement in quantum states using grid-labelled graphs

DOI10.1016/J.ENDM.2017.07.041zbMath1378.05177DBLPjournals/endm/LockhartGS17OpenAlexW2743773371WikidataQ58005529 ScholiaQ58005529MaRDI QIDQ1690020

Joshua Lockhart, Otfried Gühne, Simone Severini

Publication date: 18 January 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.07.041

zbMATH Keywords

quantum entanglementquantum physics

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Related Items (2)

Symmetric Laplacians, quantum density matrices and their von-Neumann entropy ⋮ Permutation symmetric hypergraph states and multipartite quantum entanglement

Cites Work

• The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
• Separability criterion and inseparable mixed states with positive partial transposition.
• Quantum entanglement
• Classical deterministic complexity of Edmonds' Problem and quantum entanglement
• Separability Criterion for Density Matrices
• Separability of \(n\)-particle mixed states: necessary and sufficient conditions in terms of linear maps

This page was built for publication: Combinatorial entanglement: detecting entanglement in quantum states using grid-labelled graphs