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

量子极值学习

Quantum Extremal Learning

Discovery Sciences, Janssen Research \& Development, a division of Janssen Pharmaceutica N.V., Turnhoutseweg 30, B-2340 Beerse, Belgium

Savvas Varsamopoulos, Evan Philip, Herman W. T. van Vlijmen, Sairam Menon, Ann Vos, Natalia Dyubankova, Bert Torfs, Anthony Rowe, Vincent E. Elfving

AI总结:

提出量子极值学习算法,结合变分量子电路与解析微分,在稀疏数据下高效求解隐藏函数极值,支持离散与连续变量,并扩展至高维与复杂方程。

摘要:

我们提出了一种用于“极值学习”的量子算法,该过程是在仅给定部分输入-输出(训练)数据的情况下,找到使隐藏函数输出极值化的输入,而无需直接访问隐藏函数。该算法称为量子极值学习(QEL),由一个参数化量子电路组成,该电路通过变分训练来建模数据输入-输出关系,并且其中可训练的量子特征映射(编码输入数据)被解析地微分,以找到使模型极值化的坐标。这使得在单个电路/量子计算机上,能够将成熟的量子机器学习建模与成熟的量子优化相结合。我们在一系列基于离散或连续输入变量的经典数据集上测试了我们的算法,这两种变量都与该算法兼容。对于离散变量,我们基于Max-Cut问题生成器构建的合成问题以及输入-输出关系中的高阶相关性测试了我们的算法。对于连续变量,我们在1D合成数据集和简单常微分函数上测试了我们的算法。我们发现,即使训练数据集稀疏或仅覆盖输入配置空间的一小部分,该算法也能成功找到此类问题的极值。我们还展示了该算法如何用于更高维度、复杂微分方程以及建模和优化ansatz选择完全灵活的更一般情况。我们设想,由于其通用框架和简单构造,QEL算法将能够解决不同领域的各种应用,开辟进一步研究的领域。

英文摘要:

We propose a quantum algorithm for `extremal learning', which is the process of finding the input to a hidden function that extremizes the function output, without having direct access to the hidden function, given only partial input-output (training) data. The algorithm, called quantum extremal learning (QEL), consists of a parametric quantum circuit that is variationally trained to model data input-output relationships and where a trainable quantum feature map, that encodes the input data, is analytically differentiated in order to find the coordinate that extremizes the model. This enables the combination of established quantum machine learning modelling with established quantum optimization, on a single circuit/quantum computer. We have tested our algorithm on a range of classical datasets based on either discrete or continuous input variables, both of which are compatible with the algorithm. In case of discrete variables, we test our algorithm on synthetic problems formulated based on Max-Cut problem generators and also considering higher order correlations in the input-output relationships. In case of the continuous variables, we test our algorithm on synthetic datasets in 1D and simple ordinary differential functions. We find that the algorithm is able to successfully find the extremal value of such problems, even when the training dataset is sparse or a small fraction of the input configuration space. We additionally show how the algorithm can be used for much more general cases of higher dimensionality, complex differential equations, and with full flexibility in the choice of both modeling and optimization ansatz. We envision that due to its general framework and simple construction, the QEL algorithm will be able to solve a wide variety of applications in different fields, opening up areas of further research.

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

↑