Two-Qutrit entanglement: 56-years old algorithm challenges machine learning

Understand

Classifying states as entangled or separable is a highly challenging task, while it is also one of the foundations of quantum information processing theory.

• This task is higly nontrivial even for relatively simple cases, such as two-qutrit Bell-diagonal states, i.e., mixture of nine mutually orthogonal maximally entangled states.
• In this article we apply the Gilbert algorithm to revise previously obtained results for this class.
• In particular we use ``cartography of entanglement'' to argue that most states left in [Hiesmayr, B.