ITCS 2022 Session 7
0Chair: Frederic Magniez
Lower Bounds on Stabilizer Rank
Shir Peleg and Amir Shpilka (Tel-Aviv University); Ben Lee Volk (UT Austin)
Classical algorithms and quantum limitations for maximum cut on high-girth graphs
Boaz Barak (Harvard University); Kunal Marwaha (Berkeley Center for Quantum Information and Computation)
Eliminating Intermediate Measurements using Pseudorandom Generators
Uma Girish and Ran Raz (Princeton University)
A lower bound on the space overhead of fault-tolerant quantum computation
Omar Fawzi (Inria, ENS Lyon); Alexander Müller-Hermes (Institut Camille Jordan, Université Claude Bernard Lyon 1); Ala Shayeghi (Inria, ENS Lyon)
Quantum Distributed Algorithms for Detection of Cliques [
Keren Censor-Hillel (Technion); Orr Fischer (Tel Aviv University); François Le Gall (Nagoya University); Dean Leitersdorf (Technion); Rotem Oshman (Tel Aviv University)
13th Innovations in Theoretical Computer Science (ITCS) Conference
Other Videos By Simons Institute for the Theory of Computing
| 2022-02-02 | ITCS 2022 Session 15 |
| 2022-02-02 | ITCS 2022 Session 14 |
| 2022-02-02 | ITCS 2022 Session 13 |
| 2022-02-02 | ITCS 2022 Graduating Bits |
| 2022-02-02 | ITCS 2022 Session 12 |
| 2022-02-02 | ITCS 2022 Session 11 |
| 2022-02-02 | ITCS 2022 Session 10 |
| 2022-02-02 | ITCS 2022 Session 9 |
| 2022-02-02 | ITCS 2022 Session 8 |
| 2022-02-01 | ITCS 2022 Graduating Bits |
| 2022-02-01 | ITCS 2022 Session 7 |
| 2022-02-01 | Uniform brackets, containers, and combinatorial Macbeath regions |
| 2022-02-01 | FPT Algorithms for Finding Near-Cliques in $c$-Closed Graphs |
| 2022-02-01 | Counting and Sampling Perfect Matchings in Regular Expanding Non-Bipartite Graphs |
| 2022-02-01 | ITCS 2022 Session 6 |
| 2022-02-01 | ITCS 2022 Session 5 |
| 2022-02-01 | ITCS 2022 Session 4 |
| 2022-02-01 | ITCS 2022 Session 3 |
| 2022-01-31 | ITCS 2022 Session 2 |
| 2022-01-31 | ITCS 2022 Session 1 |
| 2022-01-31 | Randomness Extraction from Somewhat Dependent Sources |