pith. sign in

arxiv: 1606.05061 · v1 · pith:BZKDT5RGnew · submitted 2016-06-16 · 🪐 quant-ph · math.OA

Perfect Embezzlement of Entanglement

classification 🪐 quant-ph math.OA
keywords embezzlementperfectproveanalyzecommutingentangledentanglementfidelity
0
0 comments X
read the original abstract

Van Dam and Hayden introduced a concept commonly referred to as embezzlement, where, for any entangled quantum state $\phi$, there is an entangled catalyst state $\psi$, from which a high fidelity approximation of $\phi \otimes \psi$ 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.