• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

The Complexity of Entangled Games (2011)

by Thomas Vidick
Add To MetaCart

Tools

Sorted by:
Results 1 - 3 of 3

Three-player entangled XOR games . . .

by Thomas Vidick , 2013
"... ..."
Abstract - Add to MetaCart
Abstract not found

unknown title

by Travis Hance
"... Interactive proof systems with multiple provers sharing entanglement ..."
Abstract - Add to MetaCart
Interactive proof systems with multiple provers sharing entanglement
(Show Context)

Citation Context

...]. This is essentially a simplified version of the Pasting Lemma. It only applies to full measurements but it serves as useful motivation for the proof of the Pasting Lemma. Furthermore, Chapter 2 of =-=[11]-=- is a good introduction to the subject although it deals only with linear (not multilinear) functions over Fn 2 . It also makes nice use of the same intuition behind Lemma 15 (namely that a measuremen...

INFORMATION CAUSALITY, SZEMERÉDI-TROTTER AND ALGEBRAIC VARIANTS OF CHSH

by Mohammad Bavarian, Peter, W. Shor
"... iv ..."
Abstract - Add to MetaCart
Abstract not found
(Show Context)

Citation Context

...tudy of games. This connection between the two fields has been quite influential in communication complexity [9], but also has played a critical role in other areas of complexity theory (see [18] and =-=[36]-=-). 6 Buhrman and Massar were the first to study CHSHq for q 6= 2 where they obtained the upper bound of 1/3+2/3 √ 3 for q = 3 using information theoretic methods (different from the ones used here). A...

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University