Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0603009 · Journal of Algebra

Deciding universality of quantum gates

Gábor Ivanyos

Published Oct 24, 2006• 1 citation
arXivHTMLPDF
DOI
10.1016/j.jalgebra.2006.09.013

Related papers

Quantum Gates with a Selective Interaction

E. Solano, França M. Santos, P. Milman

Lecture notes in physics•Jan 1, 2001•2 citations

Universality of Single-Qudit Gates

Adam Sawicki, Katarzyna Karnas

We consider the problem of deciding if a set of quantum one-qudit gates $$\mathcal {S}=\{g_1,\ldots ,g_n\}\subset G$$ is universal, i.e. if $${<}\mathcal {S}{>}$$ is dense in G, where G is either the special unitary or the special orthogonal group. To every gate g in $$\mathcal {S}$$ we assign the orthogonal matrix $$\mathrm {Ad}_g$$ that is image of g under the adjoint representation $$\mathrm {Ad}:G\rightarrow SO(\mathfrak {g})$$ and $$\mathfrak {g}$$ is the Lie algebra of G. The necessary condition for the universality of $$\mathcal {S}$$ is that the only matrices that commute with all $$\mathrm {Ad}_{g_i}$$ ’s are proportional to the identity. If in addition there is an element in $${<}\mathcal {S}{>}$$ whose Hilbert–Schmidt distance from the centre of G belongs to $$]0,\frac{1}{\sqrt{2}}[$$ , then $$\mathcal {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.

arXiv:1609.05780•Annales Henri Poincaré•Aug 10, 2017•36 citations

Universality in Quantum Computation

Emmanuel Jeandel

Lecture notes in computer science•Jan 1, 2004•6 citations

Criteria for universality of quantum gates

Adam Sawicki, Katarzyna Karnas

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.

arXiv:1610.00547•Physical Review A•Jun 5, 2017•26 citations

A Quantum Gate as a Physical Model of an Universal Arithmetical Algorithm without Church's Undecidability and Godel's Incompleteness

Vladan Panković, Milan Predojević

In this work we define an universal arithmetical algorithm, by means of the standard quantum mechanical formalism, called universal qm-arithmetical algorithm. By universal qm-arithmetical algorithm any decidable arithmetical formula (operation) can be decided (realized, calculated. Arithmetic defined by universal qm-arithmetical algorithm called qm-arithmetic one-to-one corresponds to decidable part of the usual arithmetic. We prove that in the qm-arithmetic the undecidable arithmetical formulas (operations) cannot exist (cannot be consistently defined). Or, we prove that qm-arithmetic has no undecidable parts. In this way we show that qm-arithmetic, that holds neither Church's undecidability nor Godel's incompleteness, is decidable and complete. Finally, we suggest that problems of the foundation of the arithmetic, can be solved by qm-arithmetic.

arXiv:quant-ph/0602009•Feb 1, 2006•0 citations

A Lie-algebraic Criterion for the Universality of Exponentiated Quantum Gates

Yinuo Xue, Qian Chen, Jing-Song Huang

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.

quant-pharXiv:2604.25971•Apr 29, 2026•0 citations
We consider the problem of deciding if a set of quantum one-qudit gates S={g1,…,gn}⊂G\mathcal {S}=\{g_1,\ldots ,g_n\}\subset GS={g1​,…,gn​}⊂G is universal, i.e. if <S>{<}\mathcal {S}{>}<S> is dense in G, where G is either the special unitary or the special orthogonal group. To every gate g in S\mathcal {S}S we assign the orthogonal matrix Adg\mathrm {Ad}_gAdg​ that is image of g under the adjoint representation Ad:G→SO(g)\mathrm {Ad}:G\rightarrow SO(\mathfrak {g})Ad:G→SO(g) and g\mathfrak {g}g is the Lie algebra of G. The necessary condition for the universality of S\mathcal {S}S is that the only matrices that commute with all Adgi\mathrm {Ad}_{g_i}Adgi​​ ’s are proportional to the identity. If in addition there is an element in <S>{<}\mathcal {S}{>}<S> whose Hilbert–Schmidt distance from the centre of G belongs to ]0,12[]0,\frac{1}{\sqrt{2}}[]0,2​1​[ , then S\mathcal {S}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.
In this work we define an universal arithmetical algorithm, by means of the standard quantum mechanical formalism, called universal qm-arithmetical algorithm. By universal qm-arithmetical algorithm any decidable arithmetical formula (operation) can be decided (realized, calculated. Arithmetic defined by universal qm-arithmetical algorithm called qm-arithmetic one-to-one corresponds to decidable part of the usual arithmetic. We prove that in the qm-arithmetic the undecidable arithmetical formulas (operations) cannot exist (cannot be consistently defined). Or, we prove that qm-arithmetic has no undecidable parts. In this way we show that qm-arithmetic, that holds neither Church's undecidability nor Godel's incompleteness, is decidable and complete. Finally, we suggest that problems of the foundation of the arithmetic, can be solved by qm-arithmetic.
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.