Coherent state exchange in multi-prover quantum interactive proof systems

Abstract

We show that any number of parties can coherently exchange any one pure quantum state for another, without communication, given prior shared entanglement. Two applications of this fact to the study of multi-prover quantum interactive proof systems are given. First, we prove that there exists a one-round two-prover quantum interactive proof system for which no finite amount of shared entanglement allows the provers to implement an optimal strategy. More specifically, for every fixed input string, there exists a sequence of strategies for the provers, with each strategy requiring more entanglement than the last, for which the probability for the provers to convince the verifier to accept approaches 1. It is not possible, however, for the provers to convince the verifier to accept with certainty with a finite amount of shared entanglement. The second application is a simple proof that multi-prover quantum interactive proofs can be transformed to have near-perfect completeness by the addition of one round of communication.

14 pages, 1 figure

References in corpus (7)

• A Sharp Fannes-type Inequality for the von Neumann Entropy
• Superdense coding of quantum states
• Three-player entangled XOR games are NP-hard to approximate
• Entanglement in Interactive Proof Systems with Binary Answers
• Entanglement-Resistant Two-Prover Interactive Proof Systems and Non-Adaptive Private Information Retrieval Systems
• Entangled games are hard to approximate
• Unique Games with Entangled Provers are Easy

Cited by in corpus (17)

• Tsirelson's problem and an embedding theorem for groups arising from non-local games
• Can quantum mechanics help distributed computing?
• Quantum Strategies and Local Operations
• Characteristics of Universal Embezzling Families
• Quantum Side Information: Uncertainty Relations, Extractors, Channel Simulations
• Numerical and analytical results for geometric measure of coherence and geometric measure of entanglement
• Entanglement fluctuation theorems
• Separation of quantum, spatial quantum, and approximate quantum correlations
• Rank-one Quantum Games
• Universal quantum computation in a hidden basis
• Extended Nonlocal Games from Quantum-Classical Games
• Constant gap between conventional strategies and those based on C*-dynamics for self-embezzlement
• Extended Nonlocal Games
• Additive entanglemement measures cannot be more than asymptotically continuous
• Properties of Local Quantum Operations with Shared Entanglement
• Universality of EPR pairs in Entanglement-Assisted Communication Complexity, and the Communication Cost of State Conversion
• Maximally entangled states in pseudo-telepathy games