Quantum multi-prover interactive proof systems with limited prior entanglement

被引：38
|
作者：
Kobayashi, H
Matsumoto, K
机构：
[1] Japan Sci & Technol Corp, Exploratory Res Adv Technol, Quantum Computat & Informat Project, Bunkyo Ku, Tokyo 1130033, Japan
[2] Univ Tokyo, Grad Sch Sci, Dept Informat Sci, Bunkyo Ku, Tokyo 1130033, Japan
来源：
JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 2003年 / 66卷 / 03期
关键词：
quantum computing; computational complexity; interactive proof systems;
D O I：
10.1016/S0022-0000(03)00035-7
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper gives the first formal treatment of a quantum analogue of multi-prover interactive proof systems. It is proved that the class of languages having quantum multi-prover interactive proof systems is necessarily contained in NEXP, under the assumption that provers are allowed to share at most polynomially many prior-entangled qubits. This implies that, in particular, if provers do not share any prior entanglement with each other, the class of languages having quantum multi-prover interactive proof systems is equal to NEXP. Related to these, it is shown that, in the case a prover does not have his private qubits. the class of languages having quantum single-prover interactive proof systems is also equal to NEXP. (C) 2001 Elsevier Science (USA). All rights reserved.
引用
收藏
页码：429 / 450
页数：22
相关论文
共 42 条
  • [1] Quantum multi-prover interactive proof systems with limited prior entanglement
    Kobayashi, H
    Matsumoto, K
    [J]. ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2002, 2518 : 115 - 127
  • [2] Using entanglement in quantum multi-prover interactive proofs
    Kempe, Julia
    Kobayashi, Hirotada
    Matsumoto, Keiji
    Vidick, Thomas
    [J]. TWENTY-THIRD ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2008, : 211 - +
  • [3] Using Entanglement in Quantum Multi-Prover Interactive Proofs
    Julia Kempe
    Hirotada Kobayashi
    Keiji Matsumoto
    Thomas Vidick
    [J]. computational complexity, 2009, 18 : 273 - 307
  • [4] USING ENTANGLEMENT IN QUANTUM MULTI-PROVER INTERACTIVE PROOFS
    Kempe, Julia
    Kobayashi, Hirotada
    Matsumoto, Keiji
    Vidick, Thomas
    [J]. COMPUTATIONAL COMPLEXITY, 2009, 18 (02) : 273 - 307
  • [5] Compression of Quantum Multi-prover Interactive Proofs
    Ji, Zhengfeng
    [J]. STOC'17: PROCEEDINGS OF THE 49TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2017, : 289 - 302
  • [6] Parallelization of entanglement-resistant multi-prover interactive proofs
    Ito, Tsuyoshi
    [J]. INFORMATION PROCESSING LETTERS, 2014, 114 (10) : 579 - 583
  • [7] Multi-prover proof of retrievability
    Paterson, Maura B.
    Stinson, Douglas R.
    Upadhyay, Jalaj
    [J]. JOURNAL OF MATHEMATICAL CRYPTOLOGY, 2018, 12 (04) : 203 - 220
  • [8] Multi-prover encoding schemes and three-prover proof systems
    Tardos, G
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1996, 53 (02) : 251 - 260
  • [9] ON THE POWER OF MULTI-PROVER INTERACTIVE PROTOCOLS
    FORTNOW, L
    ROMPEL, J
    SIPSER, M
    [J]. THEORETICAL COMPUTER SCIENCE, 1994, 134 (02) : 545 - 557
  • [10] Generalized Tsirelson inequalities, commuting-operator provers, and multi-prover interactive proof systems
    Ito, Tsuyoshi
    Kobayashi, Hirotada
    Preda, Daniel
    Sun, Xiaoming
    Yao, Andrew C. -C.
    [J]. TWENTY-THIRD ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2008, : 187 - +
12345