Using entanglement in quantum multi-prover interactive proofs

Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick

Research output: Contribution to journalArticle

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 multi-prover quantum interactive proof system to a one-round system with perfect completeness, soundness bounded away from one 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 languageEnglish (US)
Pages (from-to)273-307
Number of pages35
JournalComputational Complexity
Volume18
Issue number2
DOIs
StatePublished - Jun 1 2009

Fingerprint

Interactive Proof Systems
Interactive Proofs
Entanglement
Polynomials
Proof System
Flip
Soundness
Broadcast
Completeness
Polynomial

Keywords

  • Entanglement
  • Interactive proof systems
  • Multi-prover interactive proof systems
  • Quantum computing

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics
  • Mathematics(all)
  • Computational Mathematics

Cite this

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

In: Computational Complexity, Vol. 18, No. 2, 01.06.2009, p. 273-307.

Research output: Contribution to journalArticle

Kempe, J, Kobayashi, H, Matsumoto, K & Vidick, T 2009, 'Using entanglement in quantum multi-prover interactive proofs', Computational Complexity, vol. 18, no. 2, pp. 273-307. https://doi.org/10.1007/s00037-009-0275-3
Kempe, Julia ; Kobayashi, Hirotada ; Matsumoto, Keiji ; Vidick, Thomas. / Using entanglement in quantum multi-prover interactive proofs. In: Computational Complexity. 2009 ; Vol. 18, No. 2. pp. 273-307.
@article{de42b3969e474f3c9b6ffabe73532be9,
title = "Using entanglement in quantum multi-prover interactive proofs",
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 multi-prover quantum interactive proof system to a one-round system with perfect completeness, soundness bounded away from one 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.",
keywords = "Entanglement, Interactive proof systems, Multi-prover interactive proof systems, Quantum computing",
author = "Julia Kempe and Hirotada Kobayashi and Keiji Matsumoto and Thomas Vidick",
year = "2009",
month = "6",
day = "1",
doi = "10.1007/s00037-009-0275-3",
language = "English (US)",
volume = "18",
pages = "273--307",
journal = "Computational Complexity",
issn = "1016-3328",
publisher = "Birkhauser Verlag Basel",
number = "2",

}

TY - JOUR

T1 - Using entanglement in quantum multi-prover interactive proofs

AU - Kempe, Julia

AU - Kobayashi, Hirotada

AU - Matsumoto, Keiji

AU - Vidick, Thomas

PY - 2009/6/1

Y1 - 2009/6/1

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 multi-prover quantum interactive proof system to a one-round system with perfect completeness, soundness bounded away from one 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 multi-prover quantum interactive proof system to a one-round system with perfect completeness, soundness bounded away from one 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.

KW - Entanglement

KW - Interactive proof systems

KW - Multi-prover interactive proof systems

KW - Quantum computing

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

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

U2 - 10.1007/s00037-009-0275-3

DO - 10.1007/s00037-009-0275-3

M3 - Article

VL - 18

SP - 273

EP - 307

JO - Computational Complexity

JF - Computational Complexity

SN - 1016-3328

IS - 2

ER -