Compact-form criteria are provided for deciding universality of a given set of gates in a finite number of steps. The criteria may also indicate what types of gates can be added to a set of nonuniversal gates to turn it into a universal set.
We establish a relationship between the notion of universal quantum gates and the notion of unitary t-designs. We show that a set of qudit gates $\mathcal{S}\ensuremath{\subset}U(d)$ is universal if and only if S forms a $\ensuremath{\delta}$-approximate t(d)-design, where $\ensuremath{\delta}<1, t(2)=6$, and t(d)=4 for $d\ensuremath{\ge}3$. Moreover, we argue that from the application point of view sets S with the $\ensuremath{\delta}$ close to 1 should be regarded as nonuniversal. We also provide a second, more algebraic, criterion for the universality verification. It says that $\mathcal{S}\ensuremath{\subset}U(d)$ is universal if and only if the matrices that commute with ${{U}^{\ensuremath{\bigotimes}t(d)}\ensuremath{\bigotimes}{\overline{U}}^{\ensuremath{\bigotimes}t(d)}|U\ensuremath{\in}\mathcal{S}}$ commute also with ${{U}^{\ensuremath{\bigotimes}t(d)}\ensuremath{\bigotimes}{\overline{U}}^{\ensuremath{\bigotimes}t(d)}|U\ensuremath{\in}U(d)}$, where t(2)=3, and t(d)=2 for $d\ensuremath{\ge}3$. Finally, we show that the complexity of checking this algebraic criterion scales polynomially with the dimension d.
We consider the problem of deciding if a set of quantum one-qudit gates S={g1,…,gn}⊂G is universal, i.e. if <S> is dense in G, where G is either the special unitary or the special orthogonal group. To every gate g in S we assign the orthogonal matrix Adg that is image of g under the adjoint representation Ad:G→SO(g) and g is the Lie algebra of G. The necessary condition for the universality of S is that the only matrices that commute with all Adgi ’s are proportional to the identity. If in addition there is an element in <S> whose Hilbert–Schmidt distance from the centre of G belongs to ]0,21[ , then S is universal. Using these we provide a simple algorithm that allows deciding the universality of any set of d-dimensional gates in a finite number of steps and formulate a general classification theorem.
For given control channels, quantum control theory determines whether quantum gates can be realized, but not their resilience to errors. We address this problem by establishing existence criteria for robust gate implementation in d-level systems. Our criteria reveal that implementability of all gates is not enough: a universal family of robust gates exists if and only if the driven Hamiltonians share no common symmetry. When these criteria hold, we can make gates resilient to any combination of static perturbations, uniform Hamiltonian rescaling, perturbations at a finite set of selected frequencies, and perturbations with arbitrary selected waveforms. We can impose robustness conditions broadly with limited information about errors, e.g., against any static perturbations; we can also tailor these conditions to the platform, e.g., against environment-induced noise with dominant spectral peaks, requiring no spectral details beyond the peak frequencies. We numerically construct explicit protocols for robust gates, reducing average gate infidelity by approximately two to seven orders of magnitude under Hamiltonian perturbations and environment-induced noise. Together, our existence criteria and numerical constructions provide practical guidance for evaluating the potential of quantum platforms and designing robust quantum gates.
We provide two simple universality criteria. Our first criterion states that S⊂Gd:=U(d) is universal if and only if S forms a δ-approximate t(d)-design, where t(2)=6 and t(d)=4 for d≥3. Our second universality criterion says that S⊂Gd is universal if and only if the centralizer of St(d),t(d)={U⊗t(d)⊗Uˉ⊗t(d)∣U∈S} is equal to the centralizer of Gdt(d),t(d)={U⊗t(d)⊗Uˉ⊗t(d)∣U∈Gd}, where t(2)=3, and t(d)=2 for d≥3. The equality of the centralizers can be verified by comparing their dimensions.
We present a criterion that serves as the basis for a polynomial-time algorithm to decide whether a finite set of qudit gates exponentiated by some Hamiltonians is universal. Our approach formulates universality in Lie algebraic terms and applies Borel--de Siebenthal theory with a diagonal generator having incommensurate spectrum. In this framework, nonuniversality is detected by invariant subspaces, equivalently by a graph-connectivity obstruction, while universality is repaired by adding generators that couple disconnected components. We further prove that two generators are sufficient for universal control. Our work reveals a profound link between qudit universality and irreducibility of Lie algebra representations.