arXiv:2610.19905
On the structure of low-rank PPT entangled states violating Peres conjecture
Gurvir Singh, Manik Banik
Abstract
Bound-entangled states with positive partial transpose (PPT) can exhibit quantum steering and Bell nonlocality, disproving the long-standing Peres conjecture and its stronger steering counterpart. These counterexamples, obtained through explicit constructions or numerical searches, raise the question of whether they share a common structural origin. We address this question in the low-rank regime by asking whether known counterexamples can be obtained, up to invertible local filtering, from the complement of an unextendible product basis (UPB). We find that the answer depends crucially on the local dimension. In $3\otimes3$, the rank-four structure of PPT entangled states implies that both the steerable PPT state of Moroder \textit{et al.} and the Bell-nonlocal PPT state of Vértesi and Brunner can be obtained from UPB-complement states under invertible local filtering. For three qubits, in contrast, rank-four states that are PPT across every bipartition are separable across each cut. Moreover, comparison of the product-vector structure of the relevant kernels shows that the known three-qubit Bell-nonlocal PPT states cannot be obtained by invertible local filtering from the complement of any three-qubit UPB. Going beyond rank four, we further show that a known rank-eight three-qutrit state, supported on the complement of a UPB and PPT across every bipartition, is genuinely multipartite entangled. These results show that UPBs provide a unifying structural origin for important low-rank PPT entangled states in $3\otimes3$, but that nonlocal bound entanglement is not, in general, a UPB phenomenon.
AI Summary
The paper asks whether known low-rank PPT states exhibiting steering or Bell nonlocality can be obtained from orthogonal UPB-complement states by invertible local filtering. It compares the product-vector geometry of their kernels and ranges, which filtering preserves. For $3\otimes3$, an existing classification of rank-four PPT entangled states immediately places both the Moroder steering example and the Vértesi–Brunner Bell-nonlocal example in UPB-complement filtering families. The paper also identifies them as parameter choices of the same PPT-invariant family. For three qubits, the rank-four Vértesi–Brunner state instead has no fully product kernel vector, whereas every orthogonal UPB complement has exactly four product kernel rays. This excludes filtering equivalence. The kernel analysis uses an existing structural theorem and numerically evaluated reciprocal-vector concurrences. Low-rank PPT separability also implies that fully PPT three-qubit states of rank at most four are separable across every cut, despite the known example’s ordinary tripartite Bell violation. Beyond rank four, the paper proves that a known rank-eight, fully PPT three-qutrit UPB-complement state is genuinely multipartite entangled: all biseparable vectors in its support lie in a seven-dimensional subspace. It also bounds any hypothetical extremal fully PPT GME three-qubit example: all four ranks of the state and its single-party partial transposes must be at least five, with at least one equal to five or six. Filtering equivalence does not establish nonlocality of the unfiltered UPB projector. Three-qubit fully PPT GME existence and genuine multipartite steering or Bell nonlocality of the three-qutrit constructions remain unresolved.
OpenAI’s ChatGPT (GPT-5.6 Sol) was used as an assistive tool for discussions concerning the proof of genuine multipartite entanglement of the three-qutrit PPT state.
Error found: The introduction incorrectly says that rank-four cut separability forces the relevant three-qubit Bell counterexamples to higher rank, although ordinary tripartite Bell nonlocality is compatible with separability across every cut. The state-specific filtering exclusions are supported by reported numerical concurrences without explicit reciprocal vectors or numerical error bounds, limiting independent verification of the exact exclusions.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 12 pages. Comments are welcome!