Analyzing the Expressibility and Trainability of Quantum Convolutional Neural Networks
Asif Akhtab Ronggon, Tuhin Hossain, Tahani Jaser Alahmadi, Mohammad Ali Moni
Abstract
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.