Infinite Randomness Expansion with a Constant Number of Devices

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


Duration: 27:10
166 views
1

Henry Yuen, Massachusetts Institute of Technology
Quantum Games and Protocols
http://simons.berkeley.edu/talks/henry-yuen-2014-02-26



Other Videos By Simons Institute for the Theory of Computing


2014-03-06Quantum Weak Coin Flipping with Arbitrarily Small Bias
2014-03-06A Parallel Repetition Theorem for Entangled Two-player One-round Games Under Product Distributions
2014-03-06Parallel Repetition of Entangled Games with Exponential Decay via the Superposed Information Cost
2014-03-06Direct Products and Parallel Repetition
2014-03-06A Short Tour of the Laws of Entanglement (And How to Evade Them)
2014-03-06Monogamy of Non-signaling Correlations
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


Tags:
Simons Institute
Quantum Hamiltonian Complexity
UC Berkeley
computer science
theory of computing
Henry Yuen