基于矩阵乘积状态的量子K-means算法
Quantum inspired K-means algorithm using matrix product states
摘要:
矩阵乘积态已经成为研究一维相互作用量子多体系统时的首选算法,它证明了能够探索指数大量子希尔伯特空间的最相关部分并找到精确的解决方案。本文提出了一种基于量子思想的K-means聚类算法,该算法首先将经典数据映射为矩阵乘积态表示的量子态,然后在扩展的空间中利用变分矩阵乘积态方法最小化损失函数.我们通过将其应用于几个常用的机器学习数据集来展示该算法的性能,并表明该算法可以达到更高的预测精度,并且与经典的K-means算法相比,它不太可能陷入局部极小值。
英文摘要:
Matrix product state has become the algorithm of choice when studying one-dimensional interacting quantum many-body systems, which demonstrates to be able to explore the most relevant portion of the exponentially large quantum Hilbert space and find accurate solutions. Here we propose a quantum inspired K-means clustering algorithm which first maps the classical data into quantum states represented as matrix product states, and then minimize the loss function using the variational matrix product states method in the enlarged space. We demonstrate the performance of this algorithm by applying it to several commonly used machine learning datasets and show that this algorithm could reach higher prediction accuracies and that it is less likely to be trapped in local minima compared to the classical K-means algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。