Pith. Sign in

REVIEW

Entanglement in quantum information theory

Quantum Physics · Submitted 30 Oct 2006 · 196 references

Pith's verdict: A solid 2001 thesis: the negativity monotonicity proof and the Schmidt measure are the durable pieces, and the mixed-state catalysis example is real, though Lemma 3.3 has an unstated separable-to-LOCC step.

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 →

· 3 major objections · 9 minor · Ask about this paper · The compiled record · Read the full review →
Challenge this review Comment (0) Read on arXiv ↗
Cite ▾
arXiv IDquant-ph/0610253 (version 1)
Pith IDT3AI7DT4, Pith's permanent record of this paper and its review
CitationJ. Eisert. "Entanglement in quantum information theory." arXiv:quant-ph/0610253 (2006). https://pith.science/paper/T3AI7DT4
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
The paper

The paper claims

A borrowed entangled state can make some mixed-state conversions possible under local operations and classical communication.

The reading

The thesis treats entanglement as a quantitative resource and asks which transformations between quantum states are possible when distant parties may use only local operations plus classical communication. Its sharpest claim is that a borrowed pure entangled state can act as a catalyst: some genuinely mixed states cannot be converted into one another by local operations alone, yet can be converted when the parties share an extra entangled pair that is returned unchanged. If that is right, the operational classification of mixed-state entanglement is larger than the LOCC-reachable set, and resource accounting must separate entanglement that is spent from entanglement that is merely borrowed. The thesis also develops monotones—negativity, modified relative-entropy measures, and the Schmidt measure for multipartite systems—to quantify and compare these resources.

What carries the argument

The load-bearing machinery is the LOCC/ELOCC distinction together with Nielsen's majorization criterion for pure-state transformations and Lemma 3.3 for the mixed-state no-go half. ELOCC means that the parties may borrow an auxiliary bipartite system in a known pure entangled state, perform LOCC on the joint system, and return the auxiliary system in its original state. Lemma 3.3 converts the existence of a separable operation into a majorization condition on the entangled component after the product component has been fixed; the catalyst then supplies enough extra majorization weight to satisfy Nielsen's criterion. The thesis also deploys entanglement monotones—negativity, modified relative entropy, and the Schmidt measure—as the general language for saying what a local operation cannot increase.

Extended reading notes

Core claim

The central discovery is a strict separation between LOCC and entanglement-assisted LOCC in the mixed-state domain. Example 3.11 constructs rank-two states $��=λ|ψ⟩⟨ψ|+(1-λ)|55⟩⟨55|$ and $ρ=μ|φ⟩⟨φ|+(1-μ)|55⟩⟨55|$ with $μ=0.95λ$; Lemma 3.3 shows that no LOCC operation can map $σ$ to $ρ$, because any separable operation would have to preserve the distinguished product component and would force a majorization relation that fails. Yet appending a pure catalyst $ω=(√0.4|66⟩+√0.6|77⟩)(√0.4⟨66|+√0.6⟨77|)$ makes the transformation possible under LOCC, and the catalyst is returned unchanged and uncorrelated. The thesis presents this as evidence that entanglement-assisted operations are more powerful than LOCC not only on pure states but in the interior of the state space.

Load-bearing premise

The LOCC-impossibility half of the mixed-state example depends on Lemma 3.3, which assumes that any separable operation taking $σ$ to $ρ$ must leave the distinguished product component $|55⟩⟨55|$ in place, so the entangled part cannot be redistributed; if an LOCC protocol could move weight between the product and entangled components while still producing $ρ$, the example would not establish a strict LOCC/ELOCC gap.

Editorial extensions

If this is right

  • Mixed-state entanglement transformations cannot be classified by LOCC reachability alone; catalyst-assisted reachability is a distinct operational class.
  • A pure entangled state can enable a transformation without being consumed, so resource theories must distinguish borrowed catalyst entanglement from entanglement spent in the protocol.
  • The thesis's fidelity results imply that catalysts can improve some approximate mixed-state transformations, while Proposition 3.15 says they cannot improve the proportion of $|ψ⟩⟨ψ|$ in the convex mixtures considered there.
  • Conjecture 3.18 raises the possibility that stochastic ELOCC could unlock bound entanglement without consuming free entanglement, which would change how bound entanglement is understood operationally.

