Quantum walk neural networks for graph-structured data

5Citations
Citations of this article
38Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In recent years, neural network architectures designed to operate on graph-structured data have pushed the state-of-the-art in the field. A large set of these architectures utilize a form of classical random walks to diffuse information throughout the graph. We propose quantum walk neural networks (QWNN), a novel graph neural network architecture based on quantum random walks, the quantum parallel to classical random walks. A QWNN learns a quantum walk on a graph to construct a diffusion operator which can then be applied to graph-structured data. We demonstrate the use of this model on a variety of prediction tasks on graphs involving temperature, biological, and molecular datasets.

Cite

CITATION STYLE

APA

Dernbach, S., Mohseni-Kabir, A., Pal, S., & Towsley, D. (2019). Quantum walk neural networks for graph-structured data. In Studies in Computational Intelligence (Vol. 813, pp. 182–193). Springer Verlag. https://doi.org/10.1007/978-3-030-05414-4_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free