arXiv:2604.06094

Pixel-Translation-Equivariant Quantum Convolutional Neural Networks via Fourier Multiplexers

Dmitry Chirkov, Igor Lobanov

quant-phcs.LGSubmitted Apr 7, 2026• Announced Apr 8, 2026• 0 citations

Abstract

Convolutional neural networks owe much of their success to hard-coding translation equivariance. Quantum convolutional neural networks (QCNNs) have been proposed as near-term quantum analogues, but the relevant notion of translation depends on the data encoding. For address/amplitude encodings such as FRQI, a pixel shift acts as modular addition on an index register, whereas many MERA-inspired QCNNs are equivariant only under cyclic permutations of physical qubits. We formalize this mismatch and construct QCNN layers that commute exactly with the pixel cyclic shift (PCS) symmetry induced by the encoding. Our main technical result is a constructive characterization of all PCS-equivariant unitaries: conjugation by the quantum Fourier transform (QFT) diagonalizes translations, so any PCS-equivariant layer is a Fourier-mode multiplexer followed by an inverse QFT (IQFT). Building on this characterization, we introduce a deep PCS-QCNN with measurement-induced pooling, deferred conditioning, and inter-layer QFT cancellation. We also analyze trainability at random initialization and prove a lower bound on the expected squared gradient norm that remains constant in a depth-scaling regime, ruling out a depth-induced barren plateau in that sense.

Related papers

Pixel-Translation-Equivariant Quantum Convolutional Neural Networks via Fourier Multiplexers

Dmitry Chirkov, I. S. Lobanov

Abstract Symmetry is a central source of inductive bias in learning, but in quantum models the symmetry available to a circuit is shaped by the data encoding.We show that this changes what it means for a quantum circuit to be convolutional.For address/amplitude image encodings such as FRQI, pixel translations on the finite periodic lattice are represented by pixel cyclic shifts (PCS), which act as modular addition on the spatial index register, whereas many MERA-inspired QCNN templates are equivariant under cyclic permutations of physical qubits.We formalize this mismatch between PCS and qubit cyclic shifts (QCS), and construct QCNN layers that commute exactly with the PCS symmetry induced by the encoding.We characterize the resulting layer family as the unitary commutant of the encoded translation operator, yielding a Fourier-space constructive form for PCS-equivariant quantum convolution.Building on this characterization, we construct a multiscale PCS-QCNN with measurement-conditioned pooling and analyze its trainability with gradient diagnostics that separate parameter-count effects from suppression of the optimization-relevant gradient norm.Exact PCS equivariance is enforced for the unitary quantum convolutional blocks on their active registers; pooling yields a multiscale/coarse equivariance structure, and in the reported hybrid classifier an unconstrained linear-softmax head maps readout probabilities to labels, so label invariance is learned rather than imposed.To make the empirical comparison diagnostic of convolutional inductive bias, we use a translated-MNIST benchmark with matched classical CNN/MLP controls that exhibit a separation between translation-aware and dense architectures.On this benchmark, the PCS-QCNN achieves higher accuracy than a matched non-PCS random-basis quantum control.Full-MNIST experiments provide a non-translated reference, and finite-shot diagnostics identify a possible train--deploy mismatch at fixed shot budget, making sampling cost a deployment-relevant part of model selection.

Aug 14, 20260 citations

Theory for Equivariant Quantum Neural Networks

Quynh T. Nguyen, Louis Schatzki, Paolo Braccia +5 more

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

arXiv:2210.08566PRX QuantumMay 6, 2024113 citations

Permutation-equivariant quantum convolutional neural networks

Sreetama Das, Filippo Caruso

Abstract The Symmetric group S n manifests itself in large classes of quantum systems as the invariance of certain characteristics of a quantum state with respect to permuting the qubits. Subgroups of S n arise, among many other contexts, to describe label symmetry of classical images with respect to spatial transformations, such as reflection or rotation. Equipped with the formalism of geometric quantum machine learning, in this study we propose the architectures of equivariant quantum convolutional neural networks (EQCNNs) adherent to S n and its subgroups. We demonstrate that a careful choice of pixel-to-qubit embedding order can facilitate easy construction of EQCNNs for small subgroups of S n . Our novel EQCNN architecture corresponding to the full permutation group S n is built by applying all possible QCNNs with equal probability, which can also be conceptualized as a dropout strategy in quantum neural networks. For subgroups of S n , our numerical results using MNIST datasets show better classification accuracy than non-equivariant QCNNs. The S n -equivariant QCNN architecture shows significantly improved training and test performance than non-equivariant QCNN for classification of connected and non-connected graphs. When trained with sufficiently large number of data, the S n -equivariant QCNN shows better average performance compared to S n -equivariant QNN . These results contribute towards building powerful quantum machine learning architectures in permutation-symmetric systems.

