Abstract
AbstractRecent neural networks designed to operate on graph-structured data have proven effective in many domains. These graph neural networks often diffuse information using the spatial structure of the graph. We propose a quantum walk neural network that learns a diffusion operation that is not only dependent on the geometry of the graph but also on the features of the nodes and the learning task. A quantum walk neural network is based on learning the coin operators that determine the behavior of quantum random walks, the quantum parallel to classical random walks. We demonstrate the effectiveness of our method on multiple classification and regression tasks at both node and graph levels.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computer Networks and Communications,Multidisciplinary
Reference58 articles.
1. Agarwal, GS, Pathak PK (2005) Quantum random walk of the field in an externally driven cavity. Phys Rev A 72(3):033815.
2. Aharonov, Y, Davidovich L, Zagury N (1993) Quantum random walks. Phys Rev A 48(2):1687.
3. Aharonov, D, Ambainis A, Kempe J, Vazirani U (2001) Quantum Walks on Graphs In: Proceedings of the Thirty-third Annual ACM Symposium on Theory of Computing, 50–59.. ACM, New York.
4. Ahmad, R, Sajjad U, Sajid M (2019) One-dimensional quantum walks with a position-dependent coin. arXiv preprint arXiv:1902.10988.
5. Altaisky, M (2001) Quantum neural network. arXiv preprint quant-ph/0107012.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献