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

Observable Geometry for Effective Quantum Circuits

Huan-Hsin Tseng, Hsin-Yi Lin, Samuel Yen-Chi Chen, Yan Mong Chan, Tzu-Chieh Wei, Shinjae Yoo

quant-phSubmitted Jul 22, 2026• Announced Jul 23, 2026• 0 citations
arXivHTMLPDF

Abstract

We study redundancy and effectiveness of Variational Quantum Circuits via algebraic and geometric views of Lie groups. Considering unitary transformations acting on Hermitian observables, a stabilizer group decomposition is given. Subsequently, we identify the Hermitian orbit with a quotient space of a symmetric space. Through this connection, we characterize the effective circuit degrees of freedom. Our approach of spectral decompositions and homogeneous spaces yields tractable calculation criteria, which are verified by numerical experiments.

Comments
Accepted at QCE26 Workshop

Related papers

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

A hybrid variational quantum circuit approach for stabilizer states classifiers

Hamna Aslam, Frédéric Holweck

Entanglement classification of pure multipartite quantum states is a challenging problem in quantum information theory that can be mathematically stated as orbit classification for some given group action on the ambient Hilbert space. The group action depends on the grained classification one expects, the finer-grained one being the classification up to local unitary transformation (LU). In this article, we show how a variational quantum circuit approach can be used to learn entanglement orbits, and we apply our findings to build a classifier for four-qubit states.

quant-pharXiv:2511.09430•Nov 13, 2025•0 citations

Symmetry Groups for the Decomposition of Reversible Computers, Quantum Computers, and Computers in between

Alexis De Vos, Stijn De Baerdemacker

Whereas quantum computing circuits follow the symmetries of the unitary Lie group, classical reversible computation circuits follow the symmetries of a finite group, i.e., the symmetric group. We confront the decomposition of an arbitrary classical reversible circuit with w bits and the decomposition of an arbitrary quantum circuit with w qubits. Both decompositions use the control gate as building block, i.e., a circuit transforming only one (qu)bit, the transformation being controlled by the other w−1 (qu)bits. We explain why the former circuit can be decomposed into 2w − 1 control gates, whereas the latter circuit needs 2w − 1 control gates. We investigate whether computer circuits, not based on the full unitary group but instead on a subgroup of the unitary group, may be decomposable either into 2w − 1 or into 2w − 1 control gates.

Symmetry•Jun 7, 2011•16 citations

Quantum geometry of the Cartan control problem

Peter Leifer

The Cartan control problem of the quantum circuits discussed from the differential geometry point of view. Abstract unitary transformations of $SU(2^n)$ are realized physically in the projective Hilbert state space $CP(2^n-1)$ of the n-qubit system. Therefore the Cartan decomposition of the algebra $AlgSU(2^n-1)$ into orthogonal subspaces $h$ and $b$ such that $[h,h] \subseteq h, [b,b] \subseteq h, [b,h] \subseteq b$ is state-dependent and thus requires the representation in the local coordinates.

arXiv:0810.3188•Oct 17, 2008•0 citations

Geometric quantum machine learning with horizontal quantum gates

Roeland Wiersema, Alexander F. Kemper, Bojko Bakalov +1 more

In the current framework of geometric quantum machine learning, the canonical method for constructing a variational ansatz that respects the symmetry of some group action is by forcing the circuit to be equivariant, i.e., to commute with the action of the group. This can, however, be an overzealous constraint that greatly limits the expressivity of the circuit, especially in the case of continuous symmetries. We propose an alternative paradigm for the symmetry-informed construction of variational quantum circuits, based on homogeneous spaces, relaxing the overly stringent requirement of equivariance. We achieve this by introducing horizontal quantum gates, which only transform the state with respect to the directions orthogonal to those of the symmetry. We show that horizontal quantum gates are much more expressive than equivariant gates, and thus can solve problems that equivariant circuits cannot. For instance, a circuit comprised of horizontal gates can find the ground state of an SU ( 2 ) -symmetric model where the ground state spin sector is unknown—a task where equivariant circuits fall short. Moreover, for a particular subclass of horizontal gates based on symmetric spaces, we can obtain efficient circuit decompositions for our gates through the KAK theorem. Finally, we highlight a particular class of horizontal quantum gates that behave similarly to general SU ( 4 ) gates, while achieving a quadratic reduction in the number of parameters for a generic problem.

