Moment-based PPT criteria for random bipartite states

C\'ecilia Lancien; Kieran McShane

Moment-based PPT criteria for random bipartite states

T0 review · 2 major / 1 minor · reviewed 2026-07-14 · grok-4.5

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Random bipartite mixed states switch from violating to satisfying each fixed moment-based PPT criterion at an environment size proportional to d².

desk verdict Clean typicality thresholds for each level of the moment-PPT hierarchy on random induced states; tools look standard and the claim is well-scoped, but we only have the abstract. read the letter →

arxiv 2607.11369 v1 pith:RGB57NLO submitted 2026-07-13 quant-ph math-phmath.COmath.FAmath.MPmath.PR

Cécilia Lancien , Kieran McShane This is my paper · ORCID

classification quant-phmath-phmath.COmath.FAmath.MPmath.PR

keywords moment-basedPPTcriteriarandombipartitestatesentanglementdetectionpartialtransposeconcentrationofmeasureHankeldeterminantsinducedmeasureshigh-dimensionalquantumsystems

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper studies how well a hierarchy of experimentally accessible moment-based relaxations of the positive partial transpose (PPT) criterion detects entanglement in high-dimensional random bipartite mixed states. Those states are obtained by taking a Haar-random pure state on C^d ⊗ C^d ⊗ C^s and tracing out the environment of dimension s. For every fixed level m of the hierarchy, the authors identify a sharp threshold of the form s = λ_m d² that separates two asymptotic regimes: when the environment is smaller than this threshold the random state generically violates the m-th moment criterion (hence is detected as entangled), while above the threshold it generically satisfies the criterion, with the probability of either outcome tending to 1 as the local dimension d tends to infinity. The result therefore maps, level by level, the typical detection power of these moment tests on large random states.

What carries the argument

Permutation-combinatorial evaluation of the expected moments of the partially transposed random state, combined with concentration-of-measure tail bounds and Hankel-determinant asymptotics obtained from orthogonal polynomials; together these locate the sharp threshold λ_m for every fixed m.

What would settle it

Compute or sample the m-th moment Hankel determinant for many random induced states at environment sizes both slightly below and slightly above a candidate λ_m d² for large d; if the probability of violation does not jump from near 1 to near 0 across that point, the claimed threshold is false.

Watch

Extended reading notes

Core claim

For each fixed integer m, random bipartite mixed states on C^d ⊗ C^d induced by Haar-random pure states on an environment of dimension s switch, with probability tending to 1 as d o ∞, from generically violating the m-th moment-based PPT criterion to generically satisfying it once s crosses the threshold λ_m d².

Load-bearing premise

The combination of combinatorial moment averages, concentration bounds and Hankel asymptotics is tight enough to produce a sharp threshold λ_m rather than only coarse bounds when the local dimension grows large.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

The one thing to know is that they pin down, for each fixed level m of the recent moment-based PPT hierarchy, an environment-size threshold s = λ_m d² at which Haar-induced random states on C^d ⊗ C^d switch from generically violating the criterion to generically satisfying it, with probability →1 as d→∞. That threshold map is the actual new result.

What they do well is stay inside a standard toolkit that has already produced sharp thresholds for PPT itself and for realignment: permutation combinatorics for the average moments of the partial transpose, concentration to control deviations, and Hankel-determinant evaluation via orthogonal polynomials to turn those moments into the criterion. The abstract states the claim with the right asymptotic form and does not appear to force the answer by circular normalization. Circularity burden looks low.

Soft spot is simply that we have only the abstract. We cannot check whether the moment averages plus concentration are tight enough to locate a genuine sharp λ_m rather than coarse bounds, nor see the explicit constants or error rates. That tightness is a real technical requirement for the strongest claim, but the same methods have succeeded on related ensembles, so it is not an obvious red flag—just an unverified one. No load-bearing contradiction is visible from what is written.

This is for people who already care about entanglement detection hierarchies and typicality of random mixed states. A reader who works on asymptotic quantum information or on experimentally accessible criteria will get a concrete map of where each level of the hierarchy sits relative to the PPT threshold. It is not a broad reshaping of the field, but it is a solid, usable contribution inside its niche.

I would send it to a serious referee. The question is well-posed, the tools are appropriate, and the result is the kind of threshold statement the community actually uses. Even if the proofs need polishing on the concentration rates, that is referee work, not desk-reject material.

Referee Report

2 major / 1 minor

Summary. The manuscript studies the typical performance of the recently introduced hierarchy of moment-based positive partial transpose (PPT) criteria on high-dimensional random bipartite mixed states. Concretely, for states on C^d ⊗ C^d induced as the partial trace of a Haar-random pure state on C^d ⊗ C^d ⊗ C^s, the authors claim that for each fixed level m of the hierarchy there exists a threshold environment dimension s = λ_m d² at which the random state switches from generically violating the m-th moment-PPT criterion to generically satisfying it, with probability tending to 1 as d → ∞. The stated proof strategy combines permutation combinatorics to estimate averages of moments of partially transposed random states, concentration-of-measure bounds on deviations from those averages, and Hankel-determinant evaluation via orthogonal polynomials.

