Non-Local Binary Games With Noisy Epr States Are Decidable

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=eMTNkWbtDWw


Duration: 46:53
336 views
5

Penghui Yao (Nanjijng University)
https://simons.berkeley.edu/talks/non-local-binary-games-noisy-epr-states-are-decidable
Quantum Protocols: Testing & Quantum PCPs



Other Videos By Simons Institute for the Theory of Computing


2020-04-02Efficient Learning of Pauli Channels
2020-04-02Not All Benchmarks Are Created Equal
2020-04-02Cycle Benchmarking: The New Paradigm for Assessing All Relevant Errors and Error Correlations...
2020-04-02Cross-Platform Verification of Intermediate Scale Quantum Devices with Randomized Measurements
2020-04-01MIP* = RE: Putting Everything Together
2020-04-01MIP* = RE Part 2: PCPs and Introspection
2020-04-01The Algebraic Side of MIP* = RE
2020-04-01Quantum PCPs Meet Derandomization
2020-03-31MIP* = RE Part 1: The Quantum Low-Degree Test
2020-03-31Self-Testing as an Approach to Certifying Quantum Systems
2020-03-31Non-Local Binary Games With Noisy Epr States Are Decidable
2020-03-30Computational Pseudorandomness and Constraints on the Ads/Cft Duality
2020-03-30Predicting Many Properties of a Quantum System from Very Few Measurements
2020-03-30A General Introduction to Quantum Tomography -- and a Specialized Report on Property Testing...
2020-03-30Learning Many-Body Quantum Systems From Local Measurements
2020-03-27Quantum Money based on Lattices
2020-03-27Quantum FHE
2020-03-26MPC with Silent Preprocessing via Pseuodorandom Correlation Generators
2020-03-26Multi-key FHE and Spooky Encryption
2020-03-26Hardness of LWE on General Entropic Distributions
2020-03-25Mixed Functional Encryption: Applications to Traitor Tracing


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Quantum Protocols: Testing & Quantum PCPs
Penghui Yao