Pith. sign in

REVIEW 2 cited by

Entanglement Polytopes: Multiparticle Entanglement from Single-Particle Information

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1208.0365 v4 pith:RZM55FCC submitted 2012-08-01 quant-ph math-phmath.MP

classification quant-phmath-phmath.MP
keywords entanglementstatesclassglobalinformationlocalquantumsingle-particle
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Entangled many-body states are an essential resource for quantum computing and interferometry. Determining the type of entanglement present in a system usually requires access to an exponential number of parameters. We show that in the case of pure multi-particle quantum states, features of the global entanglement can already be extracted from local information alone. This is achieved by associating with any given class of entanglement an entanglement polytope---a geometric object which characterizes the single-particle states compatible with that class. Our results, applicable to systems of arbitrary size and statistics, give rise to local witnesses for global pure-state entanglement, and can be generalized to states affected by low levels of noise.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Error exponents for tripartite-to-bipartite entanglement transformations

    quant-ph 2025-07 accept novelty 7.0 of 10

    For pure tripartite states, the optimal deterministic rate is the minimum of two min-entropies of entanglement, and the direct and strong converse error exponents are given by explicit rate formulas.

  2. Parking completions are $\mathbf{x}$-parking functions

    math.CO 2026-07 conditional novelty 4.0 of 10

    For any fixed set of taken parking spots, the parking completions are precisely the x-parking functions whose cumulative bounds are the unoccupied spots.

Pith tools