Perfect Embezzlement of Entanglement
arXiv:1606.05061 · doi:10.1063/1.4974818
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.
27 pages, 9 figures
References in corpus (2)
Cited by in corpus (15)
- Coherence and asymmetry cannot be broadcast
- Catalysis of entanglement and other quantum resources
- A channel-based framework for steering, non-locality and beyond
- Fundamental Limits on Correlated Catalytic State Transformations
- The quantum-to-classical graph homomorphism game
- Complete Characterization of Entanglement Embezzlement
- Relativistic Quantum Fields Are Universal Entanglement Embezzlers
- Connes' Embedding Problem and Winning Strategies for Quantum XOR Games
- Teleportation with Embezzling Catalysts
- An operator-algebraic formulation of self-testing
- Multipartite Embezzlement of Entanglement
- A three-player coherent state embezzlement game
- Constant gap between conventional strategies and those based on C*-dynamics for self-embezzlement
- One-Shot Distributed Source Simulation: As Quantum as it Can Get
- Uniqueness of purifications is equivalent to Haag duality