Quantum walk neural networks with feature dependent coins
Abstract Recent 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 o...
Main Authors: | Stefan Dernbach, Arman Mohseni-Kabir, Siddharth Pal, Miles Gepner, Don Towsley |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2019-09-01
|
Series: | Applied Network Science |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1007/s41109-019-0188-2 |
Similar Items
-
Implementing Parrondo’s paradox with two-coin quantum walks
by: Jishnu Rajendran, et al.
Published: (2018-01-01) -
Quantum walks with classically entangled light
by: Sephton, Bereneice B.
Published: (2019) -
Spin Diffusion Associated with a Quantum Random Walk on a One-Dimensional Lattice
by: Chilukuri, Raghu N.
Published: (2014) -
A Simulation Study of Walks in Large Social Graphs
by: Anwar, Shahed
Published: (2015) -
Can a Quantum Walk Tell Which Is Which?A Study of Quantum Walk-Based Graph Similarity
by: Giorgia Minello, et al.
Published: (2019-03-01)