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.
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.
Several architectures have been proposed for quantum neural networks (QNNs), with the goal of efficiently performing machine learning tasks on quantum data. Rigorous scaling results are urgently needed for specific QNN constructions to understand which, if any, will be trainable at a large scale. Here, we analyze the gradient scaling (and hence the trainability) for a recently proposed architecture that we call dissipative QNNs (DQNNs), where the input qubits of each layer are discarded at the layer's output. We find that DQNNs can exhibit barren plateaus, i.e., gradients that vanish exponentially in the number of qubits. Moreover, we provide quantitative bounds on the scaling of the gradient for DQNNs under different conditions, such as different cost functions and circuit depths, and show that trainability is not always guaranteed. Our work represents the first rigorous analysis of the scalability of a perceptron-based QNN.
While Quantum Convolutional Neural Networks (QCNNs) offer a theoretical paradigm for quantum machine learning, their practical implementation is severely bottlenecked by barren plateaus -- the exponential vanishing of gradients -- and poor empirical accuracy compared to classical counterparts. In this work, we propose a novel QCNN architecture utilizing localized cost functions and a hardware-efficient tensor-network initialization strategy to provably mitigate barren plateaus. We evaluate our scalable QCNN on the MNIST dataset, demonstrating a significant performance leap. By resolving the gradient vanishing issue, our optimized QCNN achieves a classification accuracy of 98.7\%, a substantial improvement over the baseline QCNN accuracy of 52.32\% found in unmitigated models. Furthermore, we provide empirical evidence of a parameter-efficiency advantage, requiring O(logN) fewer trainable parameters than equivalent classical CNNs to achieve >95% convergence. This work bridges the gap between theoretical quantum utility and practical application, providing a scalable framework for quantum computer vision tasks without succumbing to loss landscape concentration.
Barren plateaus -- the exponential vanishing of gradients -- are a fundamental obstacle to training scalable quantum neural networks. Whether they arise in quantum recurrent neural networks (QRNNs), a natural architecture for sequential data, remains a pressing question. Here we show that the decisive ingredient for trainability in QRNNs is not the recurrent circuit topology per se, but enforcing time-translation symmetry through parameter sharing across time steps. We prove that, without parameter sharing, QRNNs suffer from barren plateaus, with gradient variance decaying exponentially with sequence length. Imposing parameter sharing across time steps fundamentally alters this scaling, transforming it into a polynomial dependence and thereby suppressing the barren plateau. Numerical simulations corroborate these analytical predictions. By rigorously showing how time-translation symmetry suppresses barren plateaus and enhances learning capability in QRNNs, our work establishes task-aligned symmetry as a constructive resolution to the expressivity-trainability tension in quantum neural networks.
Abstract Quantum Convolutional Neural Networks(QCNN) are a promising framework in QuantumMachine Learning(QML). The study analyzes QCNNs’ expressibility, trainability, and optimizers theoretically. This approach utilizes statistical learning and quantum information theory to assess QCNNs’ effectiveness in imitating quantum states, optimizing parameters, and executing intricate machine learning(ML) tasks. For this purpose, the Haar measure is used to evaluate the QCNN expressibility, yielding a score of 0.7720, acoverage entropy of 1.4023, and an effective state-space dimension of 166.59/200. This indicates that QCNNs can simulate massive quantum states and achieve a peak expressibility score of 0.8120 at layer 3, before decreasing due to overparameterization. Additionally, we examine gradient variance and find that the barren plateau indicator is 0.0818 and the mean gradient norm is 1.1837, both of which are below the theoretical threshold of 0.1, proving that the QCNN can avoid barren plateaus and train perfectly. Furthermore, the obtained Fisher Information Matrix(FIM) condition number of 2.05 ×10³ indicates a well-conditioned optimization landscape. We also utilized the Hessian matrix for optimization analysis, identifying a saddle point with 56 zero, 11 positive,and 5 negative eigenvalues. Where QCNNs required only 72 parameters, an 11.8-fold reduction from classical CNNs’ 848 parameters, but expressibility stays the same, assuming smooth convergence. Despite a gradient noise factor near 1, QCNNs have only a 43% expressibility decrease at 5% noise levels. Finally, the outcomes prove that QCNNs outperform classical CNNs in ML applications with respect to expressibility, trainability, and optimization.
Quantum neural networks (QNNs) leverage quantum entanglement and superposition to enable large-scale parallel linear computation, offering a potential solution to the scalability limits of classical deep learning. However, their practical deployment is hampered by two key challenges: the lack of intrinsic nonlinear operations and the barren plateau phenomenon. We propose a quantum convolutional neural network (QCNN) architecture that simultaneously addresses both issues. Nonlinear effects are introduced via orthonormal basis expansions of power series, while barren plateaus are mitigated by directly parameterizing unitary matrices rather than stacking multiple parameterized gates. Our design further incorporates quantum analogs of convolutional kernels and strides for scalable circuit construction. Experiments on MNIST and Fashion-MNIST datasets achieve 99.0% and 88.0% test accuracy, respectively. Consistency between PyTorch-based matrix simulation and Qiskit-based quantum circuit simulation validates the physical fidelity of the model. These results demonstrate a flexible and effective quantum architecture that faithfully integrates classical convolutional mechanisms into a quantum framework, paving the way for practical and expressive QNNs.
Quantum convolutional neural networks (QCNNs) represent a promising approach in quantum machine learning, paving new directions for both quantum and classical data analysis. This approach is particularly attractive due to the absence of the barren plateau problem, a fundamental challenge in training quantum neural networks (QNNs), and its feasibility. However, a limitation arises when applying QCNNs to classical data. The network architecture is most natural when the number of input qubits is a power of two, as this number is reduced by a factor of two in each pooling layer. The number of input qubits determines the dimensions (i.e., the number of features) of the input data that can be processed, restricting the applicability of QCNN algorithms to real-world data. To address this issue, we propose a QCNN architecture capable of handling arbitrary input data dimensions while optimizing the allocation of quantum resources such as ancillary qubits and quantum gates. This optimization is not only important for minimizing computational resources, but also essential in noisy intermediate-scale quantum (NISQ) computing, as the size of the quantum circuits that can be executed reliably is limited. Through numerical simulations, we benchmarked the classification performance of various QCNN architectures across multiple datasets with arbitrary input data dimensions, including MNIST, Landsat satellite, Fashion-MNIST, and Ionosphere. The results validate that the proposed QCNN architecture achieves excellent classification performance while utilizing a minimal resource overhead, providing an optimal solution when reliable quantum computation is constrained by noise and imperfections.