A Survey on the Complexity of Entangled Provers

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


Duration: 1:02:40
167 views
1

Zhengfeng Ji, University of Waterloo
Quantum Games and Protocols
http://simons.berkeley.edu/talks/zhengfeng-ji-2014-02-25



Other Videos By Simons Institute for the Theory of Computing


2014-03-06Semidefinite Hierarchies in Quantum Information
2014-03-06Games and Grothendieck's Tensor Norms
2014-03-06Entanglement in Many Body Quantum Systems
2014-03-06How to Delegate Computations: The Power of No-Signaling Proofs
2014-03-06Infinite Randomness Expansion with a Constant Number of Devices
2014-03-06Forcing Trust: Nonlocal Games and Untrusted-device Cryptography
2014-03-06Delegated Quantum Computation from Sequential Games
2014-03-06Quantum Obfuscation of Classical Circuits
2014-03-06How to Encrypt a Functionality
2014-03-06Quantum Proofs of Knowledge
2014-03-06A Survey on the Complexity of Entangled Provers
2014-03-06An Approach To The Sliding Scale Conjecture Via Parallel Repetition For Low Degree Testing
2014-03-06Limitations for Quantum PCPs
2014-03-06Tick-tock Goes the Clock
2014-03-06From Photonic Quantum Cloud Computing to Interactive Proofs
2014-03-06Blind and Verifiable Quantum Computation
2014-03-06Games to Establish Structure in an Unknown Hilbert Space
2014-03-06Tests for "Quantumness"
2014-02-26Crowd-sourcing Genetic Discovery
2014-02-26Coancestry in the Analysis of Genetic Traits
2014-02-26The Impact of Recent Human Demography on Deleterious Mutation Load and the Genetic...


Tags:
Simons Institute
Quantum Hamiltonian Complexity
UC Berkeley
computer science
theory of computing
Zhengfeng Ji