focs 2024 2c simple constructions of linear-depth t-designs and pseudorandom unitaries
Published 3 weeks ago • 26 plays • Length 19:03Download video MP4
Download video MP3
Similar videos
-
18:33
focs 2024 nearly optimal list labeling
-
19:05
focs 2024 7b new structures and algorithms for length-constrained expander decompositions
-
16:12
focs 2024 4b sum-of-squares lower bounds for non-gaussian component analysis
-
16:22
focs 2024 7c computing approximate centerpoints in polynomial time
-
20:31
focs 2024 6a certifying almost all quantum states with few single-qubit measurements
-
23:17
pseudoentanglement ain't cheap | grewal, iyer, kretschmer, liang | tqc 2024
-
![[icfp'23] fp²: fully in-place functional programming](https://i.ytimg.com/vi/XmVc4-_3HgE/mqdefault.jpg)
29:59
[icfp'23] fp²: fully in-place functional programming
-
59:56
pseudoentanglement
-
9:23
premiere - conf42 quantum computing 2024
-
21:31
focs 2024 1a minor containment and disjoint paths in almost-linear time
-
17:56
focs 2024 10c gradient descent for unbounded convex functions on hadamard manifolds
-
20:00
focs 2024 2a optimal coding theorems for randomized kolmogorov complexity
-
19:33
focs 2024 3b tight bounds for classical open addressing
-
18:12
focs 2024 3c deterministic algorithm and faster algorithm for submodular maximization
-
22:13
focs 2024 6c strong vs. weak range avoidance and the linear ordering principle
-
19:40
focs 2024 7b improved distance (sensitivity) oracles with subquadratic space
-
20:13
focs 2024 3a reverse mathematics of complexity lower bounds
-
19:17
focs 2024 6b benchmark-tight approximation ratio of simple mechanism for a unit-demand buyer
-
22:48
focs 2024 8c near-optimal (1 epsilon)-approximate fully-dynamic all-pairs shortest paths in planar