Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

The extreme points of the two-local three-qubit spectrahedron

Jiawei Jing

Published Nov 5, 2026• 0 citations
Publisher

Abstract

We classify the extreme points of the spectrahedron S of positive semidefinite 8x8 Hermitian matrices of fixed trace in the real span of the identity and the Pauli strings of weight at most two. The set S is dual to the joint numerical range of these 36 matrices, which is the set of two-body marginals of three-qubit states. We prove that every extreme point of S has rank two, three or four and that all three ranks occur. The proofs use an antiunitary spin flip whose square is -1 and the product vectors in the kernel. Rank two consists of a quaternionic class, diffeomorphic to HP^3, and three classes diffeomorphic to CP^3. The kernel of a rank-three extreme point contains a twisted cubic, a conic and a line, or a chain of three lines of product vectors. These strata have dimensions 13, 11 and 9, the last two with explicit extremality conditions, and each point is a combination of three two-qubit projectors with exactly one negative coefficient. Rank-four extreme points are open and dense in a smooth 20-dimensional manifold with four components, parametrised by the weight-one part and an isotropic subspace, and are generically chiral. The normal cones of the rank-three points cover a set of positive measure. Parts of the proofs are exact computer-algebra computations; the scripts are archived at https://doi.org/10.5281/zenodo.23982134. Generative AI tools were used in this work, as described in Section 6.

DOI
10.5281/zenodo.23982191

Related papers

Positive Partial Transpose States in Multipartite Quantum Systems

Øyvind Steensgaard Garberg

In this master thesis I study the extremal positive partial transpose (PPT) states of the three qubit $(2times2times2)$ system using numerical methods. Using two algorithms which locate PPT states of a specified rank and extremal PPT states respectively, I have located numerical examples of extremal PPT states with a variety of ranks. These numerical results confirm the analytical result that all PPT states of rank less than four are separable. I also derive an upper limit on the ranks of extremal PPT states. The extremal PPT states of lowest rank, the rank four states, were studied in more detail. These states were confirmed to be biseparable in accordance with both previous analytical and numerical results. The range and kernel of these states were examined for product vectors, but none were found. In an attempt to parametrize the SL$otimes$SL equivalence classes of these extremal rank four states I have studied an analytical method to construct such states based on unextendible product bases (UPBs). This method can be used to create PPT states from a single equivalence class where, by design, the kernel of all states contain a UPB and the range contains no product vectors. All states where the range is not spanned by a basis of product vectors are necessarily entangled. I also present a numerical method for creating extremal rank four states that are symmetric under various combinations of partial transposes. Numerical examination of these states reveal no product vectors in neither range nor kernel. The existence of rank four states with and without product vectors in their kernel implies the existence of at least two equivalence classes. To get a better impression of these equivalence classes I construct quantities that are invariant under SL$otimes$SL transformations and must therefore have the same value for all states in the same equivalence class. Calculating the values of these invariants for all the rank four extremal states I have generated gives a seemingly continuous range of values. This indicates that there is an infinite number of equivalence classes likely described by one or more continuous variables. The invariants also revealed an interesting set of states that may belong to a single equivalence class, where one invariant is zero and the others have identical values. This was the only equivalence class where more than one of my states were included. There is obviously something special about this class, but I do not know what it is.

66•Jan 1, 2012•1 citation

Optimal entanglement criteria from trace invariants

Bivas Mallick, Aabhas Gulati, Ion Nechita

