Can entanglement hide behind triangle-free graphs?

TL;DR

This paper introduces a graph-theoretic approach to detect entanglement in bipartite quantum states using triangle-free graphs, providing new criteria and constructions for entangled states with positive partial transpose.

Contribution

It presents a novel method linking entanglement detection to triangle-free graph properties and offers a way to construct PPT entangled states in various dimensions.

Findings

Characterizes triangle-free graphs enabling entanglement detection.

Develops a recipe for constructing PPT entangled states.

Links entanglement detection to finding triangle-free subgraphs.

Abstract

We present an alternative approach to unveil a different kind of entanglement in bipartite quantum states whose diagonal zero patterns in suitable matrix representations admit a nice description in terms of triangle-free graphs. Upon application of a local averaging operation, the separability of such states transforms into a simple matrix positivity condition, the violation of which implies the presence of entanglement. We completely characterize the class of triangle-free graphs which allows for nontrivial entanglement detection using the above test. Moreover, we develop a recipe to construct a plethora of unique classes of positive partial transpose (PPT) entangled triangle-free states in arbitrary dimensions. Finally, we link the task of entanglement detection in general states to the well-known graph-theoretic problem of finding triangle-free-induced subgraphs in a given graph.