Properties of Local Quantum Operations with Shared Entanglement
arXiv:0805.2209
Abstract
Multi-party local quantum operations with shared quantum entanglement or shared classical randomness are studied. The following facts are established: (i) There is a ball of local operations with shared randomness lying within the space spanned by the no-signaling operations and centred at the completely noisy channel. (ii) The existence of the ball of local operations with shared randomness is employed to prove that the weak membership problem for local operations with shared entanglement is strongly NP-hard. (iii) Local operations with shared entanglement are characterized in terms of linear functionals that are ``completely'' positive on a certain cone K of separable Hermitian operators, under a natural notion of complete positivity appropriate to that cone. Local operations with shared randomness (but not entanglement) are also characterized in terms of linear functionals that are merely positive on that same cone K. (iv) Existing characterizations of no-signaling operations are generalized to the multi-party setting and recast in terms of the Choi-Jamiolkowski representation for quantum super-operators. It is noted that the standard nonlocal box is an example of a no-signaling operation that is separable, yet cannot be implemented by local operations with shared entanglement.
25 pages, 11pt font, full page compilation of final journal version. v3: strong NP-hardness result added, other minor revisions; v2: new title, major revisions
References in corpus (10)
- A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
- The volume of separable states is super-doubly-exponentially small
- Coherent state exchange in multi-prover quantum interactive proof systems
- Strong Parallel Repetition Theorem for Quantum XOR Proof Systems
- Entanglement in Interactive Proof Systems with Binary Answers
- Entangled states close to the maximally mixed state
- Entanglement-Resistant Two-Prover Interactive Proof Systems and Non-Adaptive Private Information Retrieval Systems
- The Complexity of the Consistency and N-representability Problems for Quantum States
- Entangled games are hard to approximate
- Strong NP-Hardness of the Quantum Separability Problem