Randomized measurement protocols give experimental access to low-degree polynomial invariants of a quantum state rather than to the state itself, which raises the question of what the best entanglement criterion is that can be built from finitely many such invariants. In this work we answer this question through convex duality. For each degree we introduce the cone of local unitary trace inequalities that are valid for separable bipartite states in all local dimensions, together with its one-matrix counterparts for Hermitian and positive semidefinite matrices. Each cone is the polar dual of a moment cone; we also determine the minimal combinatorial parametrization of the separable cone. The framework organizes the known moment criteria: the PPT criterion using the first three moments of the partial transposition is the image under an embedding of a Hankel determinant from the positive semidefinite cone to the bipartite cone, which we show to be an extremal ray, and we determine the first nontrivial separable cone completely, finding exactly four extremal rays. The framework allows us to analyze the realignment criterion and its centered (or enhanced) variant. We prove that the even singular value moments of the (centered) realignment matrix are trace invariants, associated with explicit fixed-point-free involutions. Extracting the optimal trace-norm bound from $m$ such moments thus becomes a dimension-free truncated moment problem, which we solve in closed form for $m = 2$ and relax to a semidefinite program of size $O(m)$ for arbitrary $m$. The dual solutions are polynomial minorants of $\sqrt{x}$ on $[0,1]$, and two explicit families, binomial and $L^1$-weighted, yield hierarchies of separability inequalities. Finally, we compare the criteria against one another and on PPT entangled states.

quant-pharXiv:2609.29471•Sep 25, 2026•1 citation

Quantum marginals, faces, and coatoms

Stephan Weis, João Gouveia

Many problems of quantum information theory rely on the set of quantum marginals. A precise knowledge of the faces of this convex set is necessary, for example, in the reconstruction of states from their marginals or in the evaluation of complexity measures of many-body systems. Yet, even the two-body marginals of just three qubits were only described in part. Here, we propose an experimental method to search for the coatoms in the lattice of exposed faces of the convex set of quantum marginals. The method is based on sampling from the extreme points of the dual spectrahedron. We provide an algebraic certificate of correctness, employing ground projectors of local Hamiltonians. Using this method, we present an explicit family of coatoms of rank five in the lattice of ground projectors of two-local three-qubit Hamiltonians (the rank is always six for bits). This family describes a family of coatoms in the lattice of exposed faces of the convex set of two-body marginals of three qubits. Besides introducing the experimental method, we show that the support sets of probability distributions that factor are the ground projectors of frustration-free Hamiltonians in the commutative setting. We also discuss nonexposed points of the set of marginals.

arXiv:2103.08360•Mar 15, 2021•1 citation

Extremal states of positive partial transpose in a system of three qubits

Øyvind Steensgaard Garberg, Børge Irgens, Jan Myrheim

We have studied mixed states in the system of three qubits with the property that all their partial transposes are positive; these are called PPT states. We classify a PPT state by the ranks of the state itself and its three single partial transposes. In random numerical searches, we find entangled PPT states with a large variety of rank combinations. For ranks equal to five or higher, we find both extremal and nonextremal PPT states of nearly every rank combination, with the restriction that the square sum of the four ranks of an extremal PPT state can be at most 193. We have studied especially the rank-four entangled PPT states, which are found to have rank four for every partial transpose. These states are all extremal because of the previously known result that every PPT state of rank three or less is separable. We find two distinct classes of rank-4444 entangled PPT states, identified by a real valued quadratic expression invariant under local $\text{SL}(2,\mathbb{C})$ transformations, mathematically equivalent to Lorentz transformations. This quadratic Lorentz invariant is nonzero for one class of states (type I in our terminology) and zero for the other class (type II). The previously known states based on unextendible product bases are a nongeneric subclass of the type-I states. We present analytical constructions of states of both types, general enough to reproduce all the rank-4444 PPT states we have found numerically. We can not exclude the possibility that there exist nongeneric rank-four PPT states that we do not find in our random numerical searches.

arXiv:1212.5036•Physical Review A•Mar 4, 2013•7 citations

Compatible-Marginal Spin Alignment for Three Qubits

Haoran Wang

The strong spin-alignment conjecture fails for three qubits when the subset states are chosen independently. We prove that it holds when they are marginals of one global state: for every three-qubit state, every positive semidefinite qubit operator Q, and every nonnegative set of subset weights, the aligned output majorizes the corresponding marginal mixture. The proof classifies the extreme rays of cones on which a fixed set of aligned eigenvalues is largest. This reduces arbitrary weights to two-term sums and the complete one- and two-body layers. For arbitrary numbers of subsystems, we also characterize when one unital quantum channel simultaneously realizes all marginal replacements. This criterion proves alignment for fully PPT states. A separate argument proves alignment for locally rotated stabilizer states in every prime local dimension, at maximally mixed background. These results determine the minimum output Rényi entropies of the associated three-qubit replacement channels. Under either of the two input restrictions above, they also determine the many-use classical capacity and the exact strong-converse exponent for correlated replacement channels of arbitrary size.

