Pith. Sign in

REVIEW

The Structure of Bipartite Quantum States - Insights from Group Theory and Cryptography

PaperPDF from arXiv

data files

ReviewThe objections and verdict, as JSON Paper breakdownThe authors' claims, conditions and measurements, as JSON Signed receiptProof this review has not been altered
X Bluesky LinkedIn Reddit Hacker News
Matthias Christandl

Quantum Physics · Submitted 25 Apr 2006 · 229 references

Pith's verdict: The Part I equivalence is genuinely proved here and worth taking seriously; the reader's worry about finite generation is aimed at the wrong theorem, and the one real slip is a compressed display in Theorem 2.18 that a specialist closes in a line.

T0 · AI review

How this review was made: An AI referee (selfhosted/deepseek-v4.1-flash) read the paper on November 11, 2026 and answered a fixed list of questions about it. T0 is the starting level every paper gets. The levels describe how deeply Pith has checked the paper, never the authors.

  1. T0 AI review An AI read the paper and answered a fixed list of questions.
  2. T1 Audit Automatic checks that the references and files the paper relies on exist and match.
  3. T2 Compute The paper's code or calculations re-run with the same results.
  4. T3 Formal statement The claims written out in a formal math language a computer can read.
  5. T4 Proof Those claims proved, and the proof checked by computer.

How Pith checks papers →

· 1 major objection · 10 minor · Ask about this paper · The compiled record · Read the full review →
Challenge this review Comment (0) Read on arXiv ↗
Cite ▾
arXiv IDquant-ph/0604183 (version 1)
Pith IDFGBURGSU, Pith's permanent record of this paper and its review
CitationMatthias Christandl. "The Structure of Bipartite Quantum States - Insights from Group Theory and Cryptography." arXiv:quant-ph/0604183 (2006). https://pith.science/paper/FGBURGSU
Cite this reviewBibTeX for Pith's review of this paper
Claim paper

Why Pith says this

Highlight any text to comment on it.

Referee report

How Pith checks papers → · Full audit of this paper → · Review history (2 revisions) →

The paper

The paper claims

The allowed spectra of a bipartite quantum state and its two halves are, asymptotically, exactly the triples of shapes for which a product of two irreducible representations of the symmetric group contains a third.

The reading

Given a quantum state $r_{AB}$ on two parts, its spectrum and the spectra of the two reduced states $r_A$ and $r_B$ cannot be chosen freely: there are constraints. The thesis asks which triples $(r_A, r_B, r_{AB})$ actually occur, and shows that this spectral question is, up to a limiting procedure, the same question as a classical one in representation theory: when is the Kronecker coefficient $g^{}_{mu nu lambda}$ of the symmetric group nonzero, i.e. when does $V_lambda$ sit inside $V_mu otimes V_nu$? The bridge is a spectrum-estimation theorem saying that $k$ copies of a state fall with high probability into the Young frame whose normalised shape is closest to the state's spectrum. The payoff is two-directional: group-theoretic facts about Kronecker coefficients become spectral inequalities for quantum states (the thesis derives all two-qubit inequalities this way and gives a new proof of subadditivity of von Neumann entropy), and conversely the geometry of density operators constrains which Kronecker coefficients can vanish. A second, independent half of the thesis proposes squashed entanglement, an entanglement measure defined by letting an eavesdropper hold a purifying system and minimise the conditional mutual information.

What carries the argument

Three pieces carry the argument. First, Schur-Weyl duality decomposes $(mathbb{C}^d)^{otimes k}$ into blocks $U_lambda otimes V_lambda$, pairing irreducible representations of $U(d)$ and $S_k$. Second, the spectrum-estimation theorem (Theorem 2.13, attributed to Alicki-Rudnicki-Sadowski and to Keyl-Werner, with a short proof here via the majorisation property of Young symmetrisers): the probability that $k$ copies of a state with spectrum $r$ land in the block labelled by $lambda$ is bounded by $(k+1)^{d(d-1)/2} exp(-k D(ar lambda || r))$, so the block shape concentrates on the spectrum. Third, the semigroup property (Theorem 2.7, answering a conjecture of Klyachko): triples with nonzero Kronecker coefficients are closed under row-wise addition, and by identifying the representation ring with a quotient of a symmetric algebra and invoking Hilbert's basis theorem for the reductive group $SL(m) imes SL(n)$, that semigroup is finitely generated. Finite generation is what upgrades a single nonzero coefficient into a convergent sequence and what makes the admissible set a convex polytope (Theorem 2.30, with an independent proof via Kirwan's convexity theorem).

