We present the positive-partial-transpose (PPT) square conjecture introduced by M. Christandl Banff International Research Station Workshop: Operator Structures in Quantum Information Theory (Banff International Research Station, Alberta, 2012). We prove the conjecture in the case $n=3$ as a consequence of the fact that two-qutrit PPT states have Schmidt number of at most 2. The PPT square conjecture in the case of $n\ensuremath{\ge}4$ is still open. We present an example to support the conjecture for $n=4$.
We present the positive-partial-transpose (PPT) square conjecture introduced by M. Christandl Banff International Research Station Workshop: Operator Structures in Quantum Information Theory (Banff International Research Station, Alberta, 2012). We prove the conjecture in the case n=3 as a consequence of the fact that two-qutrit PPT states have Schmidt number of at most 2. The PPT square conjecture in the case of n\ensuremath≥4 is still open. We present an example to support the conjecture for n=4.
We present the positive-partial-transpose squared conjecture introduced by M. Christandl at Banff International Research Station Workshop: Operator Structures in Quantum Information Theory (Banff International Research Station, Alberta, 2012). We investigate the conjecture in higher dimensions and offer two novel approaches (decomposition and composition of quantum channels) and correspondingly, several schemes for finding counterexamples to this conjecture. One of the schemes involving the composition of PPT quantum channels in unsolved dimensions yields a potential counterexample.
Entanglement swapping is a fundamental operation in quantum repeaters for establishing entanglement between distant parties. The positive partial transpose (PPT) squared conjecture asks whether two PPT entangled links can generate terminal entanglement through entanglement swapping, or equivalently, whether the composition of two PPT maps is always entanglement breaking. Motivated by this conjecture, we investigate the map-composition problem beyond the PPT setting. For qutrit completely positive (CP) maps, we prove that the composition of any CP map whose Choi matrix is 1-undistillable with any CP map whose Choi matrix has Schmidt number at most two is entanglement breaking in either order. Moreover, we show that the cone of 1-undistillable CP maps is exactly the largest qutrit cone of CP maps whose composition with every CP map whose Choi matrix has Schmidt number at most two is entanglement breaking in both orders. Finally, although map composition captures only the standard maximally entangled outcome in entanglement swapping, we prove that any 1-undistillable two-qutrit state and any state of Schmidt number at most two cannot generate terminal entanglement under an arbitrary selective measurement on the intermediate systems.
Genuine high-dimensional entanglement, i.e., the property of having a high Schmidt number, constitutes an instrumental resource in quantum communication, overcoming limitations of low-dimensional systems. States with a positive partial transpose (PPT) are generally considered weakly entangled, as they can never be distilled into pure entangled states. This naturally raises the question of whether high Schmidt numbers are possible for PPT states. Volume estimates suggest that optimal, i.e., linear, scaling in the local dimension should be possible, albeit without providing insight into the possible slope. We provide the first explicit construction of a family of PPT states that achieves linear scaling in the local dimension and we prove that random PPT states typically share this feature. Our construction also allows us to prove a recent conjecture of Chen et al. on the existence of PPT states whose Schmidt number increases by an arbitrarily large amount upon partial transposition. Finally, we link the Schmidt number to entangled sub-block matrices of a quantum state. We use this connection to prove that quantum states that are either (i) invariant under partial transposition on the smallest of their two subsystems, or (ii) absolutely PPT cannot have a maximal Schmidt number. Overall, our findings shed new light on some fundamental problems in entanglement theory.
Status. Partial results only. The note studies, without answering it, the question of Yang, Leung and Tang (Linear Algebra Appl. 503 (2016), Question 3.9): is there an indecomposable 2-positive linear map M_3 → M_4? Dually: can a PPT state of a qutrit and a ququart (C^3 ⊗ C^4) have Schmidt number three? Proved. (1) A 2-block-positive operator on C^3 ⊗ C^4 that vanishes on one nonzero product vector is decomposable, so a witness for Schmidt number three among PPT states would have to be strictly positive on all product vectors. (2) For min(M,N) ≥ 2, the range of every PPT state on C^M ⊗ C^N is spanned by its vectors of Schmidt rank at most min(M,N) − 1; hence no range-only test that is valid for all positive operators can show full Schmidt number for a PPT state. (3) With a lemma of Chen, Yang and Tang: every non-extreme PPT state of birank (6,6) on C^3 ⊗ C^4, and every positive operator on C^3 ⊗ C^N of operator Schmidt rank at most seven, has a separable compression to a two-dimensional local subspace, hence Schmidt number at most two. (4) The maps proposed by C. A. Winda (J. Linear Topol. Algebra 14 (2025) 129–136) as indecomposable 2-positive maps M_3 → M_4 are not 2-positive. Open. A birank-(6,6) counterexample would have to be an extreme edge state with product-free kernels and operator Schmidt rank eight or nine. Numerically, every state tested (42 states covering all ten relevant birank classes) has a separable two-dimensional compression; the note describes where the proof attempts for birank (6,6) stopped. Files. ppt-3x4.pdf is the note. ppt-3x4-supplement.zip contains the statements, proofs and blind reviews of the results as written, the exact computation for the Winda maps, the numerical data and scripts (including exact rational birank-(6,6) edge states with separable compressions), the record of failed proof routes, and the unreviewed working files. "python check.py" (NumPy and SymPy) verifies the hashes and repeats the exact and numerical checks (a few seconds on the laptop used to assemble the archive). The written proofs have not yet been verified line by line by a human reviewer. AI tools. The author chose the question and the statements to attack, set the working rules (blind review of every result by the other model family; fixed stopping rules), had the published Winda maps checked and supplied the paper for that, decided when to stop, and is responsible for the content. The research was carried out on 4–5 November 2026 by an AI research system built on Claude Opus 5.5 (Anthropic) and GPT-6 Astra (OpenAI); the text was revised on 9 November 2026. Each proof was written by one of the two models and accepted by a blind review from the other; the Winda computation was done by both independently; Claude Opus 5.5 drafted the manuscript and GPT-6 Astra reviewed it blind. Section IX of the note has the details.
We prove the existence of bound entangled states with negative partial transpose (NPT) in any d × d(d ≥ 3) Hilbert space with a simple assumption on Schmidt rank two states. Obviously they belong to the class of conjectured to be bound entangled states by Divincenzo et.al [Phys. Rev. A, 61, 062312(2000)] and by Dür et.al [Phys. Rev. A, 61, 062313(2000)]. PACS number(s): 03.67.Hk, 03.65.Ud. The basic issue on the classification of mixed state entanglement at least on the level of bipartite systems solely depends upon whether there exist bound entangled states or not. The existence of PPT-bound (PPT means positive partial transpose) entangled states [1] and also the existence of NPT N−copy undistillable states [2, 3] for every positive integer N naturally indicates there may exist NPT-bound entangled states. In this work we are able to show the existence of NPT-bound entangled states with a simple assumption on Schmidt rank two states. We first briefly describe the issue and the importance of the problem. In recent years it is found that quantum entanglement is an useful resource in performing several tasks in quantum information theory and quantum communication [4]. Maximally entangled states shared between two parties are essential ingredients in this respect [5]. Now due to the interaction with environment, states are in practice found to be mixed. However there is a process called distillation by which we can distill sometimes maximally entangled
Entangled states with a positive partial transpose (so-called PPT states) are central to many interesting problems in quantum theory. On the one hand, they are considered to be weakly entangled, since no pure state entanglement can be distilled from them. On the other hand, it has been shown recently that some of these PPT states exhibit genuinely high-dimensional entanglement, i.e., they have a high Schmidt number. Here we investigate the ($d\ifmmode\times\else\texttimes\fi{}d$)-dimensional PPT states for $d\ensuremath{\ge}4$ discussed recently by E. Sindici and M. Piani [Phys. Rev. A 97, 032319 (2018)]. By generalizing their methods to the calculation of Schmidt numbers, we show that a linear d/2 scaling of its Schmidt number in the local dimension d can be attained.