arxiv: 2604.25971 · v1 · submitted 2026-04-28 · 🪐 quant-ph

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

Yinuo Xue , Qian Chen , Jing-Song Huang This is my paper

Pith reviewed 2026-05-07 16:47 UTC · model grok-4.3

classification 🪐 quant-ph

keywords qudituniversalityLie algebraBorel-de Siebenthalinvariant subspacesgraph connectivityexponentiated gatesquantum gates

0 comments

The pith

A Lie-algebraic criterion decides if a finite set of exponentiated qudit gates is universal.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper establishes a Lie-algebraic criterion for deciding the universality of finite sets of exponentiated qudit gates. The approach uses Borel-de Siebenthal theory on a diagonal generator with incommensurate spectrum to identify invariant subspaces, which correspond to disconnected components in a graph. If the graph is connected, the gates generate a universal set; otherwise, generators can be added to connect the components and achieve universality. The method supports a polynomial-time algorithm and proves that two generators are always sufficient for universal control on qudits.

Core claim

The central discovery is that universality holds exactly when the Lie algebra generated by the Hamiltonians acts irreducibly, which is equivalent to the graph of basis vectors being connected under the action of the off-diagonal terms from the chosen diagonal generator. Non-universality is thus detected by graph disconnections, and can be fixed by adding couplings. The authors show two generators suffice to ensure this connectivity for any qudit dimension.

What carries the argument

Borel-de Siebenthal theory applied to a diagonal generator with incommensurate spectrum, which reduces universality to checking connectivity of a graph whose vertices are the standard basis states.

If this is right

Universality of any finite gate set can be decided algorithmically in polynomial time.
Non-universal sets can be made universal by adding generators that couple disconnected graph components.
Two generators are sufficient to achieve universal control for qudits of any dimension.
The universality problem is equivalent to checking irreducibility of the associated Lie algebra representation.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

This approach could be applied to design minimal gate sets for qudit-based quantum computers.
It may connect to similar connectivity criteria in classical linear control systems.
Explicit constructions for the two generators could be derived for specific qudit dimensions to test the result.
The criterion might help analyze universality in systems with additional symmetries or constraints.

Load-bearing premise

The detection of invariant subspaces relies on the existence of a diagonal generator whose spectrum is incommensurate.

What would settle it

Explicit computation for a small qudit system, such as qutrits with a known universal or non-universal set, where the graph connectivity disagrees with the actual generated algebra's irreducibility.

read the original abstract

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.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper gives a graph-connectivity test for Lie-algebra universality of exponentiated qudit gates and claims two generators suffice, but the test only works if a suitable diagonal generator with incommensurate spectrum exists inside the algebra.

read the letter

The punchline is that this work turns the universality question for qudit gates into a graph problem on invariant subspaces, using Borel-de Siebenthal theory applied to a diagonal element. It also shows that two generators are enough for universal control in this setting. That combination looks like the actual new piece, not just a rephrasing of older Lie-algebra results on quantum control.

Referee Report

2 major / 2 minor

Summary. The manuscript claims to introduce a Lie-algebraic criterion based on Borel-de Siebenthal theory for deciding the universality of finite sets of exponentiated qudit gates. Using a diagonal generator with incommensurate spectrum, non-universality is identified by disconnected components in a graph representing invariant subspaces, allowing repair by adding inter-component couplings. The paper also establishes that two such generators are sufficient for achieving universal control and connects this to the irreducibility of the associated Lie algebra representations. A polynomial-time algorithm is purportedly derived from this criterion.

Significance. If the central claims hold, the work would provide a valuable polynomial-time decision procedure for universality in qudit systems, along with a constructive repair method and a minimality result showing two generators suffice. The explicit link to Borel-de Siebenthal theory and representation irreducibility strengthens the connection between classical Lie theory and quantum control, offering a structured framework that could aid in analyzing higher-dimensional gate sets.

major comments (2)

[§3 and §4] §3 (Criterion statement) and §4 (Graph construction): The universality test and graph-connectivity obstruction are defined only after selecting a diagonal generator H with incommensurate spectrum inside the generated Lie algebra; no general existence proof or algorithm is given to guarantee such an H exists for arbitrary finite input sets of Hamiltonians, rendering the detection and repair steps inapplicable when the condition fails.
[§5] §5 (Two-generator theorem): The proof that two generators suffice for universal control inherits the same dependency on the incommensurate-spectrum diagonal element; without a demonstration that such an element can always be found or constructed within the algebra generated by any two suitable Hamiltonians, the minimality claim lacks full justification.