Reading between the lines

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

  • If the gap survives, the natural next object is a catalyst-dependent monotone or a mixed-state analogue of majorization that tracks what a borrowed pure state can supply; ordinary LOCC monotones would be incomplete invariants.
  • The effect has a thermodynamic flavor: the catalyst lowers a conversion barrier without changing state, so one should ask whether the allowed conversions are governed by a free-energy-like potential rather than by a single entanglement scalar.
  • A concrete test is to repeat Example 3.11 with finite-dimensional approximate catalysts and see whether the LOCC/ELOCC fidelity gap persists as catalyst dimension grows; a gap that vanishes would mark the effect as a finite-size artifact.
Original abstract

This thesis covers several aspects of entanglement in the context of quantum information theory.

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, 1,555 input tokens.

What the abstract itself states, as probabilities: claims first 0.02 · states limitation 0.04 · human participants 0.03 · controlled comparison 0.02 · randomized assignment 0.01 · states quantitative result 0.02 · compares with prior results 0.03 · 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 covers several aspects of entanglement in the context of quantum information theory.

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 covers several aspects of entanglement in the context of quantum information theory. contribution 0.82 0.41 0.07 asserted 0.96

What kind of paper the classifier reports this is: review 0.81 · evidence from argument 0.51.

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 1. 1: Schematic representation of the state space of a
Figure 2. 2: The average entanglement per copy of σa for n = 1, ..., 7 copies. The dashed line corre￾sponds to BR(σ ⊗40 a )/40. This result has an implication on the issue of “irreversibility” of asymptotic manipu￾lation of entanglement. In Ref. [92] it is stated that the process of distillation is truly irre￾versible, meaning that there exist states for which the distillable entanglement D↔ and the regularized entanglement of formation E∞ F are different from each other: More resources are needed in a preparation procedure even in the asymptotic limit than can be distilled from many copies of…
Figure 3. 4: There are, however, cases for which σ 6−→ ρ under LOCC, but σ ⊗ ω −→ ρ ⊗ ω under LOCC for an appropriately chosen state ω of another bi-partite quantum system. That is, the auxiliary system in the state ω is borrowed by Alice and Bob, such that they hold a composite system in the state σ ⊗ ω. This state can then be transformed into ρ ⊗ ω under LOCC operations. The auxiliary system can in a last step be returned. The state ω remains unchanged in the course of the protocol, and the auxiliary system is finally fully uncorrelated to the original quantum system. 3.4.1 Pure State Case…
Figure 4. 5: A state swapper represented in terms of CNOT gate
Figure 5. 2: The distillable entanglement D↔(σ) of σ (solid line) and the entanglement of the initial pure state D↔(|ψihψ|) (dashed line) as functions of α in Example 5.2. Now one can proceed in a similar fashion as before. The upper bound for distillable entanglement, given by the relative entropy with respect to the separable state ρ = αβ (|0, 0i|0, 0ih0, 0|h0, 0| + |1, 01, 0ih1, 0|h1, 0|) (5.25) + β 2 |1, 1i|1, 1ih1, 1|h1, 1| + α 2 |1, −1i|1, −1ih1, −1|h1, −1|, can again be reached using the protocol of Example 5.1. It follows that the distillable en￾tanglement is in this case given by…
Figure 6. 1: The pay-off table in the so-called Matching Pennies game. The first entry refers to Alice’s pay-off, the second to Bob’s. This very simple example demonstrates the typical structure of a game. A gameinvolves several players – at least two – who implement one out of several possible strategies, that is, make a decision. Many aspects of game theory can already be understood when only two players are involved. For reasons of simplicity, the following investigation will be restricted to the case of a two-player game. A strategy is a complete plan of action. Depending on the choices of…

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

References
How the literature uses it

58 arXiv papers cite this in 70 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 · 31 sentences without a confident label

Uses its method or tool 7 papers
Cites it as background 28 papers

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.