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:2609.30283

Restricting Trainable Lie-Algebra Growth in Equivariant Quantum Networks via Hierarchical Ancilla-Controlled Subspace Projections

Ting Li, Zhiming Xiao, Qibiao Tang

quant-phSubmitted Sep 3, 2026• Announced Sep 4, 2026• 0 citations
arXivHTMLPDF

Abstract

Equivariant quantum networks encode symmetry as an inductive bias, which can improve generalization and may also favor optimization convergence. Equivariance alone, however, does not constrain the noncommuting closure of trainable generators, and this closure can still grow rapidly in symmetry-preserving variational circuits. We introduce a hierarchical ancilla-controlled architecture that addresses this Lie-algebra-growth mechanism. Commuting invariant-sector projectors on the data register select parameterized operations on a shared ancilla register, where the noncommuting trainable dynamics is confined. The trainable circuit decomposes into compatible joint sectors, giving a sector-probability-weighted ancilla response and an explicit view of parameter sharing across hierarchical paths. For an ancilla dimension $d_A=2^m$ and $K_\ell$ retained layer-wise control modes, we prove the group-independent bound $\dim(\mathfrak g)\le (d_A^2-1)\prod_{\ell=1}^{L}(K_\ell+1)$. The bound is polynomial in the number of data qubits when $m$ and $K_\ell$ remain constant along a logarithmic-depth hierarchy. Particle-number and parity projectors illustrate the general construction, while a fixed Clebsch--Gordan coupling tree supplies a concrete $SU(2)$ realization with rotation-invariant scalar outputs. Finite-size state-vector simulations exhibit slower gradient-variance decay and larger initialization gradients than generic and conventional rotationally equivariant circuits over the studied system sizes. The same realization fits sparse rotation-invariant classification tasks and geometry-dependent Heisenberg ground-state energies. These results support restricted trainable Lie-algebra growth as a structural strategy for initialization trainability in the regimes considered here.

Comments
19 pages,9 figures

Related papers

Special-Unitary Parameterization for Trainable Variational Quantum Circuits

Kuan-Cheng Chen, Hua-an Tseng, Samuel Yen-Chi Chen +2 more

We propose SUN-VQC, a variational-circuit architecture whose elementary layers are single exponentials of a symmetry-restricted Lie subgroup, $\mathrm{SU}(2^{k}) \subset \mathrm{SU}(2^{n})$ with $k \ll n$. Confining the evolution to this compact subspace reduces the dynamical Lie-algebra dimension from $\mathcal{O}(4^{n})$ to $\mathcal{O}(4^{k})$, ensuring only polynomial suppression of gradient variance and circumventing barren plateaus that plague hardware-efficient ansätze. Exact, hardware-compatible gradients are obtained using a generalized parameter-shift rule, avoiding ancillary qubits and finite-difference bias. Numerical experiments on quantum auto-encoding and classification show that SUN-VQCs sustain order-of-magnitude larger gradient signals, converge 2--3$\times$ faster, and reach higher final fidelities than depth-matched Pauli-rotation or hardware-efficient circuits. These results demonstrate that Lie-subalgebra engineering provides a principled, scalable route to barren-plateau-resilient VQAs compatible with near-term quantum processors.

arXiv:2507.05535•IEEE International Conference on Quantum Artificial Intelligence (QAI)•Nov 2, 2025•1 citation

Circuit Synthesis for Variational Quantum Algorithms: The Depth of Algebra and Geometry

Boris Tsvelikhovskiy

The analysis of Hamiltonian Variational Ansätze centers on three fundamental questions: which states are exactly reachable from a given initial state, what native control depth suffices for local and global synthesis, and whether a bounded circuit extension can expose a direction of decreasing cost at a suboptimal output. We address these challenges by leveraging the dynamical Lie algebras (DLAs) associated with the circuits and the geometry of the initial state's orbit under the action of the corresponding dynamical Lie group $G$. We show that an initial state has a closed projective orbit whenever it is a nondegenerate eigenstate of a control Hamiltonian. Combined with asymptotic QAOA convergence, this guarantees exact, finite depth ground state preparation for architectures employing diagonal problem Hamiltonians and irreducible stoquastic mixers. We bound the number of native control exponentials required for local unitary synthesis and state preparation using DLA commutator filtration growth alongside reachable orbit dimensions. Complementing these local results, we construct global frameworks on invariant sectors equipped with full unitary or special unitary dynamical Lie algebras. These constructions yield explicit applications to Pauli-generated systems and constrained maximum independent set multi-angle QAOA circuits; specifically, we show that their native control costs are directly determined by commutator filtration depth and independent-set toggle-group geometry, respectively. Finally, if the dynamical Lie group is compact, the observable $H_P$ generates an admissible evolution ($iH_P \in \mathfrak{g}$, where $\mathfrak{g}$ is the DLA), and the projective orbit of the initial state contains a ground state ray of $H_P$, then a bounded depth, identity-initialized circuit extension exhibits either first-order descent or negative curvature at every suboptimal circuit output.