Extended reading notes

Core claim

The central claim is an asymptotic identity between two problems. Problem 1: given spectra $r_A$, $r_B$, $r_{AB}$, does there exist a density operator on $H_A otimes H_B$ with those spectra for the state and its two marginals? Problem 2: given partitions $mu$, $nu$, $lambda$ of $k$, is the Kronecker coefficient $g^{}_{mu nu lambda}$ nonzero, i.e. is $V_lambda subset V_mu otimes V_nu$ for the symmetric group $S_k$? Theorem 2.16 shows that every density operator produces a sequence of partition triples with nonzero Kronecker coefficient whose normalised shapes $ar mu, ar u, ar lambda$ converge to $(r_A, r_B, r_{AB})$. Theorem 2.18 shows the converse without any limit: every nonzero Kronecker coefficient produces an actual state whose spectra are exactly the normalised shapes. Hence the set of admissible spectral triples equals the closure of the set of normalised nonzero-Kronecker triples. The author notes the equivalence is genuinely asymptotic because the naive integral version fails: there are lattice points, visible as holes in the two-qubit plots, where $g^{}_{mu nu lambda} = 0$ although $g^{}_{2mu, 2nu, 2lambda} eq 0$.

Load-bearing premise

The upgrade from one nonzero Kronecker coefficient to a whole convergent sequence, and hence the convexity of the admissible set, rests on the claim that triples with nonzero Kronecker coefficient form a finitely generated semigroup, which in turn rests on identifying the representation ring with a quotient of a symmetric algebra by an ideal, a step the thesis cites to a textbook rather than proving.

Editorial extensions

If this is right

  • Every spectral inequality for bipartite states can be read off from a statement about Kronecker coefficients, and every nonvanishing Kronecker coefficient gives a concrete state, so the two literatures can be mined in both directions.
  • The set of admissible spectral triples is a convex polytope, so it suffices to check the finitely many vertices rather than a continuum of constraints.
  • Subadditivity and the triangle inequality for von Neumann entropy follow from the dimension inequality $dim V_lambda leq dim V_mu dim V_nu$ applied along the approximating sequence, giving a group-theoretic route to entropy inequalities rather than a purifying-system route.
  • All spectral inequalities for two qubits follow from the Klemm-Dvir-Clausen-Maier vanishing condition on Kronecker coefficients, recovering Bravyi's inequalities with an explicit vertex-by-vertex construction.
  • The same machinery, with $SU(m) imes SU(n) subset SU(m+n)$ replacing the diagonal $U(d)$ action, gives a short proof that Horn's problem is asymptotically equivalent to nonvanishing of Littlewood-Richardson coefficients.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the equivalence holds, the long-standing difficulty of deciding whether a Kronecker coefficient vanishes is not a curiosity of representation theory but a hardness statement about the quantum marginal problem, and any efficient algorithm for one would settle the other.
  • The failure of the integral version (the holes in the lattice) suggests a quantitative refinement worth testing: how large must the scaling factor $N$ be before a vanishing coefficient becomes nonvanishing, and does that growth rate have an entropic interpretation.
  • The thesis explicitly leaves strong subadditivity open for this method; a group-theoretic proof would need a three-party analogue of the Kronecker correspondence, which the thesis does not construct.
  • The squashed-entanglement half of the thesis and the spectral half are presented as separate, but both turn on conditional entropic quantities, so a natural extension is to ask whether squashed entanglement can be expressed through the same Young-frame concentration that drives Part I.
Original abstract

