Explicit Orthogonal and Unitary Designs
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=uq5PFqPZMK4
Ryan O'Donnell (Carnegie Mellon University)
https://simons.berkeley.edu/talks/ryan-odonnell-carnegie-mellon-university-2023-06-26
Beyond the Boolean Cube
We give a strongly explicit construction of π-approximate π-designs for the orthogonal group O(π) and the unitary group U(π), for π = 2βΏ. Our designs are of cardinality poly(πα΅/π) (equivalently, they have seed length π(ππ + log(1/π))); up to the polynomial, this matches the number of design elements used by the construction consisting of completely random matrices.
Joint work with Pedro Paredes (Princeton) and Rocco Servedio (Columbia).
Other Videos By Simons Institute for the Theory of Computing
Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Beyond the Boolean Cube
Ryan O'Donnell