arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2301.01232quant-ph
收藏

利用二进制高斯玻色采样实现高效的图分类

Sample efficient graph classification using binary Gaussian boson sampling

University of Virginia(弗吉尼亚大学)

Amanuel Anteneh, Olivier Pfister

AI总结:

本文提出一种基于高斯玻色采样的量子算法,用于图结构数据分类,采用二进制探测器简化实现,同时探讨图论与Torontonian矩阵函数的关系。

摘要:

我们提出了一种用于图结构数据分类的量子算法变种。该算法采用基于高斯玻色采样(GBS)的特征提取策略,这是一种近期量子计算模型。与现有算法不同,我们的GBS设置仅需二进制(光/无光)探测器,而非光子数分辨探测器。这些探测器技术更简单,可在室温下运行,使我们的算法更复杂且更经济。我们还探讨了图论与称为Torontonian的矩阵函数之间的联系,该函数表征了二进制GBS探测事件的概率。

英文摘要:

We present a variation of a quantum algorithm for the machine learning task of classification with graph-structured data. The algorithm implements a feature extraction strategy that is based on Gaussian boson sampling (GBS) a near term model of quantum computing. However, unlike the currently proposed algorithms for this problem, our GBS setup only requires binary (light/no light) detectors, as opposed to photon number resolving detectors. These detectors are technologically simpler and can operate at room temperature, making our algorithm less complex and less costly to implement on the physical hardware. We also investigate the connection between graph theory and the matrix function called the Torontonian which characterizes the probabilities of binary GBS detection events.

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

↑