Rank-one quantum games
| dc.contributor.author | Cooney, T. | |
| dc.contributor.author | Junge, M. | |
| dc.contributor.author | Palazuelos Cabezón, Carlos | |
| dc.contributor.author | Pérez García, David | |
| dc.date.accessioned | 2023-06-19T14:53:51Z | |
| dc.date.available | 2023-06-19T14:53:51Z | |
| dc.date.issued | 2015 | |
| dc.description.abstract | In this work, we study rank-one quantum games. In particular, we focus on the study of the computability of the entangled value ω*. We show that the value ω* can be efficiently approximated up to a multiplicative factor of 4. We also study the behavior of ω* under the parallel repetition of rank-one quantum games, showing that it does not verify a perfect parallel repetition theorem. To obtain these results, we first connect rank-one games with the mathematical theory of operator spaces. We also reprove with these new tools essentially known results about the entangled value of rank-one games with one-way communication ω qow . In particular, we show that ω qow can be computed efficiently and it satisfies a perfect parallel repetition theorem. | |
| dc.description.department | Depto. de Análisis Matemático y Matemática Aplicada | |
| dc.description.faculty | Fac. de Ciencias Matemáticas | |
| dc.description.refereed | TRUE | |
| dc.description.sponsorship | Unión Europea. FP7 | |
| dc.description.sponsorship | Comunidad de Madrid | |
| dc.description.sponsorship | NSF | |
| dc.description.sponsorship | "Juan de la Cierva" program (Spain) | |
| dc.description.status | pub | |
| dc.eprint.id | https://eprints.ucm.es/id/eprint/30050 | |
| dc.identifier.doi | http://dx,doi.org/10.1007/s00037-014-0096-x | |
| dc.identifier.issn | 1420-8954 | |
| dc.identifier.officialurl | http://link.springer.com/article/10.1007/s00037-014-0096-x | |
| dc.identifier.relatedurl | http://link.springer.com | |
| dc.identifier.relatedurl | http://arxiv.org/abs/1112.3563 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14352/34620 | |
| dc.issue.number | 1 | |
| dc.journal.title | Computational complexit | |
| dc.language.iso | eng | |
| dc.page.final | 196 | |
| dc.page.initial | 133 | |
| dc.publisher | Springer Basel | |
| dc.relation.projectID | QUEVADIS (233859) | |
| dc.relation.projectID | QUITEMAD (S2009/ESP-1594) | |
| dc.relation.projectID | MTM2011-26912 | |
| dc.relation.projectID | I-MATH | |
| dc.relation.projectID | DMS-1201886 | |
| dc.rights.accessRights | restricted access | |
| dc.subject.cdu | 517.98 | |
| dc.subject.keyword | Quantum games | |
| dc.subject.keyword | Efficient approximation | |
| dc.subject.keyword | Parallel repetition | |
| dc.subject.keyword | Operator spaces | |
| dc.subject.ucm | Análisis funcional y teoría de operadores | |
| dc.title | Rank-one quantum games | |
| dc.type | journal article | |
| dc.volume.number | 24 | |
| dcterms.references | Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M. (1998) Proof verification and the hardness of approximation problems. Journal of the ACM 45: pp. 501-555 Arora, S., Safra, S. (1998) Probabilistic checking of proofs: a new characterization of NP. Journal of the ACM 45: pp. 70-122 M. Ben-Or, M. Hassidim & H. Pilpel (2008). Quantum Multiprover Interactive Proofs with Communicating Provers. In Proceedings of 49th IEEE Symposium on Foundations of Computer Science, 467–476. H. Buhrman, N. Chandran, S. Fehr, R. Gelles, V. Goyal, R. Ostrovsky & C. Schaffner (2011). Position-Based Quantum Cryptography: Impossibility and Constructions. In Advances in Cryptology - CRYPTO 2011: 31st Annual Cryptology Conference, Proceedings, number 6841 in Lecture Notes in Computer Science, 429–446. Chan J., T. (1994) Facial Structure of the Trace Class. Arch. Math. 64: pp. 185-187 R. Cleve, W. Slofstra, F. Unger & S. Upadhyay (2007). Strong parallel repetition theorem for quantum XOR proof systems. In Proceedings of 22nd IEEE Conference on Computational Complexity, 501–555. Devetak, I., Junge, M., King, C., Ruskai, M.B. (2006) Multiplicativity of completely bounded p-norms implies a new additivity result. Comm. Math. Phys. 266: pp. 37-63 E. Effros & Z.-J. Ruan (2000). Operator Spaces, volume 23 of London Mathematical Society Monographs New Series. Oxford University Press, Oxford. U. Feige (1991). On the success probability of two provers in one-round proof systems. In Proceedings of 6th IEEE Structure in Complexity Theory, 116–123. M. Grötschel, L. Lovasz & A. Schrijver (1993). Geometric algorithms and combinatorial optimization, volume 2 of Algorithms and Combinatorics. Springer-Verlag, Berlin. G. Gutoski (2010). Quantum Strategies and Local Operations. Technical report arXiv:1003.0038. Haagerup, U., Musat, M. (2007) On the best constants in noncommutative Khintchine-type inequalities. J. Funct. Anal. 250: pp. 588-624 Haagerup, U., Musat, M. (2008) The Effros-Ruan conjecture for bilinear forms on C*-algebras. Invent. Math. 174: pp. 139-163 T. Ito, H. Kobayashi & K. Matsumoto (2009). Oracularization and two-prover one-round interactive proofs against nonlocal strategies. In Proceedings of 24th Annual IEEE Conference on Computational Complexity, 217–228. N. Johnston, D. W. Kribs & V. I. Paulsen (2009). Computing Stabilized Norms for Quantum Operations via the Theory of Completely Bounded Maps. Quantum Inf. Comput. 9 (1-2), 16–35. Johnston, N., Kribs, D.W., Paulsen, V.I., Pereira, R. (2011) Minimal and Maximal Operator Spaces and Operator Systems in Entanglement Theory. J. Funct. Anal. 260: pp. 2407-2423 Junge, M. (2005) Embedding of the operator space OH and the logarithmic “little Grothendieck inequality”. Invent. Math. 161: pp. 225-286 M. Junge, M. Navascues, C. Palazuelos, D. Pérez-García, V. B. Scholz & R. F. Werner (2011). Connes’ embedding problem and Tsirelson’s problem. J. Math. Phy. 52, 012 102. Junge, M., Palazuelos, C. (2011) Large violation of Bell inequalities with low entanglement. Comm. Math. Phys. 306: pp. 695-746 M. Junge, C. Palazuelos, D. Pérez-García, I. Villanueva & M.M. Wolf (2010). Operator Space theory: a natural framework for Bell inequalities. Phys. Rev. Lett. 104, 170 405. Junge, M., Xu, Q. (2010) Representation of certain homogeneous Hilbertian operator spaces and applications. Invent. Math. 179: pp. 75-118 C J. Kempe, H. Kobayashi, K. Matsumoto, B. Toner & T. Vidick (2008a). Entangled Games are Hard to approximate. In Proceedings of 49th IEEE Symposium on Foundations of Computer Science, 447–456. J. Kempe & O. Regev (2010). No Strong Parallel Repetition with Entangled and Non-signaling Provers. In Proceedings of 25th Annual IEEE Conference on Computational Complexity, 7–15. J. Kempe, O. Regev & B. Toner (2008b). Unique Games with Entangled Provers are Easy. In Proceedings of 49th IEEE Symposium on Foundations of Computer Science, 457–466. J. Kempe & T. Vidick (2011). Parallel Repetition of Entangled Games. In 43th Annual ACM Symposium on Theory of Computing, 353–362. Kitaev, A. (1997) Quantum computations: Algorithms and error correction. Russian Math. Surveys 52: pp. 1191-1249 A. Kitaev & J. Watrous (2000).Parallelization,amplification, and exponential time simulation of quantum interactive proof systems. In 32nd Annual ACM Symposium on Theory of Computing, 608–617. Kobayashi, H., Matsumoto, K. (2003) Quantum multi-prover interactive proof systems with limited prior entanglement. J. Comput. Syst. Sci. 66: pp. 429-450 D. Leung, B. Toner & J. Watrous (2008). Coherent state exchange in multi-prover quantum interactive proof systems. Technical report arXiv:0804.4118. Oikhberg, T. (2010) Completely bounded and ideal norms of multiplication operators and Schur multipliers. Integr. Equ. Oper. Theory 66: pp. 425-440 V. Paulsen (2002). Completely bounded maps and operator algebras, volume 78 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge. Pérez-García, D., Wolf, M.M., Palazuelos, C., Villanueva, I., Junge, M. (2008) Unbounded violation of tripartite Bell inequalities. Comm. Math. Phys. 279: pp. 455-486 CrossRef G. Pisier (1998). Non-Commutative Vector Valued L p -Spaces and Completely p-Summing Maps. Asterisque 247. G. Pisier (2003). Introduction to operator space theory, volume 294 of London Mathematical Society Lecture Note Series. Cambridge University Press. Pisier, G. (2012) Grothendieck’s theorem, past and present. Bull. Amer. Math. Soc. (N.S.) 49: pp. 237-323 CrossRef Pisier, G., Shlyakhtenko, D. (2002) Grothendieck’s theorem for operator spaces. Invent. Math. 150: pp. 185-217 A. Rapaport,Ta-Shma (2007). On the power of quantum, one round, two prover interactive proof systems. Quantum Inf. Process. 6(6), 445–459. Raz, R. (1998) A parallel repetition theorem. SIAM Journal on Computing 27: pp. 763-803 O. Regev & T. Vidick (2012a). Elementary Proofs of Grothendieck Theorems for Completely Bounded Norms. J. Operator Theory. O. Regev & T. Vidick (2012b). Quantum XOR games. Technical report arXiv:1207.4939 B. Simon (1981). Pointwise domination of matrices and comparison of S p norms. Pacific J. Math. 97, 471Ð475. Smith, R.R. (1983) Completely bounded maps between C*-algebras. J. London Math. Soc. 27: pp. 157-166 CrossRef T. Vidick (2013). Three-player entangled XOR games are NP-hard to approximate. Technical report arXiv:1302.1242. Watrous, J. (2003) PSPACE has constant-round quantum interactive proof systems. Theoretical Computer Science 292: pp. 575-588 Watrous, J. (2009) Semidefinite programs for completely bounded norms. Theory of Computing 5: pp. 217-238 | |
| dspace.entity.type | Publication | |
| relation.isAuthorOfPublication | 09970d9e-6722-4f02-aac0-023cf9867638 | |
| relation.isAuthorOfPublication | 5edb2da8-669b-42d1-867d-8fe3144eb216 | |
| relation.isAuthorOfPublication.latestForDiscovery | 09970d9e-6722-4f02-aac0-023cf9867638 |
