arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.01496quant-phcond-mat.dis-nncs.CV
收藏

几何量子机器学习能否在条形码分类中带来优势?

Can Geometric Quantum Machine Learning Lead to Advantage in Barcode Classification?

University of Exeter(埃克塞特大学)

Chukwudubem Umeano, Stefano Scali, Oleksandr Kyriienko

AI总结:

本文提出一种带嵌入对称性的几何量子机器学习方法,通过对称感知测量自适应实现相似性分类,在条形码相似性测试中显著优于经典Siamese网络,并分析了其优势来源及与BQP复杂度分离问题的联系。

摘要:

我们考虑区分两个向量(可视化为图像或条形码)并学习它们是否彼此相关的问题。为此,我们开发了一种具有嵌入对称性的几何量子机器学习(GQML)方法,该方法允许基于全局相关性对相似和不相似对进行分类,并且能够仅从少量样本中进行泛化。与迄今为止开发的GQML算法不同,我们提出专注于优于酉参数化的对称感知测量自适应。我们将用于相似性测试的GQML与具有Siamese架构的经典深度神经网络和卷积神经网络进行比较。我们表明量子网络在很大程度上优于其经典对应物。我们通过分析用于组成我们数据集的相关分布来解释这种性能差异。我们将相似性测试与展示BQP复杂度类与多项式层级之间已证明的最大分离的问题联系起来。虽然实现优势的能力在很大程度上取决于数据加载方式,但我们讨论了类似问题如何从量子机器学习中受益。

英文摘要:

We consider the problem of distinguishing two vectors (visualized as images or barcodes) and learning if they are related to one another. For this, we develop a geometric quantum machine learning (GQML) approach with embedded symmetries that allows for the classification of similar and dissimilar pairs based on global correlations, and enables generalization from just a few samples. Unlike GQML algorithms developed to date, we propose to focus on symmetry-aware measurement adaptation that outperforms unitary parametrizations. We compare GQML for similarity testing against classical deep neural networks and convolutional neural networks with Siamese architectures. We show that quantum networks largely outperform their classical counterparts. We explain this difference in performance by analyzing correlated distributions used for composing our dataset. We relate the similarity testing with problems that showcase a proven maximal separation between the BQP complexity class and the polynomial hierarchy. While the ability to achieve advantage largely depends on how data are loaded, we discuss how similar problems can benefit from quantum machine learning.

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

↑