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

变分量子近似谱聚类

Quantum Spectral Clustering Framework via Compact Circuit Structures

KAIST(韩国科学技术院);Qunova Computing, Inc.(Qunova计算公司)

Hyeong-Gyu Kim, Siheon Park, June-Koo Kevin Rhee

AI总结:

针对经典谱聚类计算成本随数据集规模呈三次方增长的问题,提出变分量子近似谱聚类(VQASC)方法,利用深度呈亚二次方增长的高效量子电路计算无向图加权和,并结合经验风险公式减少局部最小值影响,在真实数据集模拟中验证了有效性。

摘要:

聚类是一项仅基于数据底层分布来分析无标签数据的基础任务。谱聚类是一种将数据集表示为图并利用数据点间关系的聚类方法。然而,经典谱聚类方法会产生高昂的计算成本,该成本随数据集大小呈三次方增长——这通常是涉及求解特征值问题的方法所具有的典型特征。在本研究中,我们提出了变分量子近似谱聚类(VQASC),将基于量子距离的分类器模型扩展到聚类框架中。我们的方法采用高效的量子电路设计,其深度随数据集大小呈亚二次方增长,从而能够计算无向图的各种矩阵表示上的加权和。此外,我们采用经验风险公式化方法,以减少参数化量子电路中出现的局部最小值的影响,并通过在真实世界数据集上的模拟验证了我们的方法。

英文摘要:

Spectral machine learning methods based on spectral graph theory are powerful but scale poorly due to costly eigen-analysis. Although various eigenvector approximation methods have been proposed, the construction of a partial kernel matrix still remains within their frameworks. This work presents compact quantum circuit designs for spectral clustering in which the eigenproblem is approximated via a Rayleigh-Ritz formulation that bypasses kernel matrix construction and whose overall depth is dominated by the data-embedding routine. A rigorous shot complexity analysis is provided, showing that the sampling-based estimation remains tractable for the spectral clustering objective including a penalty term. Simulations on canonical datasets demonstrate reliable optimization behavior with an under-parameterized hardware-efficient ansatz. Finite-shot simulations further confirm the predicted sampling behavior of the penalty estimator, validating the main claims as a proof of concept.

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

↑