Center for Theoretical Physics
The Universality Problem in Quantum Computing asks if a finite set of single - qudit gates is universal, i.e. if we can approximate to arbitrary precision any other single - qudit gate by composing such gates. We describe two solutions to this problem: the first uses the adjoint representation and some additional tool, whereas the second exploits only a "large enough" representation (depending on the value of d).
Auditorium of the Institute of Physics PAS, Al. Lotników 32/46 and online