Quantum algorithm for neighborhood preserving embedding

Abstract

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 not known how to efficiently obtain the input of the third sub-algorithm from the output of the second one. (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.

A Quantum Algorithm for Solving Eigenproblem of the Laplacian Matrix of a Fully Connected Weighted Graph

“…(3.3) Use quantum algorithm for finding the minimum [48] to reveal the d minimized nonzero eigenvalues 𝛾 j , and we also can obtain the sample of the corresponding eigenvectors in the form quantum states |u j ⟩ ∝ u j (the exact eigenvector), j = 1, … , d. [9] Therefore, we can exact the eigeninformation of .…”

“…Quantum computing has exhibited potential acceleration advantages over classical computing by exploiting the unique properties of superposition and entanglement in quantum mechanics in solving certain problems, such as factoring integers, [1] unstructured database searching, [2] solving equations, [3][4][5] regression, [6,7] dimensionality reduction, [8,9] mean centering. [10] Overviews on quantum algorithms can be seen in refs.…”

Finger knuckle pattern person identification system based on LDP-NPE and machine learning methods

“…NPE is a significant direct dimensionality decrease technique that works at safeguarding the nearby complex design [25]. Less number of highlights are simpler to make due.…”

Quantum discriminative canonical correlation analysis

“…As a promising new computing paradigm, quantum computing has shown enormous power over classical computing due to its inherent parallelism and entanglement [1,2]. In recent years, a series of quantum algorithms have been proposed with significant speedups compared with their classical counterparts, such as classification [3][4][5][6], linear regression [7][8][9], dimensionality reduction [10][11][12][13], matrix computation [14][15][16][17]. Designing quantum algorithms to accelerate the corresponding classical ones has appeared as a remarkable emerging direction in the field of quantum computing.…”