minor comments (2)

[Abstract and §6] The abstract asserts a polynomial-time algorithm, but the main text should include an explicit complexity bound or pseudocode for the decision procedure (including how the graph is built and connectivity checked) to make the claim verifiable.
[§2] Notation for the Lie algebra generated by the Hamiltonians and the adjoint action graph could be clarified with a small example in an early section to aid readability.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the thorough review and valuable feedback on our manuscript. The comments correctly identify that the applicability of the criterion and the two-generator result depend on the existence of a suitable diagonal generator with incommensurate spectrum. We address these points directly below and will incorporate the necessary additions in the revised version.

read point-by-point responses

Referee: [§3 and §4] §3 (Criterion statement) and §4 (Graph construction): The universality test and graph-connectivity obstruction are defined only after selecting a diagonal generator H with incommensurate spectrum inside the generated Lie algebra; no general existence proof or algorithm is given to guarantee such an H exists for arbitrary finite input sets of Hamiltonians, rendering the detection and repair steps inapplicable when the condition fails.

Authors: We agree that the presentation in §§3–4 presupposes the existence of such an H without supplying an explicit general proof or construction procedure. This is a genuine omission in the current manuscript. In the revision we will insert a new subsection (immediately following the criterion statement) that proves existence: for any finite set of Hamiltonians whose generated Lie algebra is semisimple (the generic case for universality questions), a regular element of a Cartan subalgebra with incommensurate spectrum always exists by the density of regular elements and the fact that the set of elements with rationally independent eigenvalues is open and dense in the Cartan. We will also supply a simple polynomial-time numerical procedure (random perturbation within the algebra followed by diagonalization) that finds an approximate such H to any desired precision, thereby rendering the graph-construction and repair steps unconditionally applicable. revision: yes
Referee: [§5] §5 (Two-generator theorem): The proof that two generators suffice for universal control inherits the same dependency on the incommensurate-spectrum diagonal element; without a demonstration that such an element can always be found or constructed within the algebra generated by any two suitable Hamiltonians, the minimality claim lacks full justification.

Authors: The referee is correct that the two-generator theorem inherits the same prerequisite. We will extend the existence argument developed for the revised §3 to the two-generator setting: when two Hamiltonians generate a Lie algebra that is not contained in any proper Borel–de Siebenthal subalgebra, the same density argument guarantees a regular Cartan element with incommensurate spectrum inside that algebra. The revised proof of the minimality result will explicitly invoke this construction, thereby removing the dependency and completing the justification. revision: yes

Circularity Check

0 steps flagged

No significant circularity; applies external Borel-de Siebenthal theory without self-referential reduction

full rationale

The derivation formulates universality in Lie-algebraic terms and invokes Borel-de Siebenthal theory on a diagonal generator with incommensurate spectrum to identify invariant subspaces via graph connectivity. This is an application of an established external theorem rather than a self-definition, fitted parameter renamed as prediction, or load-bearing self-citation. The additional claim that two generators suffice is presented as a proved result, not derived by construction from inputs. No equations or steps in the abstract or description reduce a claimed prediction or criterion to its own fitted values or prior self-referential assumptions. The method is self-contained against the external mathematical benchmark of Borel-de Siebenthal theory, with the spectrum condition serving as a stated applicability assumption rather than a circular dependency.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on standard Lie-algebraic and representation-theoretic background; no free parameters, new entities, or ad-hoc axioms are introduced in the abstract.

axioms (1)

domain assumption Borel-de Siebenthal theory applies to the relevant Lie-algebra representations of qudit Hamiltonians when a diagonal generator with incommensurate spectrum is chosen.
Invoked to detect invariant subspaces and graph-connectivity obstructions.

pith-pipeline@v0.9.0 · 5401 in / 1305 out tokens · 44449 ms · 2026-05-07T16:47:01.875149+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

18 extracted references · 1 canonical work pages

[1]