arXiv:2406.04418•Physical Review Research•Feb 10, 2025•6 citations

Quantum Natural Gradient on Quotient Spaces

Zeyu Chen

A parametrized quantum circuit reports its state geometry through a quantum Fisher information matrix (QFIM), often singular. A small Fisher value can reflect exact state-preserving redundancy, compression by the circuit chart, or weak intrinsic distinguishability, and these mechanisms call for different numerical treatments. We show that the circuit metric factors as $F=B^{*}MB$, where $B$ is the state-level circuit-to-orbit differential and $M$ is the intrinsic Fisher operator on the reachable orbit. The factorization identifies the exact kernel as $\ker B$, separates coordinate transfer from intrinsic geometry, and yields the condition for a circuit to realize an orbit-level quantum natural-gradient (QNG) direction. When the prescribed redundancy exhausts the Fisher kernel, the Moore--Penrose update is the minimum-norm horizontal lift of the quotient Riemannian gradient. At critical points with a locally diffeomorphic quotient-to-orbit map, chart singular values cancel from the linearized QNG operator while intrinsic anisotropy remains; in the trace-orthonormal full-control generator frame, excitation-gap anisotropy gives $κ_{\mathrm{QNG}}=κ_{\mathrm{Eucl}}$. Representation theory makes $M$ explicit on highest-weight, Slater, and fermionic-Gaussian orbits, and cominuscule fidelity flow becomes integrable, with conserved principal-defect ratios, cubic Lie-retracted convergence at $η=2$, and stability boundary $η=4$. Finite data impose a second boundary: an estimated QFIM and its confidence radius alone cannot distinguish an exact zero from a small physical mode, so the estimated spectrum alone cannot license hard projection. Under depolarization, inverse-Fisher scaling amplifies mean updates and fluctuations together and cannot restore update signal-to-noise. A redundant Slater/Givens circuit confirms exact transfer identities and illustrates finite-shot tradeoffs.

