arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2011.02966quant-phcs.LGstat.ML
收藏

量子卷积神经网络中的“贫瘠高原”现象

Absence of Barren Plateaus in Quantum Convolutional Neural Networks

Los Alamos National Laboratory(洛斯阿拉莫斯国家实验室);University College London(伦敦大学学院);Imperial College London(帝国理工学院)

Arthur Pesah, M. Cerezo, Samson Wang, Tyler Volkoff, Andrew T. Sornborger, Patrick J. Coles

摘要:

量子神经网络(QNN)已经引起了人们对有效分析量子数据的可能性的兴奋。但是,对于许多QNN架构来说,这种兴奋已经被指数消失的梯度(称为贫瘠的高原景观)的存在所缓和。最近,人们提出了量子卷积神经网络(QCNN),它涉及一系列卷积和池化层,可以减少量子比特的数量,同时保留有关相关数据特征的信息。在这项工作中,我们严格分析了QCNN架构中参数的梯度缩放。我们发现梯度的方差消失的速度并不比多项式快,这意味着QCNN不会表现出贫瘠的高原。这为随机初始化的QCNN的可训练性提供了分析保证,这突出了QCNN在随机初始化下可训练,与许多其他QNN架构不同。为了得到我们的结果,我们引入了一种新的基于图的方法来分析Haar分布酉的期望值,这在其他情况下可能是有用的。最后,我们进行数值模拟,以验证我们的分析结果。

英文摘要:

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 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