Lecturer: Gábor Ivanyos

A collection of n-qubit gates is universal if there exists N such that for every _{0} ≥ nN ≥ N every _{0}N-qubit unitary operation can be approximated with arbitrary precision by a circuit built from gates of the collection. Decidability of universality follows from an upper bound on the smallest N with the above property. The bound is roughly _{0}2.
The proof is based on a recent result of Guralnick and Tiep on invariants of (finite) linear groups.
^{8}n |