quant-pharXiv:2610.22689•Oct 19, 2026•0 citations

Lie-geometric trainability of quantum dynamical systems: avoiding barren plateaus via low-dimensional Lie subalgebras

Haijian Shao, Yujie Wu, Xing Deng +1 more

Abstract We present a Lie-geometric framework for analyzing the trainability of quantum neural networks (QNNs) through the algebraic structure of their generator spaces. We prove that QNNs whose dynamics are restricted to polynomial-dimensional Lie subalgebras of su ( 2 n ) admit a polynomial lower bound on gradient variance, thereby avoiding barren plateaus by construction. In contrast, architectures exploring the full Lie algebra su ( 2 n ) exhibit exponentially vanishing gradient variance, O ( 2 − n ) , due to the exponential growth of the associated unitary orbit dimensions. Our results interpret barren plateaus as a geometric concentration phenomenon arising from high-dimensional Lie-group actions, rather than as an intrinsic limitation of parameterized quantum models. We further illustrate the mechanism using a finite-size collective-spin benchmark and a minimal two-qubit sanity check, both of which are consistent with the theoretical predictions.

Physica Scripta•Jun 15, 2026•1 citation

All you need is spin: SU(2) equivariant variational quantum circuits based on spin networks

Richard D. P. East, Guillermo Alonso-Linaje, Chae-Yeun Park

Abstract Variational algorithms require architectures that naturally constrain the optimization space to run efficiently. Geometric quantum machine learning achieves this goal by encoding group structure into parameterized quantum circuits to include the symmetries of a problem as an inductive bias. However, constructing such circuits is challenging as a concrete guiding principle has yet to emerge. In this paper, we propose the use of spin networks , a form of directed tensor network invariant under a group transformation, to devise SU(2) equivariant quantum circuit ansätze—circuits possessing spin-rotation symmetry. By changing to the basis that block diagonalizes the SU(2) group action, these networks provide a natural building block for constructing parameterized equivariant quantum circuits. We prove that our construction is mathematically equivalent to other known constructions, such as those based on twirling and generalized permutations, but more direct to implement on quantum hardware. The efficacy of our constructed circuits is tested by solving the ground state problem of SU(2) symmetric Heisenberg models on the one-dimensional triangular lattice and the Kagome lattice. Our results highlight that our equivariant circuits boost the performance of quantum variational algorithms, indicating broader applicability to other real-world problems.

arXiv:2309.07250•Quantum Science and Technology•Mar 3, 2026•24 citations

Generalization in Data Re-uploading Quantum Neural Networks: A Dynamical Lie Algebraic and Harmonic Analysis Perspective

Ayad Alhusseiny