Significance. If the claimed thresholds λ_m are correctly derived and sharp, the work would give a precise asymptotic map of the detection power of each fixed level of the moment-PPT hierarchy for the standard induced ensemble of random bipartite mixed states. That is a natural and useful complement to existing sharp-threshold results for the full PPT criterion and related entanglement witnesses in high dimension. The ingredients listed (permutation averages, concentration, Hankel/orthogonal polynomials) are standard and appropriate for this class of problems; a successful execution would therefore constitute a solid contribution to the asymptotic theory of entanglement criteria rather than a purely formal exercise.

major comments (2)

[Abstract (proof strategy paragraph)] Only the abstract is available for this review, so the explicit combinatorial moment averages, the concentration rates, the construction of the constants λ_m, and the Hankel/orthogonal-polynomial evaluations cannot be checked. The central claim of a sharp threshold (rather than merely coarse bounds) for every fixed m is load-bearing; its validity rests on those estimates being sufficiently tight. A full technical assessment is therefore impossible from the abstract alone.
[Abstract (threshold claim)] The abstract asserts the existence of a threshold s = λ_m d² at which the switch occurs with probability → 1. Without the body of the paper it is unclear whether λ_m is given by an explicit closed-form expression, by the root of a concrete equation involving orthogonal polynomials, or only by an existence argument. The sharpness and reproducibility of the threshold depend on this point and must be verified in the full text.

minor comments (1)

[Abstract] The abstract is clear and well-scoped. Once the full manuscript is available, standard presentation checks (notation for the moment matrices, explicit definition of the hierarchy level m, and comparison with known PPT thresholds) will be needed, but no presentation defects are visible from the abstract itself.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: abstract-only review shows thresholds derived from standard random-matrix tools against an external hierarchy, not by construction or fitted inputs.

full rationale

Only the abstract is available. It states that for each fixed level m of a recently introduced moment-based PPT hierarchy, random induced bipartite states on C^d ⊗ C^d switch from generically violating to generically satisfying the m-th criterion at a threshold environment size s = λ_m d², with probability o 1 as d o ∞. The claimed derivation uses (i) permutation combinatorics to estimate average moments of partially transposed random states, (ii) concentration of measure for large-d deviation bounds, and (iii) Hankel-determinant evaluation via orthogonal polynomials. These are standard, externally falsifiable techniques for the Haar-induced ensemble; none of them encodes the threshold by definition, fits a free parameter to the target switch point, or imports a uniqueness theorem from the authors. The hierarchy itself is treated as an external object of study rather than redefined to force the result. Self-citation risk is limited to studying a recently introduced hierarchy and does not load-bear the threshold derivation. With no equations or proofs present, no self-definitional reduction, fitted-input-as-prediction, or ansatz-smuggling can be exhibited. Honest non-finding: score 0, empty steps.

Assumptions & free parameters 0 free parameters · 3 assumptions · 0 invented entities

The central claim rests on the standard induced ensemble for random mixed states, the externally defined moment-based PPT hierarchy, and classical analytic tools (permutations, concentration, orthogonal polynomials). No free parameters are fitted to experimental data; λ_m are derived thresholds. No new physical entities are postulated. Because only the abstract is available, the ledger records the background assumptions named there rather than every lemma-level hypothesis in the unseen proofs.

assumptions (3)

domain assumption Random bipartite mixed states are distributed as the partial trace over an environment C^s of a Haar-uniform pure state on C^d⊗C^d⊗C^s (induced measure).
This is the standard random-state model used to define ‘typical’ behavior; the thresholds are relative to this ensemble.
domain assumption The moment-based PPT hierarchy is a valid sequence of relaxations of the PPT criterion, involving only experimentally accessible moments.
Taken as recently introduced prior work; the paper studies its typical performance rather than re-deriving the hierarchy.
standard math Combinatorics of permutations, concentration of measure in high dimension, and Hankel determinant evaluation via orthogonal polynomials apply to the moments of the partial transpose of these random states.
Standard analytic toolkit invoked in the abstract as the proof engine for averages and deviation bounds.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Moment-based PPT criteria for random bipartite states." pith.science (2026). https://pith.science/paper/RGB57NLO

@misc{pith2026260711369,
  author       = {Pith},
  title        = {Pith review of: Moment-based PPT criteria for random bipartite states},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/RGB57NLO}},
  note         = {Machine review of arXiv:2607.11369}
}

abstract

Moment-based relaxations of the positive partial transpose (PPT) criterion have been recently introduced, as a hierarchy of entanglement criteria involving only experimentally accessible quantities of a given bipartite state. The goal of this work is to study their typical detection performance on high-dimensional bipartite systems. Concretely, we investigate whether random bipartite mixed states on $\mathbb C^d\otimes\mathbb C^d$, obtained as the marginal over an environment $\mathbb C^s$ of a uniformly distributed pure state, generically satisfy or violate them. For each fixed level $m\in\mathbb N$ in this hierarchy of moment-based PPT criteria, we are able to identify a threshold environment dimension $s=\lambda_md^2$ at which the behavior of the associated random state switches from violating to satisfying it, with probability going to $1$ as $d$ grows. The proof combines combinatorics of permutations techniques to estimate the average value of moments of partially transposed random states and concentration of measure arguments to bound the probability of deviating from such average, when the underlying local dimension $d$ is large. We additionally need tools from the theory of Hankel determinant evaluation via orthogonal polynomials.

Discussion (0). Continue with ORCID to comment.

Pith tools

Reviewed July 14, 2026 · model on record in the stance chip above.