{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:03:09Z","timestamp":1775282589984,"version":"3.50.1"},"reference-count":33,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3766,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0022-0000(03)00035-7","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T01:09:12Z","timestamp":1052788152000},"page":"429-450","source":"Crossref","is-referenced-by-count":39,"title":["Quantum multi-prover interactive proof systems with limited prior entanglement"],"prefix":"10.1016","volume":"66","author":[{"given":"Hirotada","family":"Kobayashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keiji","family":"Matsumoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(03)00035-7_BIB1","doi-asserted-by":"crossref","unstructured":"D. Aharonov, A.Yu. Kitaev, N. Nisan, Quantum circuits with mixed states, in: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998, pp. 20\u201330.","DOI":"10.1145\/276698.276708"},{"issue":"3","key":"10.1016\/S0022-0000(03)00035-7_BIB2","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/278298.278306","article-title":"Proof verification and the hardness of approximation problems","volume":"45","author":"Arora","year":"1998","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/S0022-0000(03)00035-7_BIB3","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1145\/273865.273901","article-title":"Probabilistic checking of proofs","volume":"45","author":"Arora","year":"1998","journal-title":"J. ACM"},{"key":"10.1016\/S0022-0000(03)00035-7_BIB4","doi-asserted-by":"crossref","unstructured":"L. Babai, Trading group theory for randomness, in: Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985, pp. 421\u2013429.","DOI":"10.1145\/22145.22192"},{"issue":"1","key":"10.1016\/S0022-0000(03)00035-7_BIB5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF01200056","article-title":"Non-deterministic exponential time has two-prover interactive protocols","volume":"1","author":"Babai","year":"1991","journal-title":"Comput. Complexity"},{"key":"10.1016\/S0022-0000(03)00035-7_BIB6","doi-asserted-by":"crossref","unstructured":"M. Bellare, U. Feige, J. Kilian, On the role of shared randomness in two prover proof systems, in: Proceedings of the Third Israel Symposium on the Theory of Computing and Systems, 1995, pp. 199\u2013208.","DOI":"10.1109\/ISTCS.1995.377031"},{"key":"10.1016\/S0022-0000(03)00035-7_BIB7","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, J. Kilian, A. Wigderson, Multi-prover interactive proofs: how to remove the intractability assumptions, in: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988, pp. 113\u2013131.","DOI":"10.1145\/62212.62223"},{"issue":"5","key":"10.1016\/S0022-0000(03)00035-7_BIB8","doi-asserted-by":"crossref","first-page":"1510","DOI":"10.1137\/S0097539796300933","article-title":"Strengths and weaknesses of quantum computing","volume":"26","author":"Bennett","year":"1997","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/S0022-0000(03)00035-7_BIB9","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0020-0190(00)00084-3","article-title":"A new universal and fault-tolerant quantum basis","volume":"75","author":"Boykin","year":"2000","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0022-0000(03)00035-7_BIB10","doi-asserted-by":"crossref","unstructured":"J.-Y. Cai, A. Condon, R.J. Lipton, On bounded round multi-prover interactive proof systems, in: Proceedings of the Fifth Annual Structure in Complexity Theory Conference, 1990, pp. 45\u201354.","DOI":"10.1109\/SCT.1990.113953"},{"issue":"1","key":"10.1016\/S0022-0000(03)00035-7_BIB11","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0022-0000(05)80026-1","article-title":"PSPACE is provable by two provers in one round","volume":"48","author":"Cai","year":"1994","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(03)00035-7_BIB12","unstructured":"R.E. Cleve, An entangled pair of provers can cheat, talk at the Workshop on Quantum Computation and Information, California Institute of Technology, November 2000."},{"key":"10.1016\/S0022-0000(03)00035-7_BIB13","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1098\/rspa.1985.0070","article-title":"Quantum theory, the Church-Turing principle and the universal quantum computer","volume":"400","author":"Deutsch","year":"1985","journal-title":"Proc. Roy. Soc. London A"},{"key":"10.1016\/S0022-0000(03)00035-7_BIB14","doi-asserted-by":"crossref","unstructured":"U. Feige, On the success probability of two provers in one-round proof systems, in: Proceedings of the Sixth Annual Structure in Complexity Theory Conference, 1991, pp. 116\u2013123.","DOI":"10.1109\/SCT.1991.160251"},{"key":"10.1016\/S0022-0000(03)00035-7_BIB15","doi-asserted-by":"crossref","unstructured":"U. Feige, L. Lov\u00e1sz, Two-prover one-round proof systems: their power and their problems (extended abstract), in: Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992, pp. 733\u2013744.","DOI":"10.1145\/129712.129783"},{"key":"10.1016\/S0022-0000(03)00035-7_BIB16","unstructured":"L.J. Fortnow, Complexity-theoretic aspects of interactive proof systems, Ph.D. Thesis, Department of Mathematics, Massachusetts Institute of Technology, May 1989."},{"issue":"2","key":"10.1016\/S0022-0000(03)00035-7_BIB17","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1016\/0304-3975(94)90251-8","article-title":"On the power of multi-prover interactive protocols","volume":"134","author":"Fortnow","year":"1994","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/S0022-0000(03)00035-7_BIB18","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0218012","article-title":"The knowledge complexity of interactive proof systems","volume":"18","author":"Goldwasser","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(03)00035-7_BIB19","series-title":"Randomness and Computation","first-page":"73","article-title":"Private coins versus public coins in interactive proof systems","volume":"Vol. 5","author":"Goldwasser","year":"1989"},{"key":"10.1016\/S0022-0000(03)00035-7_BIB20","series-title":"Quantum Computing","author":"Gruska","year":"1999"},{"key":"10.1016\/S0022-0000(03)00035-7_BIB21","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0375-9601(93)90880-9","article-title":"A complete classification of quantum ensembles having a given density matrix","volume":"183","author":"Hughston","year":"1993","journal-title":"Phys. Lett. A"},{"key":"10.1016\/S0022-0000(03)00035-7_BIB22","doi-asserted-by":"crossref","unstructured":"A.Yu. Kitaev, J.H. Watrous, Parallelization, amplification, and exponential time simulation of quantum interactive proof systems, in: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, 2000, pp. 608\u2013617.","DOI":"10.1145\/335305.335387"},{"key":"10.1016\/S0022-0000(03)00035-7_BIB23","unstructured":"H. Kobayashi, K. Matsumoto, T. Yamakami, Quantum certificate verification: single versus multiple quantum certificates, Los Alamos e-print archive, quant-ph\/0110006, 2001."},{"issue":"2","key":"10.1016\/S0022-0000(03)00035-7_BIB24","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1006\/jcss.1997.1238","article-title":"Fully parallelized multi prover protocols for NEXP-time","volume":"54","author":"Lapidot","year":"1997","journal-title":"J. Comput. System Sci."},{"issue":"4","key":"10.1016\/S0022-0000(03)00035-7_BIB25","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1145\/146585.146605","article-title":"Algebraic methods for interactive proof systems","volume":"39","author":"Lund","year":"1992","journal-title":"J. ACM"},{"key":"10.1016\/S0022-0000(03)00035-7_BIB26","unstructured":"M.A. Nielsen, Entanglement and distributed quantum computation, talk at the Fourth Workshop on Quantum Information Processing, Amsterdam, January 2001."},{"key":"10.1016\/S0022-0000(03)00035-7_BIB27","series-title":"Quantum Computation and Quantum Information","author":"Nielsen","year":"2000"},{"issue":"2","key":"10.1016\/S0022-0000(03)00035-7_BIB28","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/0022-0000(85)90045-5","article-title":"Games against nature","volume":"31","author":"Papadimitriou","year":"1985","journal-title":"J. Comput. System Sci."},{"issue":"4","key":"10.1016\/S0022-0000(03)00035-7_BIB29","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1145\/146585.146609","article-title":"IP=PSPACE","volume":"39","author":"Shamir","year":"1992","journal-title":"J. ACM"},{"key":"10.1016\/S0022-0000(03)00035-7_BIB30","doi-asserted-by":"crossref","unstructured":"P.W. Shor, Fault-tolerant quantum computation, in: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996, pp. 56\u201365.","DOI":"10.1109\/SFCS.1996.548464"},{"issue":"5","key":"10.1016\/S0022-0000(03)00035-7_BIB31","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","article-title":"Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer","volume":"26","author":"Shor","year":"1997","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(03)00035-7_BIB32","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0034-4877(86)90055-8","article-title":"Parallel transport and \u201cquantum holonomy\u201d along density operators","volume":"24","author":"Uhlmann","year":"1986","journal-title":"Rep. Math. Phys."},{"key":"10.1016\/S0022-0000(03)00035-7_BIB33","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1016\/S0304-3975(01)00375-9","article-title":"PSPACE has constant-round quantum interactive proof systems","volume":"292","author":"Watrous","year":"2003","journal-title":"Theoret. Comput. Sci."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000357?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000357?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T13:53:57Z","timestamp":1553176437000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000003000357"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0022000003000357"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(03)00035-7","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}