Commutation failure controls quantum generalization. When data encoding gates fail to commute with trainable parameter gates across consecutive re-uploading layers, the effective dynamical Lie algebra becomes data-dependent; this dependency invalidates the parameter-isolation assumption underpinning existing Lie-algebraic frameworks (Caro et al., 2022; Ohno, 2025). We resolve this structural gap by proving that the statistical generalization capacity of L-layer data re-uploading circuits is tightly bounded by the effective hypothesis dimension: d_eff(L) = min(L * p_layer, |Ω_L|) <= min(L * p_layer, (2L + 1)^d), where d is the input data dimension, p_layer the number of trainable parameters per layer, and |Ω_L| the cardinality of accessible Fourier frequencies generated through non-commuting Lie brackets in the joint dynamical Lie algebra g_joint = Lie_R{i H_j, i G_k}. Harmonic analysis combined with metric entropy chaining establishes matching upper and lower bounds; together, they settle the exact minimax estimation rate R*(F_L, M) = \tilde{\Theta}(\sqrt{d_eff(L)/M}). Two distinct orbit concepts govern learning. The point-wise adjoint orbit dimension dim(O_O) <= dim(g_joint) at fixed x quantifies single-point state variation, whereas the global function-space Fourier capacity |Ω_L| governs sample complexity across the full data domain; conflating these quantities yields vacuous bounds. An initial basis rotation unlocks harmonic modes up to k_max = L; without this rotation, eigenstate initialization constrains the cutoff to k_max = L - 1. Bandwidth dictates depth. For target functions with harmonic bandlimit k_target, the network underfits when L < k_target and achieves full expressivity convergence once L >= k_target. Permutation-equivariant data encoding compresses the joint DLA to an su(2) subalgebra of dimension 3. This algebraic confinement suppresses the 4^n - 1 dimensional explosion across arbitrary qubit counts and shields the circuit from the curse of dimensionality. Numerical benchmarks in PennyLane across L in {1, 2, 4, 8} and sample sizes M in [10, 200] corroborate this harmonic-algebraic scaling and its associated uniform convergence rates.

•Oct 21, 2026•0 citations

A Fundamental Duality in Quantum Machine Learning: Trainability vs. Generalization via Dynamical Lie Algebras

Ayad Alhusseiny

Quantum learnability is an algebraic invariant. While optimization and statistical generalization have long been analyzed through disconnected mathematical formalisms in quantum machine learning, both phenomena emerge as dual geometric projections of the dynamical Lie algebra (DLA) dimension g = Lie{-i H_k} ⊆ su(2^n); across any parameterized circuit family, polynomial trainability (Var[∇C] ≥ Ω(1/poly(n))) and polynomial generalizability (M*(ε) ≤ O(poly(n)/ε^2)) are strictly equivalent and hold if and only if dim(g_n) ∈ O(poly(n)). For any observable with adjoint orbit O_O, the operational product satisfies Var[∇C] · M*(ε) = Θ(dim(O_O) / (dim(g_n) ε^2)), which collapses to the universal, dimension-free invariant Θ(1/ε^2) for all generic, non-degenerate observables, identically independent of system size n and algebraic dimension dim(g_n). Unconstrained expressivity (dim(g_n) ~ 4^n) triggers a simultaneous catastrophe: exponential gradient vanishing accompanied by exponential sample complexity explosion. Subalgebra confinement cures both failures. By restricting generators to permutation-equivariant or symmetry-protected subalgebras, the circuit enforces dim(g_n) ≤ O(poly(n)) and secures non-vanishing gradient flow alongside statistical sample efficiency. Exact statevector simulations in PennyLane across n ∈ {2, 3, 4, 5, 6} corroborate this duality: hardware-efficient ansätze exhibit a 17.22× variance collapse, whereas symmetry-protected models sustain Θ(1) gradients and achieve twofold lower test error.

