Useful quantum neural networks should not merely explore large Hilbert spaces but should organise their expressive capacity according to the symmetries of the learning problem. We introduce symmetry-organised complexity as an ansatz-level, representation-theoretic trajectory diagnostic for quantum neural networks. The diagnostic combines symmetry-sector organisation, cross-irreducible representation organised complexity, and symmetry metastability into a composite index, which is then multiplied by a compliance factor that penalises apparent complexity arising from symmetry violation. This compliance factor is defined at the level of the implemented trainable generators rather than as a representation-independent channel metric. The representation-theoretic basis of the construction is that, for an exactly equivariant network, the effective trainable operators lie in the commutant of the group action and are controlled by multiplicity dimensions rather than by the full Hilbert-space dimension. We show that joint sector collapse and state freezing force the index to vanish under an explicit multiplicity–purity condition and that networks with identical qubit and parameter counts can have different values of the index. Two analytically tractable four-qubit examples with excitation number and total spin symmetry illustrate how the diagnostic separates sector-collapsed, symmetry-organised, and symmetry-breaking behaviour. A controlled U(1)-compatible teacher–student classification task further shows that, in this validation setting, the ordering of the composite index across equivariant, hybrid, and non-equivariant ansatze agrees with the ordering of generalisation accuracy. The framework is most informative when the relevant symmetry of the learning problem is known.
Useful quantum neural networks should not merely explore large Hilbert spaces but should organise their expressive capacity according to the symmetries of the learning problem. We introduce symmetry-organised complexity as an ansatz-level, representation-theoretic trajectory diagnostic for quantum neural networks. The diagnostic combines symmetry-sector organisation, cross-irreducible representation organised complexity, and symmetry metastability into a composite index, which is then multiplied by a compliance factor that penalises apparent complexity arising from symmetry violation. This compliance factor is defined at the level of the implemented trainable generators rather than as a representation-independent channel metric. The representation-theoretic basis of the construction is that, for an exactly equivariant network, the effective trainable operators lie in the commutant of the group action and are controlled by multiplicity dimensions rather than by the full Hilbert-space dimension. We show that joint sector collapse and state freezing force the index to vanish under an explicit multiplicity–purity condition and that networks with identical qubit and parameter counts can have different values of the index. Two analytically tractable four-qubit examples with excitation number and total spin symmetry illustrate how the diagnostic separates sector-collapsed, symmetry-organised, and symmetry-breaking behaviour. A controlled U(1)-compatible teacher–student classification task further shows that, in this validation setting, the ordering of the composite index across equivariant, hybrid, and non-equivariant ansatze agrees with the ordering of generalisation accuracy. The framework is most informative when the relevant symmetry of the learning problem is known.
Equivariant quantum neural networks are built to respect known symmetries in data or physical systems. In practice, however, a circuit is executed together with hardware noise, and this noise can break the intended symmetry even when the ideal noiseless circuit is exactly symmetric. In this paper, we introduce a channel-level diagnostic for detecting this kind of symmetry failure before training is performed. The diagnostic compares a noisy quantum channel with the target symmetry action and reports the mismatch as a bounded compliance score. The method does not require labels, loss functions, benchmark tasks, or a completed training loop. We validate it on reproducible examples with phase and rotation symmetries under depolarising noise, amplitude damping, coherent over-rotation, and mixed noise. The results show that the diagnostic distinguishes symmetry-preserving from symmetry-breaking noise, and that this distinction depends on the chosen representation. In our tests, amplitude damping preserves the phase symmetry but breaks the rotation symmetry. A comparison with ansatz-level commutation checks, process-distance measures, randomised benchmarking, and task-level metrics shows that the proposed score measures a distinct representation-specific channel property. This property is not captured by those alternatives. Furthermore, a controlled downstream symmetry-sensitive classification task and a larger-system runtime study reaching six qubits show that the score tracks symmetry-specific output inconsistency in the operating regime where the classifier remains informative, while also making the dense-scaling limits of the reference implementation explicit. The proposed method is a pre-training audit intended to complement downstream task-performance studies and existing channel diagnostics. A reference implementation with code and accompanying data is provided.
Quantum neural network architectures that have little to no inductive biases are known to face trainability and generalization issues. Inspired by a similar problem, recent breakthroughs in machine learning address this challenge by creating models encoding the symmetries of the learning task. This is materialized through the usage of equivariant neural networks the action of which commutes with that of the symmetry. In this work, we import these ideas to the quantum realm by presenting a comprehensive theoretical framework to design equivariant quantum neural networks (EQNNs) for essentially any relevant symmetry group. We develop multiple methods to construct equivariant layers for EQNNs and analyze their advantages and drawbacks. Our methods can find unitary or general equivariant quantum channels efficiently even when the symmetry group is exponentially large or continuous. As a special implementation, we show how standard quantum convolutional neural networks (QCNNs) can be generalized to group-equivariant QCNNs where both the convolution and pooling layers are equivariant to the symmetry group. We then numerically demonstrate the effectiveness of a S U ( 2 ) -equivariant QCNN over symmetry-agnostic QCNN on a classification task of phases of matter in the bond-alternating Heisenberg model. Our framework can be readily applied to virtually all areas of quantum machine learning. Lastly, we discuss about how symmetry-informed models such as EQNNs provide hopes to alleviate central challenges such as barren plateaus, poor local minima, and sample complexity. Published by the American Physical Society 2024
The exploration of neural network quantum states has become widespread in studies of complicated quantum many-body systems. However, achieving high precision remains challenging due to the exponential growth of Hilbert space size and the intricate sign structures. Utilizing symmetries of the physical system, we propose a method to evaluate and sample the variational Ansatz within a symmetric subspace. This approach isolates different symmetry sectors, reducing the relevant Hilbert space size by a factor approximately proportional to the size of the symmetry group. It is inspired by exact diagonalization techniques and the work of Choo et al., [Phys. Rev. Lett. 121, 167204 (2018)]. We validate our method using the frustrated spin-$\frac{1}{2}\phantom{\rule{4pt}{0ex}}{J}_{1}\text{\ensuremath{-}}{J}_{2}$ antiferromagnetic Heisenberg chain, and we compare its performance to the case without symmetrization. The results indicate that our symmetric subspace approach achieves a substantial improvement over the full Hilbert space on optimizing the Ansatz, reducing the energy error by orders of magnitude. We also compare the results on degenerate eigenstates with different quantum numbers, highlighting the advantage of operating within a smaller Hilbert subspace.
Group-equivariant quantum machine learning has emerged as a promising paradigm by incorporating symmetry into quantum models. However, constructing models simultaneously equivariant to both rotational and permutational symmetries in a principled manner remains a bottleneck. In this work, we develop a general framework for dual-equivariant gates under rotations and permutations and analyze the dimension of the resulting gate space using group representation theory. Based on this, we introduce HyQuRP, a hybrid quantum-classical neural network with dual equivariance. On 3D point cloud classification benchmarks in the sparse-point regime, HyQuRP outperforms strong classical and quantum baselines. For example, when six subsampled points are used, HyQuRP ($\sim$1.5K parameters) achieves 76.13% accuracy on the 5-class ModelNet benchmark, compared with 72.54%, 71.09%, and 71.03% for Tensor Field Network, PointNet, and PointMamba with similar parameter counts. These results highlight HyQuRP's strong data efficiency and suggest the potential of equivariant quantum machine learning approaches in symmetry-sensitive tasks.
Abstract Despite the great promise of quantum machine learning models, there are several challenges one must overcome before unlocking their full potential. For instance, models based on quantum neural networks (QNNs) can suffer from excessive local minima and barren plateaus in their training landscapes. Recently, the nascent field of geometric quantum machine learning (GQML) has emerged as a potential solution to some of those issues. The key insight of GQML is that one should design architectures, such as equivariant QNNs, encoding the symmetries of the problem at hand. Here, we focus on problems with permutation symmetry (i.e., symmetry group Sn), and show how to build Sn-equivariant QNNs We provide an analytical study of their performance, proving that they do not suffer from barren plateaus, quickly reach overparametrization, and generalize well from small amounts of data. To verify our results, we perform numerical simulations for a graph state classification task. Our work provides theoretical guarantees for equivariant QNNs, thus indicating the power and potential of GQML.
Symmetry provides a quantum neural network structure, but on its own it does not keep the network trainable once noise is present. We ask which physical quantity decides whether the gradients of an equivariant circuit survive decoherence, and we answer with a compact training law. Working with U(1)-equivariant brickwork circuits that conserve a charge, we find that two distinct effects govern a trainable gradient. Causality fixes where the gradient can live, confining it to the backward light cone of the readout inside the active charge sector. Coherence then determines how fast it decays through the contraction of the off-diagonal sector modes that the projected readout can actually observe. We prove a light-cone reduction that pins the noiseless gradient to the sector-restricted cone with a lower bound independent of the total qubit number, and we define a readout-visible aligned coherence rate as a Rayleigh quotient of the noise generator along the gradient-carrying mode. A perturbative open-system analysis turns this rate into a leading-order training law. Density-matrix simulations then confirm that the finite-noise degradation follows a single accumulated variable built from noise depth and coherence contraction, with a coefficient of determination of 0.979. The sharpest test comes from a correlated-dephasing channel that has a large worst-case rate but a near-zero aligned rate. The law predicts no gradient loss for this channel, and none is seen. Sector coherence outperforms every standard channel diagnostic we compare it against, and the analysis identifies readout-visible sector coherence as the quantity that links equivariant architecture, open-system dynamics and noisy trainability.