{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:08:47Z","timestamp":1787497727022,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540323013","type":"print"},{"value":"9783540322887","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11672142_12","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T03:27:54Z","timestamp":1141097274000},"page":"162-171","source":"Crossref","is-referenced-by-count":15,"title":["Entanglement in Interactive Proof Systems with Binary Answers"],"prefix":"10.1007","author":[{"given":"Stephanie","family":"Wehner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Babai, L.: Trading group theory for randomness. In: Proceedings of 17th ACM STOC, pp. 421\u2013429 (1985)","DOI":"10.1145\/22145.22192"},{"issue":"1","key":"12_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF01200056","volume":"1","author":"L. Babai","year":"1991","unstructured":"Babai, L., Fortnow, L., Lund, C.: Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity\u00a01(1), 3\u201340 (1991)","journal-title":"Computational Complexity"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Kilian, J., Wigderson, A.: Multi prover interactive proofs: How to remove intractability. In: Proceedings of 20th ACM STOC, pp. 113\u2013131 (1988)","DOI":"10.1145\/62212.62223"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Cai, J., Condon, A., Lipton, R.: On bounded round multi-prover interactive proof systems. In: Proceedings of the Fifth Annual Conference on Structure in Complexity Theory, pp. 45\u201354 (1990)","DOI":"10.1109\/SCT.1990.113953"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"880","DOI":"10.1103\/PhysRevLett.23.880","volume":"23","author":"J. Clauser","year":"1969","unstructured":"Clauser, J., Horne, M., Shimony, A., Holt, R.: Proposed experiment to test local hidden-variable theories. Physical Review Letters\u00a023, 880\u2013884 (1969)","journal-title":"Physical Review Letters"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Cleve, R., H\u00f8yer, P., Toner, B., Watrous, J.: Consequences and limits of nonlocal strategies. In: Proceedings of 19th IEEE Conference on Computational Complexity, pp. 236\u2013249, quant-ph\/0404076 (2004)","DOI":"10.1109\/CCC.2004.1313847"},{"key":"12_CR7","unstructured":"Cleve, R., H\u00f8yer, P., Toner, B., Watrous, J.: Consequences and limits of nonlocal strategies. In: Presentation at 19th IEEE Conference on Computational Complexity (2004)"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Feige, U.: On the success probability of two provers in one-round proof systems. In: Proceedings of the Sixth Annual Conference on Structure in Complexity Theory, pp. 116\u2013123 (1991)","DOI":"10.1109\/SCT.1991.160251"},{"key":"12_CR9","unstructured":"Feige, U.: Error reduction by parallel repetition - the state of the art. Technical Report CS95-32, Weizmann Institute, 1 (1995)"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Feige, U., Lov\u00e1sz, L.: Two-prover one-round proof systems: their power and their problems. In: Proceedings of 24th ACM STOC, pp. 733\u2013744 (1992)","DOI":"10.1145\/129712.129783"},{"issue":"18","key":"12_CR11","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"1","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM Journal on Computing\u00a01(18), 186\u2013208 (1989)","journal-title":"SIAM Journal on Computing"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Kitaev, A., Watrous, J.: Parallelization, amplification, and exponential time simulation of quantum interactive proof systems. In: Proceedings of 32nd ACM STOC, pp. 608\u2013617 (2000)","DOI":"10.1145\/335305.335387"},{"issue":"3","key":"12_CR13","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1016\/S0022-0000(03)00035-7","volume":"66","author":"H. Kobayashi","year":"2003","unstructured":"Kobayashi, H., Matsumoto, K.: Quantum Multi-Prover Interactive Proof Systems with Limited Prior Entanglement. J. of Computer and System Sciences\u00a066(3), 429\u2013450 (2003)","journal-title":"J. of Computer and System Sciences"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Lapidot, D., Shamir, A.: Fully parallelized multi prover protocols for NEXP-time. In: Proceedings of 32nd FOCS, pp. 13\u201318 (1991)","DOI":"10.1109\/SFCS.1991.185342"},{"key":"12_CR15","unstructured":"Marriott, C., Watrous, J.: Quantum Arthur-Merlin games. cs.CC\/0506068"},{"key":"12_CR16","volume-title":"Quantum Computation and Quantum Information","author":"M.A. Nielsen","year":"2000","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"issue":"3","key":"12_CR17","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF02058098","volume":"24","author":"S. Popescu","year":"1994","unstructured":"Popescu, S., Rohrlich, D.: Quantum nonlocality as an axiom. Foundations of Physics\u00a024(3), 379\u2013385 (1994)","journal-title":"Foundations of Physics"},{"key":"12_CR18","unstructured":"Popescu, S., Rohrlich, D.: Nonlocality as an axiom for quantum theory. In: The dilemma of Einstein, Podolsky and Rosen, 60 years later: International symposium in honour of Nathan Rosen, quant-ph\/9508009 (1996)"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Popescu, S., Rohrlich, D.: Causality and nonlocality as axioms for quantum mechanics. In: Proceedings of the Symposium of Causality and Locality in Modern Physics and Astronomy: Open Questions and Possible Solutions, quant-ph\/9709026 (1997)","DOI":"10.1007\/978-94-017-0990-3_45"},{"key":"12_CR20","unstructured":"Preda, D.: Non-local multi-prover interactive proofs. CWI Seminar (June 21, 2005)"},{"key":"12_CR21","unstructured":"Raz, R.: Quantum information and the PCP theorem. quant-ph\/0504075. In: FOCS (to appear, 2005)"},{"issue":"4","key":"12_CR22","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1145\/146585.146609","volume":"39","author":"A. Shamir","year":"1992","unstructured":"Shamir, A.: IP = PSPACE. Journal of the ACM\u00a039(4), 869\u2013877 (1992)","journal-title":"Journal of the ACM"},{"issue":"4","key":"12_CR23","doi-asserted-by":"publisher","first-page":"878","DOI":"10.1145\/146585.146613","volume":"39","author":"A. Shen","year":"1992","unstructured":"Shen, A.: IP = PSPACE: simplified proof. Journal of the ACM\u00a039(4), 878\u2013880 (1992)","journal-title":"Journal of the ACM"},{"key":"12_CR24","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/BF01663472","volume":"36","author":"B. Tsirelson","year":"1987","unstructured":"Tsirelson, B.: Quantum analogues of Bell inequalities: The case of two spatially separated domains. Journal of Soviet Mathematics\u00a036, 557\u2013570 (1987)","journal-title":"Journal of Soviet Mathematics"},{"issue":"4","key":"12_CR25","first-page":"329","volume":"8","author":"B. Tsirelson","year":"1993","unstructured":"Tsirelson, B.: Some results and problems on quantum Bell-type inequalities. Hadronic Journal Supplement\u00a08(4), 329\u2013345 (1993)","journal-title":"Hadronic Journal Supplement"},{"key":"12_CR26","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF00417500","volume":"4","author":"B. Cirel\u2019son (Tsirelson)","year":"1980","unstructured":"Cirel\u2019son (Tsirelson), B.: Quantum generalizations of Bell\u2019s inequality. Letters in Mathematical Physics\u00a04, 93\u2013100 (1980)","journal-title":"Letters in Mathematical Physics"},{"key":"12_CR27","unstructured":"van Dam, W.: Nonlocality & Communication Complexity. PhD thesis, University of Oxford, Department of Physics (2000)"},{"key":"12_CR28","unstructured":"van Dam, W.: Impossible consequences of superstrong nonlocality. quant-ph\/0501159 (2005)"},{"key":"12_CR29","unstructured":"Vyalyi, M.: QMA=PP implies that PP contains PH. Electronic Colloquium on Computational Complexity, TR03-021 (2003)"},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"Watrous, J.: PSPACE has constant-round quantum interactive proof systems. In: Proceedings of 40th IEEE FOCS, pp. 112\u2013119, cs.CC\/9901015 (1999)","DOI":"10.1109\/SFFCS.1999.814583"}],"container-title":["Lecture Notes in Computer Science","STACS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11672142_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T16:55:30Z","timestamp":1736268930000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11672142_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540323013","9783540322887"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/11672142_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}