Summer Cluster in Quantum Computation | Polylogues

Summer Cluster in Quantum Computation | Polylogues

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


Category:
Vlog
Duration: 31:33
3,401 views
49

This summer, the Simons Institute hosted our first indoor research activity in sixteen months, the 2021 Summer Cluster in Quantum Computation.

In this episode of Polylogues, cluster organizer and Director for Quantum Computing Umesh Vazirani sits down with the other members of the organizing team to discuss some of the themes of the cluster: quantum complexity theory, quantum protocols and the nature of entanglement, quantum algorithms, and quantum chemistry.

Featuring: Sandy Irani (UC Irvine), James Whitfield (Dartmouth College), and Henry Yuen (Columbia University).

This production is an activity of the Simons Institute's Research Pod in Quantum Computing, and is funded by the Department of Energy (via the Quantum Systems Accelerator) and the National Science Foundation (via a Quantum Leap Challenge Institutes award).

© Simons Institute for the Theory of Computing, 2021



Other Videos By Simons Institute for the Theory of Computing


2021-09-01Sampling Crash Course (continued)
2021-08-31Sampling Crash Course
2021-08-31Geodesic Convexity and Optimization
2021-08-31Optimization on Manifolds
2021-08-31Optimization Crash Course (continued)
2021-08-30Optimization Crash Course
2021-08-28Optimal Iterative Algorithms for Problems With Random Data (continued)
2021-08-28Optimal Iterative Algorithms for Problems With Random Data
2021-08-28Average-Case Complexity Theory (continued)
2021-08-27Average-Case Complexity Theory
2021-08-27Summer Cluster in Quantum Computation | Polylogues
2021-08-27Approximate Message Passing Algorithms (continued)
2021-08-27Approximate Message Passing Algorithms
2021-08-27Average-Case Complexity Theory (continued)
2021-08-26Average-Case Complexity Theory
2021-08-26On Algorithms and Barriers of Intractability in High-Dimensional Statistical Inference (continued)
2021-08-26On Algorithms and Barriers of Intractability in High-Dimensional Statistical Inference
2021-08-26Lower Bounds on Statistical Estimation Rates Under Various Constraints (continued)
2021-08-25Lower Bounds on Statistical Estimation Rates Under Various Constraints
2021-08-25On Algorithms and Barriers of Intractability in High-Dimensional Statistical Inference (continued)
2021-08-25On Algorithms and Barriers of Intractability in High-Dimensional Statistical Inference


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
quantum computing
Umesh Vazirani
Henry Yuen
James whitfield
quantum computers
sandy irani
quantum complexity
entanglement
quantum algorithms