arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2012.14439quant-phphysics.comp-ph
收藏

分支量子卷积神经网络

Branching Quantum Convolutional Neural Networks

Ian MacCormack, Conor Delaney, Alexey Galda, Nidhi Aggarwal, Prineha Narang

摘要:

基于神经网络的算法已经在凝聚态物理中获得了相当大的关注,因为它们能够从非常高维的数据集中学习复杂的模式,从而对多体量子系统中的纠缠和关联的复杂长程模式进行分类。小型量子计算机已经在大型量子和超大型经典数据集的学习任务中显示出潜在的收益。量子卷积神经网络(QCNN)是一类特别有趣的算法,它可以通过对量子物质的非平凡相执行二进制分类任务来学习量子数据集的特征。受这一承诺的启发,我们提出了QCNN的泛化,分支量子卷积神经网络,或bQCNN,具有更高的表达能力。bQCNN的一个关键特征是它利用在池化层中获得的在电流捕获离子系统上可实现的中间电路(中间)测量结果来确定哪些参数集将用于电路的后续卷积层。这导致分支结构,其允许在给定电路深度中的更大数量的可训练变分参数。这在当前的NISQ器件上特别有用,因为电路深度受到栅极噪声的限制。我们提出了一个概述的anterior结构和缩放,并提供证据,其增强的表达能力相比,QCNN。使用人工构建的训练状态的大数据集作为概念验证,我们证明了bQCNN远远优于普通QCNN的训练任务的存在。最后,我们提出了未来的方向,其中bQCNN中的经典分支结构和可训练参数的密度增加将特别有价值。

英文摘要:

Neural network-based algorithms have garnered considerable attention in condensed matter physics for their ability to learn complex patterns from very high dimensional data sets towards classifying complex long-range patterns of entanglement and correlations in many-body quantum systems. Small-scale quantum computers are already showing potential gains in learning tasks on large quantum and very large classical data sets. A particularly interesting class of algorithms, the quantum convolutional neural networks (QCNN) could learn features of a quantum data set by performing a binary classification task on a nontrivial phase of quantum matter. Inspired by this promise, we present a generalization of QCNN, the branching quantum convolutional neural network, or bQCNN, with substantially higher expressibility. A key feature of bQCNN is that it leverages mid-circuit (intermediate) measurement results, realizable on current trapped-ion systems, obtained in pooling layers to determine which sets of parameters will be used in the subsequent convolutional layers of the circuit. This results in a branching structure, which allows for a greater number of trainable variational parameters in a given circuit depth. This is of particular use on current-day NISQ devices, where circuit depth is limited by gate noise. We present an overview of the ansatz structure and scaling, and provide evidence of its enhanced expressibility compared to QCNN. Using artificially-constructed large data sets of training states as a proof-of-concept we demonstrate the existence of training tasks in which bQCNN far outperforms an ordinary QCNN. Finally, we present future directions where the classical branching structure and increased density of trainable parameters in bQCNN would be particularly valuable.

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

↑