arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2311.12929quant-phcs.LG
收藏

量子机器学习的分层学习:大规模变分量子电路的新型训练技术

Hierarchical Learning for Quantum ML: Novel Training Technique for Large-Scale Variational Quantum Circuits

BlueQubit Inc(BlueQubit公司);Institute for Quantum Information and Matter, Caltech(加州理工学院量子信息与物质研究所);University of California, Berkeley(加州大学伯克利分校)

Hrant Gharibyan, Vincent Su, Hayk Tepanyan

AI总结:

提出分层学习架构,通过优先学习高有效位参数防止贫瘠高原,在27量子比特上实现约4%误差的高斯分布加载,首次展示大规模量子比特变分学习。

摘要:

我们提出了分层学习,这是一种用于高效训练大规模变分量子电路的新型变分架构。我们使用量子电路玻恩机(QCBMs)测试并基准测试了我们的分布加载技术。在QCBMs中,概率分布被加载到由比特串表示的计算基向量的平方幅度中。我们的关键洞察是利用这样一个事实:最高有效(量子)比特对最终分布的影响更大,并且可以首先被学习。人们可以将其视为逐层学习的推广,其中变分电路的一些参数被首先学习,以防止贫瘠高原现象。我们简要回顾了用于计算梯度的伴随方法,特别是针对那些不是可观测量期望值的损失函数。我们首先比较了变分拟设中连通性的作用,任务是在九个量子比特上加载高斯分布,发现2D连通性大大优于排列成一条线的量子比特。基于我们的观察,我们随后在GPU上的大规模数值实验中实现了这一策略,训练QCBM在27个量子比特上重现三维多元高斯分布,总变差距离达到约4%。尽管由于目标函数未与可观测量绑定,贫瘠高原论证在此并不严格适用,但据我们所知,这是在大规模量子比特上进行变分学习的首次实际演示。我们还演示了分层学习作为一种资源高效的方法,结合Fire Opal优化,为现有量子硬件(IBM的7和27量子比特设备)加载分布。

英文摘要:

We present hierarchical learning, a novel variational architecture for efficient training of large-scale variational quantum circuits. We test and benchmark our technique for distribution loading with quantum circuit born machines (QCBMs). With QCBMs, probability distributions are loaded into the squared amplitudes of computational basis vectors represented by bitstrings. Our key insight is to take advantage of the fact that the most significant (qu)bits have a greater effect on the final distribution and can be learned first. One can think of it as a generalization of layerwise learning, where some parameters of the variational circuit are learned first to prevent the phenomena of barren plateaus. We briefly review adjoint methods for computing the gradient, in particular for loss functions that are not expectation values of observables. We first compare the role of connectivity in the variational ansatz for the task of loading a Gaussian distribution on nine qubits, finding that 2D connectivity greatly outperforms qubits arranged on a line. Based on our observations, we then implement this strategy on large-scale numerical experiments with GPUs, training a QCBM to reproduce a 3-dimensional multivariate Gaussian distribution on 27 qubits up to $\sim4\%$ total variation distance. Though barren plateau arguments do not strictly apply here due to the objective function not being tied to an observable, this is to our knowledge the first practical demonstration of variational learning on large numbers of qubits. We also demonstrate hierarchical learning as a resource-efficient way to load distributions for existing quantum hardware (IBM's 7 and 27 qubit devices) in tandem with Fire Opal optimizations.

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

↑