Perfect embezzlement of entanglement
Bibliographic record
Abstract
Van Dam and Hayden introduced a concept commonly referred to as embezzlement, where, for any entangled quantum state ϕ, there is an entangled catalyst state ψ, from which a high fidelity approximation of ϕ ⊗ ψ can be produced using only local operations. We investigate a version of this where the embezzlement is perfect (i.e., the fidelity is 1). We prove that perfect embezzlement is impossible in a tensor product framework, even with infinite-dimensional Hilbert spaces and infinite entanglement entropy. Then we prove that perfect embezzlement is possible in a commuting operator framework. We prove this using the theory of C*-algebras and we also provide an explicit construction. Next, we apply our results to analyze perfect versions of a nonlocal game introduced by Regev and Vidick. Finally, we analyze the structure of perfect embezzlement protocols in the commuting operator model, showing that they require infinite-dimensional Hilbert spaces.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.005 | 0.014 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.002 | 0.008 |
| Scholarly communication | 0.003 | 0.010 |
| Open science | 0.002 | 0.005 |
| Research integrity | 0.001 | 0.003 |
| Insufficient payload (model declined to judge) | 0.004 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".