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

保邻域嵌入的量子算法

Quantum algorithm for Neighborhood Preserving Embedding

Shi-Jie Pan, Lin-Chun Wan, Hai-Ling Liu, Yu-Sen Wu, Su-Juan Qin, Qiao-Yan Wen, Fei Gao

摘要:

邻域保持嵌入(NPE)是一种重要的线性降维技术,旨在保持局部流形结构。NPE包含三个步骤,即,找到每个数据点的最近邻,构造权矩阵,得到变换矩阵。Liang等人提出了一种用于NPE的变分量子算法(VQA)[Phys. Rev. A 101,032323(2020)]。该算法由三个量子子算法组成,对应于NPE的三个步骤,并预期在维度$n$上具有指数加速比。然而,该算法有两个缺点:(1)它是不完整的,在这个意义上,第三子算法的输入不能通过第二子算法获得。(2)它的复杂性不能严格分析,因为它的第三个子算法是一个VQA。在本文中,我们提出了一个完整的量子算法的NPE,我们重新设计的三个子算法,并给出了严格的复杂性分析。实验结果表明,与经典NPE算法相比,该算法在一定条件下可以在数据点个数$m$上实现多项式加速,在维数$n$上实现指数加速,与Liang等人的算法相比有显著的加速效果.的算法,即使不考虑复杂性的VQA。

英文摘要:

Neighborhood Preserving Embedding (NPE) is an important linear dimensionality reduction technique that aims at preserving the local manifold structure. NPE contains three steps, i.e., finding the nearest neighbors of each data point, constructing the weight matrix, and obtaining the transformation matrix. Liang et al. proposed a variational quantum algorithm (VQA) for NPE [Phys. Rev. A 101, 032323 (2020)]. The algorithm consists of three quantum sub-algorithms, corresponding to the three steps of NPE, and was expected to have an exponential speedup on the dimensionality $n$. However, the algorithm has two disadvantages: (1) It is incomplete in the sense that the input of the third sub-algorithm cannot be obtained by the second sub-algorithm. (2) Its complexity cannot be rigorously analyzed because the third sub-algorithm in it is a VQA. In this paper, we propose a complete quantum algorithm for NPE, in which we redesign the three sub-algorithms and give a rigorous complexity analysis. It is shown that our algorithm can achieve a polynomial speedup on the number of data points $m$ and an exponential speedup on the dimensionality $n$ under certain conditions over the classical NPE algorithm, and achieve significant speedup compared to Liang et al.'s algorithm even without considering the complexity of the VQA.

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

↑