, ϕd 2π are linearly independent over Q, then ⟨g⟩=T U(d) .Thengis said to be general, and X= diag(iϕ 1,

ForU(d), if1, ϕ1 2π , . . . , ϕd 2π are linearly independent over Q, then ⟨g⟩=T U(d) .Thengis said to be general, and X= diag(iϕ 1, . . . , iϕd)∈u(d)a diagonal general di- rection
[2]

Xis Universal (H ε =G)

ForSU(d), letg= diag(e iϕ1 , . . . , eiϕd)∈SU(d)with ϕ1 +· · ·+ϕ d ≡0 (mod 2π). If1, ϕ1 2π , . . . , ϕd−1 2π are linearly independent overQ, then ⟨g⟩=T SU(d) .Then gis said to be general, andX= diag(iϕ 1, . . . , iϕd)∈ su(d)a diagonal general direction. Such diagonal general directions can be chosen explicitly and are built into our construction. The line...
[3]

Random bosonic states for ro- bust quantum metrology,

M. Oszmaniec, R. Augusiak, C. Gogolin, J. Kołody ´nski, A. Acin, and M. Lewenstein, “Random bosonic states for ro- bust quantum metrology,” Physical Review X6, 041044 (2016)

2016
[4]

Convexity of mo- mentum map, morse index, and quantum entanglement,

A. Sawicki, M. Oszmaniec, and M. Ku ´s, “Convexity of mo- mentum map, morse index, and quantum entanglement,” Re- views in Mathematical Physics26, 1450004 (2014)

2014
[5]

Criteria for exact qudit universality,

G. K. Brennen, D. P. O’Leary, and S. S. Bullock, “Criteria for exact qudit universality,” Physical Review A—Atomic, Molec- ular, and Optical Physics71, 052318 (2005)

2005
[6]

Universality of single-qudit gates,

A. Sawicki and K. Karnas, “Universality of single-qudit gates,” inAnnales Henri Poincar ´e, V ol. 18 (Springer, 2017) pp. 3515– 3552

2017
[7]

J. R. van Meter,Universality of swap for qudits: a represen- tation theory approach, Ph.D. thesis, University of Colorado at Boulder (2021)

2021
[8]

Notions of controllability for bilinear multilevel quantum systems,

F. Albertini and D. D’Alessandro, “Notions of controllability for bilinear multilevel quantum systems,” IEEE Transactions on Automatic Control48, 1399–1403 (2003)

2003
[9]

R. K. Brylinski and G. Chen,Mathematics of Quantum Com- putation, Computational Mathematics (CRC Press, 2002)

2002
[10]

Oszmaniec and Z

M. Oszmaniec and Z. Zimbor ´as, “Universal extensions of re- stricted classes of quantum operations,” Phys. Rev. Lett.119, 220502 (2017), arXiv:1705.11188 [quant-ph]

work page arXiv 2017
[11]

Les sous-groupes ferm´es de rang maximum des groupes de lie clos,

A. Borel and J. de Siebenthal, “Les sous-groupes ferm´es de rang maximum des groupes de lie clos,” Commentarii Mathematici Helvetici23, 200–221 (1949)

1949
[12]

Br ¨ocker and T

T. Br ¨ocker and T. Dieck,Representations of Compact Lie Groups, Graduate Texts in Mathematics, V ol. 98 (Springer- Verlag, New York, 1985)

1985
[13]

Subgroups of the unitary group that contain the group of diagonal matrices,

Z. I. Borevich and S. L. Krupetskii, “Subgroups of the unitary group that contain the group of diagonal matrices,” Journal of Mathematical Sciences17, 1951–1959 (1981)

1951
[14]

Complete control- lability of quantum systems,

S. G. Schirmer, H. Fu, and A. I. Solomon, “Complete control- lability of quantum systems,” Physical Review A63, 63410– 63410 (2001)

2001
[15]

Quantum wave function controlla- bility,

G. Turinici and H. Rabitz, “Quantum wave function controlla- bility,” Chemical Physics267, 1–9 (2001)

2001
[16]

Smooth manifolds,

J. M. Lee, “Smooth manifolds,” inIntroduction to smooth man- ifolds(Springer, 2003) pp. 1–29

2003
[17]

Maximal subgroups of compact lie groups,

F. Antoneli, M. Forger, and P. Gaviria, “Maximal subgroups of compact lie groups,” Journal of Lie Theory22, 949–1024 (2012)

2012
[18]

On bases of g-invariant endomor- phism algebras,

J-S. Huang and Y . Zhao, “On bases of g-invariant endomor- phism algebras,” Rad Hrvatske akademije znanosti i umjetnosti. Matematiˇcke znanosti , 339–352 (2024). S1 Supplemental Material In this Supplemental Material, we provide the detailed proofs and extended derivations supporting the results in the main text. We may reiterate some of the steps to ensu...

2024