监督机器学习中严格而稳健的量子加速
A rigorous and robust quantum speed-up in supervised machine learning
摘要:
在过去的几年里,提出了几种量子机器学习算法,这些算法承诺量子速度超过经典算法。大多数这些学习算法要么假设量子访问数据-使得不清楚量子加速是否仍然存在,而不做出这些强有力的假设,要么本质上是启发式的,与经典算法相比没有可证明的优势。在本文中,我们建立了一个严格的量子加速监督分类使用通用的量子学习算法,只需要经典的数据访问。我们的量子分类器是一个传统的支持向量机,它使用容错量子计算机来估计核函数。数据样本被映射到量子特征空间,并且核条目可以被估计为量子线路的跃迁幅度。我们构建了一个家庭的数据集,并表明没有经典的学习者可以分类的数据逆多项式比随机猜测,假设广泛认为离散对数问题的硬度。同时,量子分类器实现了高精度,并且对有限采样统计引起的核条目中的加性错误具有鲁棒性。
英文摘要:
Over the past few years several quantum machine learning algorithms were proposed that promise quantum speed-ups over their classical counterparts. Most of these learning algorithms either assume quantum access to data -- making it unclear if quantum speed-ups still exist without making these strong assumptions, or are heuristic in nature with no provable advantage over classical algorithms. In this paper, we establish a rigorous quantum speed-up for supervised classification using a general-purpose quantum learning algorithm that only requires classical access to data. Our quantum classifier is a conventional support vector machine that uses a fault-tolerant quantum computer to estimate a kernel function. Data samples are mapped to a quantum feature space and the kernel entries can be estimated as the transition amplitude of a quantum circuit. We construct a family of datasets and show that no classical learner can classify the data inverse-polynomially better than random guessing, assuming the widely-believed hardness of the discrete logarithm problem. Meanwhile, the quantum classifier achieves high accuracy and is robust against additive errors in the kernel entries that arise from finite sampling statistics.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。