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, without any prior entanglement among provers, the class of languages having quantum multi-prover interactive proof systems is equal to NEXP. Related to these, it is shown that, if a prover does not have his private qubits, the class of languages having quantum single-prover interactive proof systems is also equal to NEXP. © Springer-Verlag Berlin Heidelberg 2002.
CITATION STYLE
Kobayashi, H., & Matsumoto, K. (2002). Quantum multi-prover interactive proof systems with limited prior entanglement. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2518 LNCS, pp. 115–127). https://doi.org/10.1007/3-540-36136-7_11
Mendeley helps you to discover research relevant for your work.