Quantum
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=p5ULbrP6UJQ
4Bounds on the QAC0 Complexity of Approximating Parity
Gregory Rosenthal (University of Toronto)
Lower Bounds on the Running Time of Two-Way Quantum Finite Automata and Sublogarithmic-
Space Quantum Turing Machines
Zachary Remscrim (The University of Chicago)
Time-Space Lower Bounds for Proof Systems with Quantum and Randomized Verifiers
Abhijit Mudigonda (None), Ryan Williams (MIT)
Self-testing of a single quantum device under computational assumptions
Tony Metger, Thomas Vidick (California Institute of Technology)
Distributed Quantum Proofs for Replicated Data
Pierre Fraigniaud (CNRS and University Paris Diderot), François Le Gall (Nagoya University), Harumichi Nishimura (Nagoya University), Ami Paz (University of Vienna)
ITCS 2021
Other Videos By Simons Institute for the Theory of Computing
| 2021-01-12 | Algorithmic Game Theory |
| 2021-01-12 | Optimization |
| 2021-01-12 | Codes and information |
| 2021-01-12 | Machine Learning |
| 2021-01-11 | Circuits and communication |
| 2021-01-10 | Graph algorithms |
| 2021-01-10 | Algorithms |
| 2021-01-10 | GRADUATING BITS |
| 2021-01-10 | Algorithmic game theory |
| 2021-01-10 | Quantum information |
| 2021-01-10 | Quantum |
| 2021-01-09 | Analytic methods |
| 2021-01-09 | Computational complexity |
| 2021-01-08 | Distributed models |
| 2021-01-08 | Pseudorandomness |
| 2021-01-08 | Crypto and Privacy |
| 2021-01-08 | Matchings |
| 2021-01-08 | Introductory Remarks |
| 2020-12-28 | David Harold Blackwell Summer Research Institute | Interview with Jelani Nelson |
| 2020-12-19 | Recent Developments in Supervised Learning With Noise |
| 2020-12-19 | Testing and Reconstruction via Decision Trees |
Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
ITCS 2021