.png){kind=icon}
返回
Variational quantum algorithm for node embedding
.png){kind=icon}
OA
AI
DOI：10.1016/j.fmre.2023.10.001.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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(log(N)) 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(poly(log(N))) 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.
Keyword:
Quantum machine learning
Quantum computation
Node embedding
Variational quantum algorithm
Nuclear magnetic resonance
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.3
论文数:
1.3K
被引数:
2.6K
机构
引用论文
Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution.png)
NATURE PHYSICS
NATURE PHYSICSIF18.4
PREAI
分享收藏A variational eigenvalue solver on a photonic quantum processor光子量子处理器上的变分特征值求解器NATURE COMMUNICATIONSOAAI
NATURE COMMUNICATIONSIF15.7
OAAI分享收藏分享收藏
查看更多内容