{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T19:40:01Z","timestamp":1748461201529,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476710"},{"type":"electronic","value":"9783662476727"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47672-7_29","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T10:07:39Z","timestamp":1434708459000},"page":"355-366","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Interactive Proofs with Approximately Commuting Provers"],"prefix":"10.1007","author":[{"given":"Matthew","family":"Coudron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Vidick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"issue":"3","key":"29_CR1","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. J. ACM 45(3), 501\u2013555 (1998)","journal-title":"J. ACM"},{"unstructured":"Aravind, P.K.: The magic squares and Bell\u2019s theorem. Technical report (2002 arXiv:quant-ph\/0206070","key":"29_CR2"},{"issue":"1","key":"29_CR3","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/273865.273901","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of NP. J. ACM 45(1), 70\u2013122 (1998)","journal-title":"J. ACM"},{"key":"29_CR4","first-page":"195","volume":"1","author":"S John","year":"1964","unstructured":"John, S.: Bell. On the Einstein-Podolsky-Rosen paradox. Physics 1, 195\u2013200 (1964)","journal-title":"Bell. On the Einstein-Podolsky-Rosen paradox. Physics"},{"key":"29_CR5","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. Comput. Complexity 1, 3\u201340 (1991)","journal-title":"Comput. Complexity"},{"doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Kilian, J., Wigderson, A.: Multi-prover interactive proofs: How to remove intractability assumptions. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC), pp. 113\u2013131 (1988)","key":"29_CR6","DOI":"10.1145\/62212.62223"},{"issue":"3","key":"29_CR7","doi-asserted-by":"publisher","first-page":"033011","DOI":"10.1088\/1367-2630\/16\/3\/033011","volume":"16","author":"J-D Bancal","year":"2014","unstructured":"Bancal, J.-D., Sheridan, L., Scarani, V.: More randomness from the same data. New Journal of Physics 16(3), 033011 (2014)","journal-title":"New Journal of Physics"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"880","DOI":"10.1103\/PhysRevLett.23.880","volume":"23","author":"JF Clauser","year":"1969","unstructured":"Clauser, J.F., Horne, M.A., Shimony, A., Holt, R.A.: Proposed experiment to test local hidden-variable theories. Phys. Rev. Lett. 23, 880\u2013884 (1969)","journal-title":"Phys. Rev. Lett."},{"doi-asserted-by":"crossref","unstructured":"Cleve, R., H\u00f8yer, P., Toner, B., Watrous, J.: Consequences and limits of nonlocal strategies. In: Proc. 19th IEEE Conf. on Computational Complexity (CCC 2004), pp. 236\u2013249. IEEE Computer Society (2004)","key":"29_CR9","DOI":"10.1109\/CCC.2004.1313847"},{"doi-asserted-by":"crossref","unstructured":"Colbeck, R., Kent, A.: Private randomness expansion with untrusted devices. Journal of Physics A: Mathematical and ..., 1\u201311 (2011)","key":"29_CR10","DOI":"10.1088\/1751-8113\/44\/9\/095305"},{"issue":"1","key":"29_CR11","doi-asserted-by":"publisher","first-page":"73","DOI":"10.2307\/1971057","volume":"104","author":"A Connes","year":"1976","unstructured":"Connes, A.: Classification of injective factors cases $$ii_1$$ , $$ii_\\infty $$ , $$iii_\\lambda $$ , $$\\lambda \\ne 1$$ . Annals of Mathematics 104(1), 73\u2013115 (1976)","journal-title":"Annals of Mathematics"},{"doi-asserted-by":"crossref","unstructured":"Doherty, A.C., Liang, Y-C., Toner, B., Wehner, S.: The quantum moment problem and bounds on entangled multi-prover games. In: Proc. 23rd IEEE Conf. on Computational Complexity (CCC 2008), pp. 199\u2013210 (2008)","key":"29_CR12","DOI":"10.1109\/CCC.2008.26"},{"doi-asserted-by":"crossref","unstructured":"Exel, R., Loring, T.: Almost commuting unitary matrices. In: Proceedings of the American Mathematical Society 106(4), 913\u2013915 (1989)","key":"29_CR13","DOI":"10.1090\/S0002-9939-1989-0975641-9"},{"key":"29_CR14","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1103\/PhysRev.47.777","volume":"47","author":"A Einstein","year":"1935","unstructured":"Einstein, A., Podolsky, B., Rosen, N.: Can quantum-mechanical description of physical reality be considered complete? Physical Review 47, 777\u2013780 (1935)","journal-title":"Physical Review"},{"issue":"2","key":"29_CR15","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/226643.226652","volume":"43","author":"U Feige","year":"1996","unstructured":"Feige, U., Goldwasser, S., Lov\u00e1sz, L., Safra, S., Szegedy, M.: Interactive proofs and the hardness of approximating cliques. J. ACM 43(2), 268\u2013292 (1996)","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"Ito, T., Kobayashi, H., Matsumoto, K.: Oracularization and two-prover one-round interactive proofs against nonlocal strategies. In: Proc. 24th IEEE Conf. on Computational Complexity (CCC 2009), pp. 217\u2013228. IEEE Computer Society (2009)","key":"29_CR16","DOI":"10.1109\/CCC.2009.22"},{"doi-asserted-by":"crossref","unstructured":"Ito, T., Vidick, T., A multi-prover interactive proof for NEXP sound against entangled provers. In: Proc. 53rd FOCS, pp. 243\u2013252 (2012)","key":"29_CR17","DOI":"10.1109\/FOCS.2012.11"},{"doi-asserted-by":"crossref","unstructured":"Junge, M., Navascues, M., Palazuelos, C., Perez-Garcia, D., Scholz, V.B., Werner, R.F.: Connes\u2019 embedding problem and tsirelson\u2019s problem. J. Math. Physics 52(1) (2011)","key":"29_CR18","DOI":"10.1063\/1.3514538"},{"issue":"1","key":"29_CR19","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/BF01232444","volume":"112","author":"E Kirchberg","year":"1993","unstructured":"Kirchberg, E.: On non-semisplit extensions, tensor products and exactness of group $${C}^*$$ -algebras. Inventiones mathematicae 112(1), 449\u2013489 (1993)","journal-title":"Inventiones mathematicae"},{"issue":"3","key":"29_CR20","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. Journal of Computer and System Sciences 66(3), 429\u2013450 (2003)","journal-title":"Journal of Computer and System Sciences"},{"issue":"7","key":"29_CR21","doi-asserted-by":"publisher","first-page":"3207","DOI":"10.1137\/090772885","volume":"39","author":"J Kempe","year":"2010","unstructured":"Kempe, J., Regev, O., Toner, B.: Unique games with entangled provers are easy. SIAM J. Comput. 39(7), 3207\u20133229 (2010)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"29_CR22","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1287\/moor.28.3.470.16391","volume":"28","author":"M Laurent","year":"2003","unstructured":"Laurent, M.: A comparison of the Sherali-Adams, Lov\u00e1sz-Schrijver, and Lasserre relaxations for 0\u20131 Programming. Mathematics of Operations Research 28(3), 470\u2013496 (2003)","journal-title":"Mathematics of Operations Research"},{"unstructured":"Ll. Masanes. Extremal quantum correlations for n parties with two dichotomic observables per site. Technical report (2005). arXiv:quant-ph\/0512100","key":"29_CR23"},{"doi-asserted-by":"crossref","unstructured":"Miller, C.A., Shi, Y.: Robust protocols for securely expanding randomness and distributing keys using untrusted quantum devices. In: Proc. 46th STOC. ACM New York (2014)","key":"29_CR24","DOI":"10.1145\/2591796.2591843"},{"key":"29_CR25","doi-asserted-by":"publisher","first-page":"010401","DOI":"10.1103\/PhysRevLett.98.010401","volume":"98","author":"M Navascu\u00e9s","year":"2007","unstructured":"Navascu\u00e9s, M., Pironio, S., Ac\u00edn, A.: Bounding the set of quantum correlations. Phys. Rev. Lett. 98, 010401 (2007)","journal-title":"Phys. Rev. Lett."},{"doi-asserted-by":"crossref","unstructured":"Navascu\u00e9s, M., Pironio, S., Ac\u00edn, A.: A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations. New Journal of Physics, 10(073013) (2008)","key":"29_CR26","DOI":"10.1088\/1367-2630\/10\/7\/073013"},{"doi-asserted-by":"crossref","unstructured":"Ozawa, N.: Tsirelson\u2019s problem and asymptotically commuting unitary matrices. Journal of Mathematical Physics 54(3) (2013)","key":"29_CR27","DOI":"10.1063\/1.4795391"},{"doi-asserted-by":"crossref","unstructured":"Pironio, S., Ac\u00edn, A., Massar, S.: Random numbers certified by Bell\u2019s theorem. Nature, 1\u201326 (2010)","key":"29_CR28","DOI":"10.1038\/nature09008"},{"key":"29_CR29","doi-asserted-by":"publisher","first-page":"022116","DOI":"10.1103\/PhysRevA.82.022116","volume":"82","author":"KF P\u00e1l","year":"2010","unstructured":"P\u00e1l, K.F., V\u00e9rtesi, T.: Maximal violation of a bipartite three-setting, two-outcome Bell inequality using infinite-dimensional quantum systems. Phys. Rev. A 82, 022116 (2010)","journal-title":"Phys. Rev. A"},{"key":"29_CR30","doi-asserted-by":"publisher","first-page":"100504","DOI":"10.1103\/PhysRevLett.110.100504","volume":"110","author":"J Silman","year":"2013","unstructured":"Silman, J., Pironio, S., Massar, S.: Device-independent randomness generation in the presence of weak cross-talk. Phys. Rev. Lett. 110, 100504 (2013)","journal-title":"Phys. Rev. Lett."},{"unstructured":"Scholz, V.B., Werner, R.F.: Tsirelson\u2019s problem. Technical report (2008). arXiv:0812.4305v1 [math-ph]","key":"29_CR31"},{"doi-asserted-by":"crossref","unstructured":"Vidick, T.: Three-player entangled XOR games are NP-hard to approximate. In: Proc. 54th FOCS (2013)","key":"29_CR32","DOI":"10.1109\/FOCS.2013.87"},{"key":"29_CR33","first-page":"429","volume":"45","author":"D Voiculescu","year":"1983","unstructured":"Voiculescu, D.: Asymptotically commuting finite rank unitary operators without commuting approximants. Acta Sci. Math. (Szeged) 45, 429\u2013431 (1983)","journal-title":"Acta Sci. Math. (Szeged)"},{"doi-asserted-by":"crossref","unstructured":"Yang, T.H., Vertesi, T., Bancal, J-D., Scarani, V., Navascues, M.: Robust and Versatile Black-Box Certification of Quantum Devices. Phys. Rev. Lett. 113(4), (July 22, 2014)","key":"29_CR34","DOI":"10.1103\/PhysRevLett.113.040401"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47672-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T19:09:40Z","timestamp":1748459380000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47672-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476710","9783662476727"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47672-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}