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

适合 NISQ 的基于测量的量子聚类算法

NISQ-friendly measurement-based quantum clustering algorithms

Srushti Patil, Shreya Banerjee, Prasanta K. Panigrahi

AI总结:

本文提出两种适合 NISQ 设备的基于测量的量子聚类算法,分别采用分裂式方法和基于非锐化测量的高斯效应算符,在同心圆、城市和乳腺癌数据集上以低量子资源实现有效聚类与高准确率分类。

摘要:

基于量子并行性和纠缠,提出了两种新颖的基于测量的量子聚类算法。第一种算法采用分裂式方法。第二种算法基于非锐化测量,我们构造了一个具有高斯概率分布的效应算符来聚类相似的数据点。这两种算法的一个主要优点是本质上简单、易于实现,并且非常适合含噪声的中等规模量子计算机。我们已成功将第一种算法应用于同心圆数据集(经典聚类方法在该数据集上失败),以及包含 130 个城市的 Churrtiz 数据集,并表明该算法以极低的量子资源成功运行。我们将第二种算法应用于带标签的 Wisconsin 乳腺癌数据集,发现它仅使用 O(log(D)) 个量子比特和多项式次测量就能以高准确率对数据集进行分类,其中 D 是数据集中任意两点之间的最大距离。我们还表明,该算法在量子系统中存在假定测量误差时表现更好,这使其极其适合 NISQ 设备。

英文摘要:

Two novel measurement-based, quantum clustering algorithms are proposed based on quantum parallelism and entanglement. The first algorithm follows a divisive approach. The second algorithm is based on unsharp measurements, where we construct an effect operator with a Gaussian probability distribution to cluster similar data points. A major advantage of both algorithms is that they are simplistic in nature, easy to implement, and well suited for noisy intermediate scale quantum computers. We have successfully applied the first algorithm on a concentric circle data set, where the classical clustering approach fails, as well as on the Churrtiz data set of $130$ cities, where we show that the algorithm succeeds with very low quantum resources. We applied the second algorithm on the labeled Wisconsin breast cancer dataset, and found that it is able to classify the dataset with high accuracy using only $O(log(D))$ qubits and polynomial measurements, where $D$ is the maximal distance within any two points in the dataset. We also show that this algorithm works better with an assumed measurement error in the quantum system, making it extremely well-suited for NISQ devices.

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

↑