•Oct 9, 2026•0 citations

The Schmidt number of PPT states in 3 × 4 dimensions: partial results and the open case

Neko2333OWO

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.

•Nov 9, 2026•0 citations
We classify the extreme points of the spectrahedron S of positive semidefinite 8x8 Hermitian matrices of fixed trace in the real span of the identity and the Pauli strings of weight at most two. The set S is dual to the joint numerical range of these 36 matrices, which is the set of two-body marginals of three-qubit states. We prove that every extreme point of S has rank two, three or four and that all three ranks occur. The proofs use an antiunitary spin flip whose square is -1 and the product vectors in the kernel. Rank two consists of a quaternionic class, diffeomorphic to HP^3, and three classes diffeomorphic to CP^3. The kernel of a rank-three extreme point contains a twisted cubic, a conic and a line, or a chain of three lines of product vectors. These strata have dimensions 13, 11 and 9, the last two with explicit extremality conditions, and each point is a combination of three two-qubit projectors with exactly one negative coefficient. Rank-four extreme points are open and dense in a smooth 20-dimensional manifold with four components, parametrised by the weight-one part and an isotropic subspace, and are generically chiral. The normal cones of the rank-three points cover a set of positive measure. Parts of the proofs are exact computer-algebra computations; the scripts are archived at https://doi.org/10.5281/zenodo.23982134. Generative AI tools were used in this work, as described in Section 6.
In this master thesis I study the extremal positive partial transpose (PPT) states of the three qubit (2times2times2)(2times2times2)(2times2times2) system using numerical methods. Using two algorithms which locate PPT states of a specified rank and extremal PPT states respectively, I have located numerical examples of extremal PPT states with a variety of ranks. These numerical results confirm the analytical result that all PPT states of rank less than four are separable. I also derive an upper limit on the ranks of extremal PPT states. The extremal PPT states of lowest rank, the rank four states, were studied in more detail. These states were confirmed to be biseparable in accordance with both previous analytical and numerical results. The range and kernel of these states were examined for product vectors, but none were found. In an attempt to parametrize the SLotimesotimesotimesSL equivalence classes of these extremal rank four states I have studied an analytical method to construct such states based on unextendible product bases (UPBs). This method can be used to create PPT states from a single equivalence class where, by design, the kernel of all states contain a UPB and the range contains no product vectors. All states where the range is not spanned by a basis of product vectors are necessarily entangled. I also present a numerical method for creating extremal rank four states that are symmetric under various combinations of partial transposes. Numerical examination of these states reveal no product vectors in neither range nor kernel. The existence of rank four states with and without product vectors in their kernel implies the existence of at least two equivalence classes. To get a better impression of these equivalence classes I construct quantities that are invariant under SLotimesotimesotimesSL transformations and must therefore have the same value for all states in the same equivalence class. Calculating the values of these invariants for all the rank four extremal states I have generated gives a seemingly continuous range of values. This indicates that there is an infinite number of equivalence classes likely described by one or more continuous variables. The invariants also revealed an interesting set of states that may belong to a single equivalence class, where one invariant is zero and the others have identical values. This was the only equivalence class where more than one of my states were included. There is obviously something special about this class, but I do not know what it is.
Randomized measurement protocols give experimental access to low-degree polynomial invariants of a quantum state rather than to the state itself, which raises the question of what the best entanglement criterion is that can be built from finitely many such invariants. In this work we answer this question through convex duality. For each degree we introduce the cone of local unitary trace inequalities that are valid for separable bipartite states in all local dimensions, together with its one-matrix counterparts for Hermitian and positive semidefinite matrices. Each cone is the polar dual of a moment cone; we also determine the minimal combinatorial parametrization of the separable cone. The framework organizes the known moment criteria: the PPT criterion using the first three moments of the partial transposition is the image under an embedding of a Hankel determinant from the positive semidefinite cone to the bipartite cone, which we show to be an extremal ray, and we determine the first nontrivial separable cone completely, finding exactly four extremal rays. The framework allows us to analyze the realignment criterion and its centered (or enhanced) variant. We prove that the even singular value moments of the (centered) realignment matrix are trace invariants, associated with explicit fixed-point-free involutions. Extracting the optimal trace-norm bound from mmm such moments thus becomes a dimension-free truncated moment problem, which we solve in closed form for m=2m = 2m=2 and relax to a semidefinite program of size O(m)O(m)O(m) for arbitrary mmm. The dual solutions are polynomial minorants of x\sqrt{x}x​ on [0,1][0,1][0,1], and two explicit families, binomial and L1L^1L1-weighted, yield hierarchies of separability inequalities. Finally, we compare the criteria against one another and on PPT entangled states.
Many problems of quantum information theory rely on the set of quantum marginals. A precise knowledge of the faces of this convex set is necessary, for example, in the reconstruction of states from their marginals or in the evaluation of complexity measures of many-body systems. Yet, even the two-body marginals of just three qubits were only described in part. Here, we propose an experimental method to search for the coatoms in the lattice of exposed faces of the convex set of quantum marginals. The method is based on sampling from the extreme points of the dual spectrahedron. We provide an algebraic certificate of correctness, employing ground projectors of local Hamiltonians. Using this method, we present an explicit family of coatoms of rank five in the lattice of ground projectors of two-local three-qubit Hamiltonians (the rank is always six for bits). This family describes a family of coatoms in the lattice of exposed faces of the convex set of two-body marginals of three qubits. Besides introducing the experimental method, we show that the support sets of probability distributions that factor are the ground projectors of frustration-free Hamiltonians in the commutative setting. We also discuss nonexposed points of the set of marginals.
We have studied mixed states in the system of three qubits with the property that all their partial transposes are positive; these are called PPT states. We classify a PPT state by the ranks of the state itself and its three single partial transposes. In random numerical searches, we find entangled PPT states with a large variety of rank combinations. For ranks equal to five or higher, we find both extremal and nonextremal PPT states of nearly every rank combination, with the restriction that the square sum of the four ranks of an extremal PPT state can be at most 193. We have studied especially the rank-four entangled PPT states, which are found to have rank four for every partial transpose. These states are all extremal because of the previously known result that every PPT state of rank three or less is separable. We find two distinct classes of rank-4444 entangled PPT states, identified by a real valued quadratic expression invariant under local SL(2,C)\text{SL}(2,\mathbb{C})SL(2,C) transformations, mathematically equivalent to Lorentz transformations. This quadratic Lorentz invariant is nonzero for one class of states (type I in our terminology) and zero for the other class (type II). The previously known states based on unextendible product bases are a nongeneric subclass of the type-I states. We present analytical constructions of states of both types, general enough to reproduce all the rank-4444 PPT states we have found numerically. We can not exclude the possibility that there exist nongeneric rank-four PPT states that we do not find in our random numerical searches.
The strong spin-alignment conjecture fails for three qubits when the subset states are chosen independently. We prove that it holds when they are marginals of one global state: for every three-qubit state, every positive semidefinite qubit operator Q, and every nonnegative set of subset weights, the aligned output majorizes the corresponding marginal mixture. The proof classifies the extreme rays of cones on which a fixed set of aligned eigenvalues is largest. This reduces arbitrary weights to two-term sums and the complete one- and two-body layers. For arbitrary numbers of subsystems, we also characterize when one unital quantum channel simultaneously realizes all marginal replacements. This criterion proves alignment for fully PPT states. A separate argument proves alignment for locally rotated stabilizer states in every prime local dimension, at maximally mixed background. These results determine the minimum output Rényi entropies of the associated three-qubit replacement channels. Under either of the two input restrictions above, they also determine the many-use classical capacity and the exact strong-converse exponent for correlated replacement channels of arbitrary size.
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.