Parallel Repetition for Entangled Games via Fast Quantum Search

Published on ● Video Link: https://www.youtube.com/watch?v=9QhMn6nzV7g



Duration: 28:59
236 views
3


Henry Yuen, Massachusetts Institute of Technology
Information Theory in Complexity Theory and Combinatorics
http://simons.berkeley.edu/talks/henry-yuen-2015-04-22




Other Videos By Simons Institute for the Theory of Computing


2015-04-28Interactive and Amortized Communication – An Information Theoretic Perspective
2015-04-28Tutorial on Capacity in Coding for Interactive Communication (Part 1 of 2)
2015-04-28Tutorial on List Decodable Coding Schemes and Interactive Communication in Networks (Part 1 of 2)
2015-04-28Information Theory and Polyhedral Combinatorics
2015-04-28Some Novel Computational Models to Think About
2015-04-28Tutorial on List Decodable Coding Schemes and Interactive Communication in Networks (Part 2 of 2)
2015-04-28Deterministic Communication vs. Partition Number
2015-04-28Information Theory and Additive Combinatorics
2015-04-28Non-Signalling Parallel Repetition Using de Finetti Reductions
2015-04-28Limits to Efficient Preprocessing
2015-04-27Parallel Repetition for Entangled Games via Fast Quantum Search
2015-04-27Lucky Talk: A Communication Game Approach to the Sensitivity Conjecture
2015-04-27Streaming Interactive Proofs and Arthur-Merlin Communication
2015-04-27Counting Distinct Elements in the Message Passing Model
2015-04-27Internal Compression of Protocols to Entropy
2015-04-27Tutorial on Coding for Interactive Communication: Introduction and Overview
2015-04-27Tutorial on Efficient Coding for Interactive Communication via List Decoding
2015-04-27Streaming Lower Bounds for Approximating MAX-CUT
2015-04-27Answering FAQs in CSPs, PGMs, Databases, Logic and Matrix Operations
2015-04-27Exponential Separation of Information and Communication
2015-04-27Small Value Parallel Repetition for General Games



Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Information Theory
Henry Yuen