A Tensor Network View of Kitaev's Lower Bound for Strong Coin Flipping

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


Duration: 29:17
370 views
2

Zeph Landau, UC Berkeley
Quantum Games and Protocols
http://simons.berkeley.edu/talks/zeph-landau-2014-02-28



Other Videos By Simons Institute for the Theory of Computing


2014-03-27Birth and Death of Fragile Chromosomal Regions in Mammalian Evolution
2014-03-27Variation in Regulatory Information Within and Between Species
2014-03-27Interaction-based Evolution: How Natural Selection and Non-accidental Mutation Work Together
2014-03-27What Limits the Efficiency of Natural Selection?
2014-03-27Presentation of Evolution and Algorithms
2014-03-27The Evolution of Evolvability
2014-03-27Molecular Errors, Cryptic Sequences, and Evolvability
2014-03-27Presentation of Evolvability
2014-03-20Quantum Hamiltonian Complexity
2014-03-06Verification of BosonSampling Devices
2014-03-06A Tensor Network View of Kitaev's Lower Bound for Strong Coin Flipping
2014-03-06Quantum and Classical Coin-flipping Protocols Based on Bit-commitment and their Point Games
2014-03-06Quantum Cryptography: From Theory to Practice
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


Tags:
Simons Institute
Quantum Hamiltonian Complexity
UC Berkeley
computer science
theory of computing
Zeph Landau