Classical Verification of Quantum Computational Advantage

Channel:

Subscribers:

68,700

Published on July 15, 2021 4:06:35 PM ● Video Link: https://www.youtube.com/watch?v=0w7RLgZs9jw

Duration: 44:51

326 views

Other Videos By Simons Institute for the Theory of Computing

2021-07-15	Optimization Based Approach for Quantum Signal Processing and Its Energy Landscape
2021-07-15	No Quantum Speedup Over Gradient Descent for Non-Smooth Convex Optimization
2021-07-15	Symmetries, Graph Properties, and Quantum Speedups
2021-07-15	Optimal Learning of Quantum Hamiltonians From High-Temperature Gibbs States
2021-07-15	Hamiltonian Complexity in the Thermodynamic Limit
2021-07-15	(Sub)Exponential Advantage of Adiabatic Quantum Computation With No Sign Problem
2021-07-15	Quantum Garbled Circuits
2021-07-15	Strongly Universal Hamiltonian Simulators
2021-07-15	On the NLTS Conjecture
2021-07-15	Device-Independent Protocols From Computational Assumptions
2021-07-15	Classical Verification of Quantum Computational Advantage
2021-06-17	Breakthroughs — A Refined Laser Method and Faster Matrix Multiplication
2021-05-26	Decoding Nonhuman Communication \| Polylogues
2021-05-21	Conflict-Driven First-Order Decision Procedures
2021-05-21	Solving String Constraints, Starting From the Beginning and From the End
2021-05-20	Look-ahead SAT Solvers: Smart vs. Fast
2021-05-20	Pseudo-Boolean Solving: In Between SAT and ILP
2021-05-20	Searching Inside the Box: A Continuous-Local-Search Approach for Hybrid SAT Solving
2021-05-20	Towards a Complexity-theoretic Understanding of Restarts in SAT solvers
2021-05-20	Using Resolution and Cutting Planes for Verification of Nonlinear Bit-Vector Properties
2021-05-20	The Proof Complexity of Integer Programming

Tags:

Simons Institute

theoretical computer science

UC Berkeley

Computer Science

Theory of Computation

Theory of Computing

Quantum Wave in Computing Reunion

Greg Meyer