Pith. sign in

REVIEW 2 cited by

The quantum marginal independence problem

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 1912.01041 v1 pith:6FRHZWT2 submitted 2019-12-02 quant-ph hep-th

classification quant-phhep-th
keywords statesinequalitiesn-partitequantumquestionabsenceadvantageanalysis
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We investigate whether the presence or absence of correlations between subsystems of an N-partite quantum system is solely constrained by the non-negativity and monotonicity of mutual information. We argue that this relatively simple question is in fact very deep because it is sensitive to the structure of the set of N-partite states. It can be informed by inequalities satisfied by the von Neumann entropy, but has the advantage of being more tractable. We exemplify this by deriving the explicit solution for N=4, despite having limited knowledge of the entropic inequalities. Furthermore, we describe how this question can be tailored to the analysis of more specialized classes of states such as classical probability distributions, stabilizer states, and geometric states in the holographic gauge/gravity duality.

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. Algorithmic construction of SSA-compatible extreme rays of the subadditivity cone and the ${\sf N}=6$ solution

    quant-ph 2024-12 conditional novelty 8.0 of 10

    Complete classification of SSA-compatible extreme rays of the six-party subadditivity cone, with 150 holographic graph realizations and 52 confirmed non-holographic orbits.

  2. On the construction of graph models realizing given entropy vectors

    hep-th 2025-12 conditional novelty 7.0 of 10

    An efficient algorithm constructs candidate simple tree graph models for entropy vectors that pass a chordality test, but its correctness remains conjectural.

Pith tools