### Abstract

The central question in quantum multi-prover interactive proof systems is whether or not entanglement shared among provers affects the verification power of the proof system. We study for the first time positive aspects of prior entanglement and show how it can be used to parallelize any multiprover quantum interactive proof system to a one-round system with perfect completeness, soundness bounded away from 1 by an inverse polynomial in the input size, and one extra prover. Alternatively, we can also parallelize to a three-turn system with the same number of provers, where the verifier only broadcasts the outcome of a coin flip. This "public-coin" property is somewhat surprising, since in the classical case public-coin multi-prover interactive proofs are equivalent to single prover ones.

Original language | English (US) |
---|---|

Title of host publication | Proceedings - 23rd Annual IEEE Conference on Computational Complexity, CCC 2008 |

Pages | 211-222 |

Number of pages | 12 |

DOIs | |

State | Published - Sep 19 2008 |

Event | 23rd Annual IEEE Conference on Computational Complexity, CCC 2008 - College Park, MD, United States Duration: Jun 23 2008 → Jun 26 2008 |

### Other

Other | 23rd Annual IEEE Conference on Computational Complexity, CCC 2008 |
---|---|

Country | United States |

City | College Park, MD |

Period | 6/23/08 → 6/26/08 |

### Fingerprint

### ASJC Scopus subject areas

- Theoretical Computer Science
- Software
- Computational Mathematics

### Cite this

*Proceedings - 23rd Annual IEEE Conference on Computational Complexity, CCC 2008*(pp. 211-222). [4558824] https://doi.org/10.1109/CCC.2008.6

**Using entanglement in quantum multi-prover interactive proofs.** / Kempe, Julia; Kobayashi, Hirotada; Matsumoto, Keiji; Vidick, Thomas.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings - 23rd Annual IEEE Conference on Computational Complexity, CCC 2008.*, 4558824, pp. 211-222, 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, College Park, MD, United States, 6/23/08. https://doi.org/10.1109/CCC.2008.6

}

TY - GEN

T1 - Using entanglement in quantum multi-prover interactive proofs

AU - Kempe, Julia

AU - Kobayashi, Hirotada

AU - Matsumoto, Keiji

AU - Vidick, Thomas

PY - 2008/9/19

Y1 - 2008/9/19

N2 - The central question in quantum multi-prover interactive proof systems is whether or not entanglement shared among provers affects the verification power of the proof system. We study for the first time positive aspects of prior entanglement and show how it can be used to parallelize any multiprover quantum interactive proof system to a one-round system with perfect completeness, soundness bounded away from 1 by an inverse polynomial in the input size, and one extra prover. Alternatively, we can also parallelize to a three-turn system with the same number of provers, where the verifier only broadcasts the outcome of a coin flip. This "public-coin" property is somewhat surprising, since in the classical case public-coin multi-prover interactive proofs are equivalent to single prover ones.

AB - The central question in quantum multi-prover interactive proof systems is whether or not entanglement shared among provers affects the verification power of the proof system. We study for the first time positive aspects of prior entanglement and show how it can be used to parallelize any multiprover quantum interactive proof system to a one-round system with perfect completeness, soundness bounded away from 1 by an inverse polynomial in the input size, and one extra prover. Alternatively, we can also parallelize to a three-turn system with the same number of provers, where the verifier only broadcasts the outcome of a coin flip. This "public-coin" property is somewhat surprising, since in the classical case public-coin multi-prover interactive proofs are equivalent to single prover ones.

UR - http://www.scopus.com/inward/record.url?scp=51749107495&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=51749107495&partnerID=8YFLogxK

U2 - 10.1109/CCC.2008.6

DO - 10.1109/CCC.2008.6

M3 - Conference contribution

AN - SCOPUS:51749107495

SN - 9780769531694

SP - 211

EP - 222

BT - Proceedings - 23rd Annual IEEE Conference on Computational Complexity, CCC 2008

ER -