Pith. sign in

REVIEW 1 cited by

Partial separability revisited: Necessary and sufficient criteria

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 1206.6253 v3 pith:CIAOHN6G submitted 2012-06-27 quant-ph math-phmath.MP

Partial separability revisited: Necessary and sufficient criteria

classification quant-ph math-phmath.MP
keywords criteriapartialseparabilityarbitrarycaseclassesclassificationfunctions
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We extend the classification of mixed states of quantum systems composed of arbitrary number of subsystems of arbitrary dimensions. This extended classification is complete in the sense of partial separability and gives 1+18+1 partial separability classes in the tripartite case contrary to a former 1+8+1. Then we give necessary and sufficient criteria for these classes, which make it possible to determine to which class a mixed state belongs. These criteria are given by convex roof extensions of functions defined on pure states. In the special case of three-qubit systems, we define a different set of such functions with the help of the Freudenthal triple system approach of three-qubit entanglement.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

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

  1. Tensor invariants for multipartite entanglement classification

    math-ph 2026-04 accept novelty 7.5

    Trace-invariants of colored graphs fully label LU orbits of HT multipartite states, completely characterize their LO preorder via weight-function divisibility, and yield large-N combinatorial distinctions from Haar-ra...