quant-pharXiv:2608.29350•Sep 1, 2026•0 citations
We study redundancy and effectiveness of Variational Quantum Circuits via algebraic and geometric views of Lie groups. Considering unitary transformations acting on Hermitian observables, a stabilizer group decomposition is given. Subsequently, we identify the Hermitian orbit with a quotient space of a symmetric space. Through this connection, we characterize the effective circuit degrees of freedom. Our approach of spectral decompositions and homogeneous spaces yields tractable calculation criteria, which are verified by numerical experiments.
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.
Entanglement classification of pure multipartite quantum states is a challenging problem in quantum information theory that can be mathematically stated as orbit classification for some given group action on the ambient Hilbert space. The group action depends on the grained classification one expects, the finer-grained one being the classification up to local unitary transformation (LU). In this article, we show how a variational quantum circuit approach can be used to learn entanglement orbits, and we apply our findings to build a classifier for four-qubit states.
Whereas quantum computing circuits follow the symmetries of the unitary Lie group, classical reversible computation circuits follow the symmetries of a finite group, i.e., the symmetric group. We confront the decomposition of an arbitrary classical reversible circuit with w bits and the decomposition of an arbitrary quantum circuit with w qubits. Both decompositions use the control gate as building block, i.e., a circuit transforming only one (qu)bit, the transformation being controlled by the other w−1 (qu)bits. We explain why the former circuit can be decomposed into 2w − 1 control gates, whereas the latter circuit needs 2w − 1 control gates. We investigate whether computer circuits, not based on the full unitary group but instead on a subgroup of the unitary group, may be decomposable either into 2w − 1 or into 2w − 1 control gates.
The Cartan control problem of the quantum circuits discussed from the differential geometry point of view. Abstract unitary transformations of SU(2n)SU(2^n)SU(2n) are realized physically in the projective Hilbert state space CP(2n−1)CP(2^n-1)CP(2n−1) of the n-qubit system. Therefore the Cartan decomposition of the algebra AlgSU(2n−1)AlgSU(2^n-1)AlgSU(2n−1) into orthogonal subspaces hhh and bbb such that [h,h]⊆h,[b,b]⊆h,[b,h]⊆b[h,h] \subseteq h, [b,b] \subseteq h, [b,h] \subseteq b[h,h]⊆h,[b,b]⊆h,[b,h]⊆b is state-dependent and thus requires the representation in the local coordinates.
In the current framework of geometric quantum machine learning, the canonical method for constructing a variational ansatz that respects the symmetry of some group action is by forcing the circuit to be equivariant, i.e., to commute with the action of the group. This can, however, be an overzealous constraint that greatly limits the expressivity of the circuit, especially in the case of continuous symmetries. We propose an alternative paradigm for the symmetry-informed construction of variational quantum circuits, based on homogeneous spaces, relaxing the overly stringent requirement of equivariance. We achieve this by introducing horizontal quantum gates, which only transform the state with respect to the directions orthogonal to those of the symmetry. We show that horizontal quantum gates are much more expressive than equivariant gates, and thus can solve problems that equivariant circuits cannot. For instance, a circuit comprised of horizontal gates can find the ground state of an SU ( 2 ) -symmetric model where the ground state spin sector is unknown—a task where equivariant circuits fall short. Moreover, for a particular subclass of horizontal gates based on symmetric spaces, we can obtain efficient circuit decompositions for our gates through the KAK theorem. Finally, we highlight a particular class of horizontal quantum gates that behave similarly to general SU ( 4 ) gates, while achieving a quadratic reduction in the number of parameters for a generic problem.
A parametrized quantum circuit reports its state geometry through a quantum Fisher information matrix (QFIM), often singular. A small Fisher value can reflect exact state-preserving redundancy, compression by the circuit chart, or weak intrinsic distinguishability, and these mechanisms call for different numerical treatments. We show that the circuit metric factors as F=B∗MBF=B^{*}MBF=B∗MB, where BBB is the state-level circuit-to-orbit differential and MMM is the intrinsic Fisher operator on the reachable orbit. The factorization identifies the exact kernel as ker⁡B\ker BkerB, separates coordinate transfer from intrinsic geometry, and yields the condition for a circuit to realize an orbit-level quantum natural-gradient (QNG) direction. When the prescribed redundancy exhausts the Fisher kernel, the Moore--Penrose update is the minimum-norm horizontal lift of the quotient Riemannian gradient. At critical points with a locally diffeomorphic quotient-to-orbit map, chart singular values cancel from the linearized QNG operator while intrinsic anisotropy remains; in the trace-orthonormal full-control generator frame, excitation-gap anisotropy gives κQNG=κEuclκ_{\mathrm{QNG}}=κ_{\mathrm{Eucl}}κQNG​=κEucl​. Representation theory makes MMM explicit on highest-weight, Slater, and fermionic-Gaussian orbits, and cominuscule fidelity flow becomes integrable, with conserved principal-defect ratios, cubic Lie-retracted convergence at η=2η=2η=2, and stability boundary η=4η=4η=4. Finite data impose a second boundary: an estimated QFIM and its confidence radius alone cannot distinguish an exact zero from a small physical mode, so the estimated spectrum alone cannot license hard projection. Under depolarization, inverse-Fisher scaling amplifies mean updates and fluctuations together and cannot restore update signal-to-noise. A redundant Slater/Givens circuit confirms exact transfer identities and illustrates finite-shot tradeoffs.