Sharp rank thresholds and cubic support in PPT extensions of completely symmetric states

For completely symmetric states on $d\ge3$ parties of actual local rank $N\ge3$, the least rank of an entangled state passing any prescribed finite positive level of the PPT extension hierarchy is $3d+N-3$. At equality, the two- and three-party marginals recover a ternary plane cubic shared by every extension. On this cubic the hierarchy becomes exact at a finite level precisely when every singularity outside the zero locus of the contraction quadratic is a split real node. We give the first exact level or an exact feasibility test for it, independent of $d$. On a smooth cubic the thresholds along the specified paths to the square of a flex tangent reduce to elliptic division and have unique rank-two Gram matrices. On reflection-invariant paths we obtain a quartic formula and the leading asymptotic constant. The least rank for entanglement itself is $3d+N-5$, and we classify equality. An explicit rational rank-nine three-qutrit state on a smooth cubic passes the first extension level and fails the second.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-18
DOI
https://doi.org/10.48550/arxiv.2611.24500
Primary Topic
Quantum Information and Cryptography
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Sharp rank thresholds and cubic support in PPT extensions of completely symmetric states

Teng Zhang, Qian Lilong
arXiv (Cornell University)
Quantum Information and Cryptography
preprint

Sharp rank thresholds and cubic support in PPT extensions of completely symmetric states

Teng Zhang, Qian Lilong
preprint en

Abstract

For completely symmetric states on $d\ge3$ parties of actual local rank $N\ge3$, the least rank of an entangled state passing any prescribed finite positive level of the PPT extension hierarchy is $3d+N-3$. At equality, the two- and three-party marginals recover a ternary plane cubic shared by every extension. On this cubic the hierarchy becomes exact at a finite level precisely when every singularity outside the zero locus of the contraction quadratic is a split real node. We give the first exact level or an exact feasibility test for it, independent of $d$. On a smooth cubic the thresholds along the specified paths to the square of a flex tangent reduce to elliptic division and have unique rank-two Gram matrices. On reflection-invariant paths we obtain a quartic formula and the leading asymptotic constant. The least rank for entanglement itself is $3d+N-5$, and we classify equality. An explicit rational rank-nine three-qutrit state on a smooth cubic passes the first extension level and fails the second.

arXiv (Cornell University)
Quantum Information and Cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon