Universality verification for a set of quantum gates"

Lorenzo

Mattioli

CTP PAS

December 22, 2021 3:15 PM

The Universality Problem asks whether a finite set of one-qudit gates is universal, i.e. we can approximate arbitrarily well any other one-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).

__________________________________________________________
Zoom meeting details

Topic: Quantum Information and Quantum Computing Working Group
Time: Wednesday, 22.12.2021, 15:15 Warsaw (CET)

Join Zoom Meeting
https://tinyurl.com/ctp-quantum


Meeting ID: 96294497969
Passcode: 729533

If you encounter any problems with connecting to the Zoom meeting, please email to calegari@cft.edu.pl.

__________________________________________________________