Deterministic constructions achieving strong convergence without randomness
Construct explicit deterministic sequences of unitary matrices U_1^N, …, U_r^N—e.g., via number-theoretic constructions such as Lubotzky–Phillips–Sarnak expanders—that strongly converge to free Haar unitaries, meaning that for every *-polynomial P, lim_{N→∞} ||P(U_1^N, …, U_r^N)|| = ||P(u_1, …, u_r)||.
References
Could one hope to achieve strong convergence with no randomness at all, using number-theoretic constructions such as those that have been used to obtain regular graphs with optimal spectral properties ? These tantalizing questions remain very much open.
The authors are also grateful to Stanis{aw J.~Szarek who pointed out that related classical derandomization problems have been approached through constructions based on expander graphs and it remains open how to construct a quantum version of it.
Besides, in free probability theory, it remains a major challenge whether an explicit, deterministic strong convergence phenomenon can be constructed, see Section 6.4.