Variational quantum algorithm for node embedding

Abstract

Quantum machine learning has made remarkable progress in many important tasks. However, the gate complexity of the initial state preparation is seldom considered in lots of quantum machine learning algorithms, making them non-end-to-end. Herein, we propose a quantum algorithm for the node embedding problem that maps a node graph’s topological structure to embedding vectors. The resulting quantum embedding state can be used as an input for other quantum machine learning algorithms. With $O\left(\log \right(N\left)\right)$ qubits to store the information of $N$ nodes, our algorithm will not lose quantum advantage for the subsequent quantum information processing. Moreover, owing to the use of a parameterized quantum circuit with $O\left(\text{poly}\right(\log \left(N\right)\left)\right)$ depth, the resulting state can serve as an efficient quantum database. In addition, we explored the measurement complexity of the quantum node embedding algorithm, which is the main issue in training parameters, and extended the algorithm to capture high-order neighborhood information between nodes. Finally, we experimentally demonstrated our algorithm on an nuclear magnetic resonance quantum processor to solve a graph model.