Self-testing of a single quantum device under computational assumptions

Self-testing of a single quantum device under computational assumptions

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


Duration: 22:53
324 views
6

12th Innovations in Theoretical Computer Science Conference (ITCS 2021)
http://itcs-conf.org/

Self-testing of a single quantum device under computational assumptions

Tony Metger
Thomas Vidick (California Institute of Technology)



Other Videos By Simons Institute for the Theory of Computing


2021-01-15On Basing Auxiliary-Input Cryptography on NP-hardness via Nonadaptive Black-Box Reductions
2021-01-15Distributed Quantum Proofs for Replicated Data
2021-01-15On Rich 2-to-1 Games
2021-01-15Theorems of KKL, Friedgut, and Talagrand via Random Restrictions and Log-Sobolev Inequality
2021-01-15Circuit Depth Reductions
2021-01-15Dynamic inference in probabilistic graphical models
2021-01-15A Largish Sum-of-Squares Implies Circuit Hardness and Derandomization
2021-01-15Metrical Service Systems with Transformations
2021-01-15Tight Hardness Results for Training Depth-2 ReLU Networks
2021-01-15Polynomial-time trace reconstruction in the low deletion rate regime
2021-01-15Self-testing of a single quantum device under computational assumptions
2021-01-15Comparison Graphs: a Unified Method for Uniformity Testing
2021-01-15Complexity measures on symmetric group and beyond
2021-01-15The Variable-Processor Cup Game
2021-01-15Even the Easiest(?) Graph Coloring Problem is not Easy in Streaming!
2021-01-15Approximately Strategyproof Tournament Rules in the Probabilistic Setting
2021-01-15A New Model for Ant Trail Formation and its Convergence Properties
2021-01-15The Quantum Supremacy Tsirelson Inequality
2021-01-15Sample efficient identity testing and independence testing of quantum states
2021-01-15Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution
2021-01-15A Polynomial Degree Bound on Equations for Non-rigid Matrices and Small Linear Circuits