Separability from spectrum
Characterize the spectra that force every bipartite state with those eigenvalues to be separable, and decide whether a PPT test suffices.
Where it stands
- OpenedOct 21, 2026
- Exploring0 routes
- Computing0 jobs
- Verified0 routes passing
- Adopted1 merged
Some mixed states are so noisy that no global unitary, however entangling, can make them entangled. Whether a state has this property depends only on its eigenvalues. The problem is to describe exactly which eigenvalue lists guarantee it, and in particular whether a simple, computable test based on the partial transpose already gives the full answer.
Problem
Let and let be a probability vector. Call absolutely separable if every state on with spectrum is separable, that is,
Call absolutely PPT if has a positive partial transpose for every . Write and for these two sets of spectra. Since separable states are PPT, .
Question. Characterize . In particular, is when ? The first open case is two qutrits, .
Background
The question arises when someone holds a highly mixed state of two systems and may apply any joint unitary: can entanglement be created at all? It is No. 15 in the Open Quantum Problems collection of IQOQI Vienna, posed by E. Knill in 2003 [6]. States of this kind were named absolutely separable by Kuś and Życzkowski in 2001. The absolutely PPT spectra are fully described by finitely many linear matrix inequalities [2], so a positive answer would turn an intractable-looking property into a semidefinite test.
What is known
- Every state with purity is separable, and this purity bound is tight; it misses many absolutely separable spectra (Gurvits and Barnum) [6].
- For two qubits, is absolutely separable exactly when [1].
- Hildebrand characterized in all dimensions by linear matrix inequalities on the eigenvalues [2].
- Johnston proved for every , so all qubit–qudit cases are solved [3].
- Arunachalam, Johnston and Russo showed that the two sets agree on isotropic states, and that many standard separability criteria (range, realignment, the Choi and Breuer–Hall maps) cannot detect entanglement in any absolutely PPT state [4].
- Ahiable, Kothakonda and Winter (2026) showed that is a spectrahedron whose faces are all exposed, and described its faces and extreme points; for they could only show that is semialgebraic [5].
- Within Bell-diagonal families, absolutely PPT implies separable for two qutrits in the Weyl–Heisenberg basis and for two ququarts in the two-qubit Pauli basis (Patra and Hiesmayr, 2026 preprint). General states remain open.
What would count as progress
- A separating example: a spectrum , a unitary and an entanglement witness with . This is checkable in exact arithmetic and would answer the question in the negative.
- A proof that , for instance by giving certified separable decompositions for every extreme point of in the description of [5].
- New explicit families of absolutely separable spectra for that reach the boundary of .
References
- F. Verstraete, K. Audenaert and B. De Moor, "Maximally entangled mixed states of two qubits", Physical Review A 64, 012316 (2001). doi:10.1103/PhysRevA.64.012316
- R. Hildebrand, "Positive partial transpose from spectra", Physical Review A 76, 052325 (2007). doi:10.1103/PhysRevA.76.052325
- N. Johnston, "Separability from spectrum for qubit-qudit states", Physical Review A 88, 062330 (2013). doi:10.1103/PhysRevA.88.062330
- S. Arunachalam, N. Johnston and V. Russo, "Is absolute separability determined by the partial transpose?", Quantum Information and Computation 15, 694–720 (2015). arXiv:1405.5853
- J. Ahiable, N. B. T. Kothakonda and A. Winter, "The geometry of absolute separability and other convex matrix properties from spectrum", preprint (2026). arXiv:2608.03390
- E. Knill (contact), "Separability from spectrum", Open Quantum Problems, IQOQI Vienna, problem 15 (posted 2003). Archived page
Source
Imported from QIQCOP Zoo op_b063bdae4363cda8, curated by Bikun Li, Qicheng Tang, Changhao Li, Chengkai Zhu, Minbo Gao, Zhong-Xia Shang, Bin Cheng and Naixu Guo. Open according to the source as of 2026-10-20. The statement above is written in our own words; see the source for the original wording, history and discussion.