@inproceedings{f157bc15370146dda746ae990e22779f,
title = "Explicit orthogonal and unitary designs",
abstract = "We give a strongly explicit construction of ϵ approximate k-designs for the orthogonal group O(N) and the unitary group U(N), for N=2n. Our designs are of cardinality poly(Nk/ϵ) (equivalently, they have seed length O(nk+log(1/ϵ))); up to the polynomial, this matches the number of design elements used by the construction consisting of completely random matrices.",
keywords = "pseudorandomness",
author = "Ryan O'Donnell and Servedio, {Rocco A.} and Pedro Paredes",
note = "Publisher Copyright: {\textcopyright} 2023 IEEE.; 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023 ; Conference date: 06-11-2023 Through 09-11-2023",
year = "2023",
doi = "10.1109/FOCS57990.2023.00073",
language = "English (US)",
series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",
publisher = "IEEE Computer Society",
pages = "1240--1260",
booktitle = "Proceedings - 2023 IEEE 64th Annual Symposium on Foundations of Computer Science, FOCS 2023",
address = "United States",
}