Quantum Supremacy via Boson Sampling: Theory and Practice | Quantum Colloquium

Quantum Supremacy via Boson Sampling: Theory and Practice | Quantum Colloquium

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


Duration: 1:11:43
3,029 views
73

Scott Aaronson (University of Texas at Austin)
Quantum Colloquium, Feb 9, 2021
https://simons.berkeley.edu/events/quantum-colloquium

I'll survey the challenges of demonstrating quantum supremacy via BosonSampling, particularly in light of the striking announcement in late 2020 by a group in Hefei, China to have built a BosonSampling device with 50-70 detected photons. I'll discuss the advantages and disadvantages of BosonSampling compared to Random Circuit Sampling (what the Google group demonstrated in 2019) and other NISQ quantum supremacy proposals; and I'll highlight the theoretical open problems that have emerged as the most pressing.



Other Videos By Simons Institute for the Theory of Computing


2021-02-24Deep Dive into CDCL Pseudo-Boolean Solvers (focusing on the implementation in Sat4j)
2021-02-23Quantum Algorithms for Hamiltonian Simulation | Quantum Colloquium
2021-02-22Syntax-Guided Program Synthesis
2021-02-19Rational Synthesis
2021-02-18On the Usefulness of the Strong Exponential Time Hypothesis
2021-02-18Total Function Problems in the Polynomial Hierarchy
2021-02-17Combining SAT and Computer Algebra for Circuit Verification
2021-02-11Hypotheses about Satisfiability and their Consequences
2021-02-11Existentially Polytime Theorems
2021-02-09The Rise of Approximate Model Counting: Beyond Classical Theory and Practice of SAT
2021-02-09Quantum Supremacy via Boson Sampling: Theory and Practice | Quantum Colloquium
2021-02-08Reactive Synthesis
2021-02-06Using SAT Solvers to Prevent Causal Failures in the Cloud
2021-02-05Programming Z3
2021-02-05Approximate Counting and Sampling
2021-02-04Pseudo-Boolean Solving and Optimization
2021-02-03Proof Complexity
2021-02-03Pseudo-Boolean Solving and Optimization 4
2021-02-03Pseudo-Boolean Solving and Optimization 2
2021-02-03Pseudo-Boolean Solving and Optimization 3
2021-02-03Pseudo-Boolean Solving and Optimization 1


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing