Blind and Verifiable Quantum Computation

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


Duration: 39:24
1,228 views
13

Joe Fitzsimons, Singapore University of Technology and Design
Quantum Games and Protocols
http://simons.berkeley.edu/talks/joe-fitzsimons-2014-02-24



Other Videos By Simons Institute for the Theory of Computing


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...
2014-02-26Identifying Recombination Hot Spots from Sequence Polymorphism Data
2014-02-26Correcting for Confounding in Genetic Studies
2014-02-26A Tree-based Approach to Inferring Past Population Size Changes and Separation Times
2014-02-26Quantifying the Extent of Geographic Signature in the Human Genome
2014-02-26Probabilistic Models for Spatial Geographic Localization


Tags:
Simons Institute
Quantum Hamiltonian Complexity
UC Berkeley
computer science
theory of computing
Joe Fitzsimons