•Oct 23, 2026•0 citations
Equivariant quantum networks encode symmetry as an inductive bias, which can improve generalization and may also favor optimization convergence. Equivariance alone, however, does not constrain the noncommuting closure of trainable generators, and this closure can still grow rapidly in symmetry-preserving variational circuits. We introduce a hierarchical ancilla-controlled architecture that addresses this Lie-algebra-growth mechanism. Commuting invariant-sector projectors on the data register select parameterized operations on a shared ancilla register, where the noncommuting trainable dynamics is confined. The trainable circuit decomposes into compatible joint sectors, giving a sector-probability-weighted ancilla response and an explicit view of parameter sharing across hierarchical paths. For an ancilla dimension dA=2md_A=2^mdA​=2m and KℓK_\ellKℓ​ retained layer-wise control modes, we prove the group-independent bound dim⁡(g)≤(dA2−1)∏ℓ=1L(Kℓ+1)\dim(\mathfrak g)\le (d_A^2-1)\prod_{\ell=1}^{L}(K_\ell+1)dim(g)≤(dA2​−1)∏ℓ=1L​(Kℓ​+1). The bound is polynomial in the number of data qubits when mmm and KℓK_\ellKℓ​ remain constant along a logarithmic-depth hierarchy. Particle-number and parity projectors illustrate the general construction, while a fixed Clebsch--Gordan coupling tree supplies a concrete SU(2)SU(2)SU(2) realization with rotation-invariant scalar outputs. Finite-size state-vector simulations exhibit slower gradient-variance decay and larger initialization gradients than generic and conventional rotationally equivariant circuits over the studied system sizes. The same realization fits sparse rotation-invariant classification tasks and geometry-dependent Heisenberg ground-state energies. These results support restricted trainable Lie-algebra growth as a structural strategy for initialization trainability in the regimes considered here.
We propose SUN-VQC, a variational-circuit architecture whose elementary layers are single exponentials of a symmetry-restricted Lie subgroup, SU(2k)⊂SU(2n)\mathrm{SU}(2^{k}) \subset \mathrm{SU}(2^{n})SU(2k)⊂SU(2n) with k≪nk \ll nk≪n. Confining the evolution to this compact subspace reduces the dynamical Lie-algebra dimension from O(4n)\mathcal{O}(4^{n})O(4n) to O(4k)\mathcal{O}(4^{k})O(4k), ensuring only polynomial suppression of gradient variance and circumventing barren plateaus that plague hardware-efficient ansätze. Exact, hardware-compatible gradients are obtained using a generalized parameter-shift rule, avoiding ancillary qubits and finite-difference bias. Numerical experiments on quantum auto-encoding and classification show that SUN-VQCs sustain order-of-magnitude larger gradient signals, converge 2--3×\times× faster, and reach higher final fidelities than depth-matched Pauli-rotation or hardware-efficient circuits. These results demonstrate that Lie-subalgebra engineering provides a principled, scalable route to barren-plateau-resilient VQAs compatible with near-term quantum processors.
The analysis of Hamiltonian Variational Ansätze centers on three fundamental questions: which states are exactly reachable from a given initial state, what native control depth suffices for local and global synthesis, and whether a bounded circuit extension can expose a direction of decreasing cost at a suboptimal output. We address these challenges by leveraging the dynamical Lie algebras (DLAs) associated with the circuits and the geometry of the initial state's orbit under the action of the corresponding dynamical Lie group GGG. We show that an initial state has a closed projective orbit whenever it is a nondegenerate eigenstate of a control Hamiltonian. Combined with asymptotic QAOA convergence, this guarantees exact, finite depth ground state preparation for architectures employing diagonal problem Hamiltonians and irreducible stoquastic mixers. We bound the number of native control exponentials required for local unitary synthesis and state preparation using DLA commutator filtration growth alongside reachable orbit dimensions. Complementing these local results, we construct global frameworks on invariant sectors equipped with full unitary or special unitary dynamical Lie algebras. These constructions yield explicit applications to Pauli-generated systems and constrained maximum independent set multi-angle QAOA circuits; specifically, we show that their native control costs are directly determined by commutator filtration depth and independent-set toggle-group geometry, respectively. Finally, if the dynamical Lie group is compact, the observable HPH_PHP​ generates an admissible evolution (iHP∈giH_P \in \mathfrak{g}iHP​∈g, where g\mathfrak{g}g is the DLA), and the projective orbit of the initial state contains a ground state ray of HPH_PHP​, then a bounded depth, identity-initialized circuit extension exhibits either first-order descent or negative curvature at every suboptimal circuit output.
Abstract We present a Lie-geometric framework for analyzing the trainability of quantum neural networks (QNNs) through the algebraic structure of their generator spaces. We prove that QNNs whose dynamics are restricted to polynomial-dimensional Lie subalgebras of su ( 2 n ) admit a polynomial lower bound on gradient variance, thereby avoiding barren plateaus by construction. In contrast, architectures exploring the full Lie algebra su ( 2 n ) exhibit exponentially vanishing gradient variance, O ( 2 − n ) , due to the exponential growth of the associated unitary orbit dimensions. Our results interpret barren plateaus as a geometric concentration phenomenon arising from high-dimensional Lie-group actions, rather than as an intrinsic limitation of parameterized quantum models. We further illustrate the mechanism using a finite-size collective-spin benchmark and a minimal two-qubit sanity check, both of which are consistent with the theoretical predictions.
Abstract Variational algorithms require architectures that naturally constrain the optimization space to run efficiently. Geometric quantum machine learning achieves this goal by encoding group structure into parameterized quantum circuits to include the symmetries of a problem as an inductive bias. However, constructing such circuits is challenging as a concrete guiding principle has yet to emerge. In this paper, we propose the use of spin networks , a form of directed tensor network invariant under a group transformation, to devise SU(2) equivariant quantum circuit ansätze—circuits possessing spin-rotation symmetry. By changing to the basis that block diagonalizes the SU(2) group action, these networks provide a natural building block for constructing parameterized equivariant quantum circuits. We prove that our construction is mathematically equivalent to other known constructions, such as those based on twirling and generalized permutations, but more direct to implement on quantum hardware. The efficacy of our constructed circuits is tested by solving the ground state problem of SU(2) symmetric Heisenberg models on the one-dimensional triangular lattice and the Kagome lattice. Our results highlight that our equivariant circuits boost the performance of quantum variational algorithms, indicating broader applicability to other real-world problems.
Commutation failure controls quantum generalization. When data encoding gates fail to commute with trainable parameter gates across consecutive re-uploading layers, the effective dynamical Lie algebra becomes data-dependent; this dependency invalidates the parameter-isolation assumption underpinning existing Lie-algebraic frameworks (Caro et al., 2022; Ohno, 2025). We resolve this structural gap by proving that the statistical generalization capacity of L-layer data re-uploading circuits is tightly bounded by the effective hypothesis dimension: d_eff(L) = min(L * p_layer, |Ω_L|) <= min(L * p_layer, (2L + 1)^d), where d is the input data dimension, p_layer the number of trainable parameters per layer, and |Ω_L| the cardinality of accessible Fourier frequencies generated through non-commuting Lie brackets in the joint dynamical Lie algebra g_joint = Lie_R{i H_j, i G_k}. Harmonic analysis combined with metric entropy chaining establishes matching upper and lower bounds; together, they settle the exact minimax estimation rate R*(F_L, M) = \tilde{\Theta}(\sqrt{d_eff(L)/M}). Two distinct orbit concepts govern learning. The point-wise adjoint orbit dimension dim(O_O) <= dim(g_joint) at fixed x quantifies single-point state variation, whereas the global function-space Fourier capacity |Ω_L| governs sample complexity across the full data domain; conflating these quantities yields vacuous bounds. An initial basis rotation unlocks harmonic modes up to k_max = L; without this rotation, eigenstate initialization constrains the cutoff to k_max = L - 1. Bandwidth dictates depth. For target functions with harmonic bandlimit k_target, the network underfits when L < k_target and achieves full expressivity convergence once L >= k_target. Permutation-equivariant data encoding compresses the joint DLA to an su(2) subalgebra of dimension 3. This algebraic confinement suppresses the 4^n - 1 dimensional explosion across arbitrary qubit counts and shields the circuit from the curse of dimensionality. Numerical benchmarks in PennyLane across L in {1, 2, 4, 8} and sample sizes M in [10, 200] corroborate this harmonic-algebraic scaling and its associated uniform convergence rates.
Quantum learnability is an algebraic invariant. While optimization and statistical generalization have long been analyzed through disconnected mathematical formalisms in quantum machine learning, both phenomena emerge as dual geometric projections of the dynamical Lie algebra (DLA) dimension g = Lie{-i H_k} ⊆ su(2^n); across any parameterized circuit family, polynomial trainability (Var[∇C] ≥ Ω(1/poly(n))) and polynomial generalizability (M*(ε) ≤ O(poly(n)/ε^2)) are strictly equivalent and hold if and only if dim(g_n) ∈ O(poly(n)). For any observable with adjoint orbit O_O, the operational product satisfies Var[∇C] · M*(ε) = Θ(dim(O_O) / (dim(g_n) ε^2)), which collapses to the universal, dimension-free invariant Θ(1/ε^2) for all generic, non-degenerate observables, identically independent of system size n and algebraic dimension dim(g_n). Unconstrained expressivity (dim(g_n) ~ 4^n) triggers a simultaneous catastrophe: exponential gradient vanishing accompanied by exponential sample complexity explosion. Subalgebra confinement cures both failures. By restricting generators to permutation-equivariant or symmetry-protected subalgebras, the circuit enforces dim(g_n) ≤ O(poly(n)) and secures non-vanishing gradient flow alongside statistical sample efficiency. Exact statevector simulations in PennyLane across n ∈ {2, 3, 4, 5, 6} corroborate this duality: hardware-efficient ansätze exhibit a 17.22× variance collapse, whereas symmetry-protected models sustain Θ(1) gradients and achieve twofold lower test error.