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

用于持久图的量子距离近似

Quantum Distance Approximation for Persistence Diagrams

The University of Tennessee(田纳西大学)

Bernardo Ameneyro, Rebekah Herrman, George Siopsis, Vasileios Maroulas

AI总结:

本文提出变分量子算法估计持久图间的Wasserstein距离和$d^{c}_{p}$距离,通过带控制子句的加权QAOA编码匹配约束,探索量子计算在拓扑数据分析距离计算中的潜力。

摘要:

拓扑数据分析方法在许多不同领域的分类和聚类任务中可能非常有用,因为它们能够提供二维持久图,概括潜在复杂且高维数据集的重要形状信息。持久图空间可以赋予多种度量,例如Wasserstein距离,这些度量具有统计结构,并允许将这些摘要用于机器学习算法。然而,计算两个持久图之间的距离涉及寻找匹配两个图中点的最优方式,对于经典计算机而言,这可能并不总是一项容易的任务。在这项工作中,我们探索了量子计算机估计持久图之间距离的潜力,特别是我们提出了用于Wasserstein距离以及$d^{c}_{p}$距离的变分量子算法。我们的实现是Quantum Approximate Optimization Algorithm的加权版本,依赖控制子句来编码优化问题的约束。

英文摘要:

Topological Data Analysis methods can be useful for classification and clustering tasks in many different fields as they can provide two dimensional persistence diagrams that summarize important information about the shape of potentially complex and high dimensional data sets. The space of persistence diagrams can be endowed with various metrics such as the Wasserstein distance which admit a statistical structure and allow to use these summaries for machine learning algorithms. However, computing the distance between two persistence diagrams involves finding an optimal way to match the points of the two diagrams and may not always be an easy task for classical computers. In this work we explore the potential of quantum computers to estimate the distance between persistence diagrams, in particular we propose variational quantum algorithms for the Wasserstein distance as well as the $d^{c}_{p}$ distance. Our implementation is a weighted version of the Quantum Approximate Optimization Algorithm that relies on control clauses to encode the constraints of the optimization problem.

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

↑