arXiv:2404.18198Quantum Science and TechnologyNov 4, 20244 citations

Resource-efficient equivariant quantum convolutional neural networks

Koki Chinzei, Quoc Hoan Tran, Yasuhiro Endo +1 more

Abstract Equivariant quantum neural networks (QNNs) are promising variational models that exploit symmetries to improve machine learning capabilities. Despite theoretical developments in equivariant QNNs, their implementation on near-term quantum devices remains challenging due to limited computational resources. This study proposes a resource-efficient model of equivariant quantum convolutional networks (QCNNs) called equivariant split-parallelizing QCNN (sp-QCNN). Using a group-theoretical approach, we encode general symmetries into our model beyond the translational symmetry addressed by previous sp-QCNNs. We achieve this by splitting the circuit at the pooling layer while preserving symmetry. This splitting structure effectively parallelizes QCNNs to improve measurement efficiency in estimating the expectation value of an observable and its gradient by order of the number of qubits. Our model also exhibits high trainability and generalization performance, including the absence of barren plateaus. Numerical experiments demonstrate that the equivariant sp-QCNN can be trained and generalized with fewer measurement resources than a conventional equivariant QCNN in a noisy quantum data classification task. Our results contribute to the advancement of practical quantum machine learning algorithms.

arXiv:2410.01252Quantum Machine IntelligenceApr 27, 20261 citation

Accelerating two‑dimensional quantum Fourier transforms in quantum neural networks

Alexis A. Gomez, Erron Torres-Concoha, Artyom M. Grigoryan +1 more

This work presents an implementation-grounded quantum convolutional neural network (QCNN) pipeline in which classical images are amplitude-encoded with the quantum signal-induced heap transform (QsiHT), transformed by a 2-D quantum Fourier transform (2-D QFT), and classified by a two-stage QCNN. Each convolution stage applies shared single-qubit rotations and ring CNOT entanglement, pooling is unitary-only, and prediction is obtained from the final readout qubit probability via thresholding. Training uses parameter-shift gradients with Adam-style updates and includes practical regularization through random-affine data augmentation, ℓ2 weight decay, and class-balanced subset sampling. Experiments in IBM Qiskit on a binary MNIST task (classes (0, 1)) evaluate 4-qubit (4 × 4) and 6-qubit (8 × 8) models under finite-shot simulation (256 shots), yielding final validation accuracies of 91.41% and 99.80%, respectively. These results indicate that the QsiHT+QFT front-end integrates effectively with shallow QCNN layers and benefits from increased qubit resolution in this setting.

Multimodal Image Exploitation and LearningJun 9, 20260 citations

Absence of Barren Plateaus in Quantum Convolutional Neural Networks

Arthur Chalom Pesah, Marco Cerezo, Samson Wang +3 more

Quantum neural networks (QNNs) have generated excitement around the possibility of efficiently analyzing quantum data.But this excitement has been tempered by the existence of exponentially vanishing gradients, known as barren plateau landscapes, for many QNN architectures.Recently, quantum convolutional neural networks (QCNNs) have been proposed, involving a sequence of convolutional and pooling layers that reduce the number of qubits while preserving information about relevant data features.In this work, we rigorously analyze the gradient scaling for the parameters in the QCNN architecture.We find that the variance of the gradient vanishes no faster than polynomially, implying that QCNNs do not exhibit barren plateaus.This result provides an analytical guarantee for the trainability of randomly initialized QCNNs, which highlights QCNNs as being trainable under random initialization unlike many other QNN architectures.To derive our results, we introduce a novel graph-based method to analyze expectation values over Haar-distributed unitaries, which will likely be useful in other contexts.Finally, we perform numerical simulations to verify our analytical results.

arXiv:2011.02966Physical Review XOct 15, 2021343 citations