This thesis presents a study of the structure of bipartite quantum states. In the first part, the representation theory of the unitary and symmetric groups is used to analyse the spectra of quantum states. In particular, it is shown how to derive a one-to-one relation between the spectra of a bipartite quantum state and its reduced states, and the Kronecker coefficients of the symmetric group. In the second part, the focus lies on the entanglement of bipartite quantum states. Drawing on an analogy between entanglement distillation and secret-key agreement in classical cryptography, a new entanglement measure, `squashed entanglement', is introduced.

The compiled record

The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 4,234 input tokens.

What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.04 · human participants 0.02 · controlled comparison 0.02 · randomized assignment 0.01 · states quantitative result 0.06 · compares with prior results 0.08 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

This thesis presents a study of the structure of bipartite quantum states. In the first part, the representation theory of the unitary and symmetric groups is used to analyse the spectra of quantum states. In particular, it is shown how to derive a one-to-one relation between the spectra of a bipartite quantum state and its reduced states, and the Kronecker coefficients of the symmetric group. In the second part, the focus lies on the entanglement of bipartite quantum states. Drawing on an analogy between entanglement distillation and secret-key agreement in classical cryptography, a new entanglement measure, `squashed entanglement', is introduced.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 This thesis presents a study of the structure of bipartite quantum states. contribution 0.87 0.83 0.04 asserted 0.83
s1 In the first part, the representation theory of the unitary and symmetric groups is used to analyse the spectra of quantum states. method 0.91 0.79 0.05 asserted 0.99
s2 In particular, it is shown how to derive a one-to-one relation between the spectra of a bipartite quantum state and its reduced states, and the Kronecker coefficients of the symmetric group. result 0.97 0.92 0.27 asserted 1.00
s3 In the second part, the focus lies on the entanglement of bipartite quantum states. contribution 0.68 0.31 0.03 asserted 0.75
s4 Drawing on an analogy between entanglement distillation and secret-key agreement in classical cryptography, a new entanglement measure, `squashed entanglement', is introduced. contribution 0.99 0.90 0.18 asserted 1.00

What kind of paper the classifier reports this is: theoretical result 0.81 · evidence from proof or derivation 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

Figures
Figure 0. 1: A state ρ on system H is sent through a channel Λ implemented by the unitary U. Ancilla systems are the lose ends of lines. The state on H ⊗ K is |ψi and Λ(ρ), the state on H′ , is the channel output. The average is taken with respect to the Haar measure of U(d), i.e. the invariant measure on U(d), with normalisation R φ dφ = 1. A handy formula that connects the average fidelity with the entanglement fidelity was found by Micha l, Pawe l and Ryszard Horodecki [HHH99]: F¯(Λ) = dFe( 11 d ,Λ) + 1 d + 1 . (11) Finally, there are a few inequalities connecting the trace distance and
Figure 1. 1: Young frame (3, 2), top row: standard Young tableaux, bottom row: semistandard Young tableaux with numbering {1, 2}. • A standard Young tableau T is a Young tableau with the numbers 1 to k each in one box such that the numbers are increasing to the right and downwards. • A semistandard Young tableau T is a Young tableau containing numbers, possibly repeatedly, that weakly increase to the right and strictly increase downwards. Standard Young tableaux will be important in the construction of the Young sym￾metriser and, ultimately, the set of standard Young tableaux with frame λ will…
Figure 2. 1: Red dots correspond to gµνλ 6= 0, black dots correspond to admissible spectral triple (r A, rB, rAB). Two plots of the case SU(2) × SU(2) ⊂ SU(4) case, or two-qubit case, are on display. The x-axis label shows µ1 − µ2 and k(r A 1 − r A 2 ), the y-axis shows ν1 − ν2 and k(r B 1 − r B 2 ). The plot on the left contains data for λ = (4, 2, 1) = 7 r AB, which is to be contrasted with the plot on the right, λ = (8, 4, 2) = 14 r AB. as M~x = ~r, i.e. ~r = (r1,... ,rt , 1) for rj ∈ {r A 1 ,... ,rA m,rB 1 ,... rB n ,rAB 1 ,... ,rAB mn } and x = (x1,... ,xt+1). If (r A,r
Figure 3. 2: Relations between entanglement measures when o
Figure 4. 4: The states of the ensemble E (E˜) are in system S (S˜) and system A purifies system S. Eve’s quantum operation is modeled by a unitary U; she keeps system E and forwards system S˜. where the last inequality is true by the concavity of η(x). Inserting these estimates in the Holevo χ quantities χ(E) = S(ρ) and χ(E˜) = S(σ)− P i piS(σi) concludes the proof

Figures reproduced from arXiv:quant-ph/0604183 by the authors.

References
How later papers used it

60 later papers cite it

Evidence: substantial. 59 of the citing papers share no author with it, and 7 of those carry a confident label from Pith's citation classifier.

Pith read 19 of the 104 citing sentences, choosing only those whose citation markers point at this paper alone, and wrote the paraphrases from them. The summary, the counts, the evidence level, the links and the quotes come from code; the summary counts the papers listed below. A later paper is listed under a label when Pith's citation classifier gives one of its sentences that label at probability 0.8 or more (0.95 for support), Pith's reading finds that the citing paper itself did it, and a second check confirms the paraphrase against the sentence. This section lists uses only. It does not list criticism or disagreement, so their absence here says nothing about how the paper has been received. Papers that share an author with this one are listed apart, under "By the same authors". A quote is the citing authors' own sentence, shown when their paper's licence is CC BY, CC BY-SA or CC0. JSON

Builds on it 1 paper
Uses its method or tool 1 of 4 papers with this label
How the literature uses it

61 arXiv papers cite this in 107 sentences

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

Papers citing it · 77 sentences without a confident label

Contests it 1 paper
  • Interpreting the proof there, the only option seems to be that $d$ is equal to the dimension of the combined key and shield systems, in which case the proof given in [ref] does not generally establish that squashed entanglement bounds distillable key from above (i.e., there could exist a sequence of key distillation protocols resulting in shield systems with a dimension growing larger than an exponential in $n$, and in such a case the proof does not establish squashed entanglement as an upper bound on distillable key).

    Squashed entanglement and approximate private states · Introduction · contest 0.82

Builds on it 1 paper
Uses its method or tool 4 papers
  • In this section, we outline a method for estimating the fidelity of channels on a quantum computer, by means of an interaction with competing quantum provers [ref] .

    Estimating distinguishability measures on quantum computers · Estimating fidelity of channels · 0.93

  • To answer this question, one might consider employing the Schur transform [ref] and exploiting the structure inherent in polar codes.

    Towards efficient decoding of classical-quantum polar codes · Conclusion · 0.93

  • Given a Young diagram $λ⊢_d n$, we obtain these SSYTs by filling in the diagram with numbers from ${1, …, d}$ in non-decreasing order from left to right and in increasing order from top to bottom, for example: [equation] The number of SSYTs with entries in ${1,2…d}$ is given by the Weyl's dimension formula [ref] , [equation] Using the SSYTs, it is possible to obtain an orthogonal basis for $S_λ$ called the Gelfand-Tsetlin basis [ref] which we will use to give an explicit matrix form for the irreps as well as for establishing degeneracy in Section [ref].

    Enhanced quantum capacity thresholds from symmetry · Representation Theory · 0.86

Compares with it 1 paper
  • This feature of the (A)DNE distillable entanglement, which was highly non-trivial to see from its definition, establishes a strong parallel with the LOCC distillable entanglement, which is also known to be strongly super-additive [ref] .

    Distillable entanglement under dually non-entangling operations · Introduction · 0.84

Cites it as background 20 papers
  • For entanglement measures $Ent$ which upper bounds the maximum device-dependent key distillation rate, i.e., $K_DD(ρ)≤Ent (ρ)$ for a density operator $ρ$, we have, [equation] Some well-known entanglement measures that upper bound $K_DD(ρ)$ are the relative entropy of entanglement $E_R(ρ)$, regularized relative entropy of entanglement $E^∞_R(ρ)$, squashed entanglement $E_sq(ρ)$ (see [ref] ).

    Upper bounds on device-independent quantum key distribution rates in static and dynamic scenarios · Bounds on device-independent key distillation rate of states · 0.80

  • Since the squashed entanglement was introduced, a lot of papers devoting to analysis of its properties appeared, see [ref] and the references therein.

    Squashed entanglement in infinite dimensions · Introduction · 0.98

  • Among these measures, that often gain an operational interpretation as the optimum asymptotic rate at which a particular entanglement transformation can be done, we find, e. g. the distillable entanglement $E_d$, the distillable key $K_d$, the squashed entanglement $E_sq$, the relative entropy of entanglement $E_r$, the entanglement cost $E_c$, and the entanglement of formation $E_f$, just to mention some of them (for an accurate review of definitions and properties of a large class of entanglement measures see Ref. [ref] and references therein).

    Irreversibility of entanglement loss · Entanglement loss(es) · 0.98

Discussion

Disagree with the review, or know something it missed? Leave a comment, highlight any passage above to comment on it, or challenge this review formally.