Bosonic random walk neural networks for graph learning
From MaRDI portal
Publication:5050348
DOI10.1007/978-3-030-93413-2_34OpenAlexW4205281995MaRDI QIDQ5050348FDOQ5050348
Authors: Shiv Shankar, Don Towsley
Publication date: 15 November 2022
Published in: Complex Networks & Their Applications X (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.00082
Recommendations
- A Quantum Jensen-Shannon Graph Kernel Using Discrete-Time Quantum Walks
- Graph neural networks: foundations, frontiers, and applications
- A quantum model of feed-forward neural networks with unitary learning algorithms
- Fast Haar transforms for graph neural networks
- Understanding the message passing in graph neural networks via power iteration clustering
Cites Work
- Graph kernels
- Efficient quantum algorithms for simulating sparse Hamiltonians
- One-dimensional quantum walks
- Quantum walks on graphs
- On graph kernels: hardness results and efficient alternatives.
- Multi-Walker discrete time quantum walks on arbitrary graphs, their properties and their photonic implementation
- Quantum walk on distinguishable non-interacting many-particles and indistinguishable two-particle
- Quantum neural networks
- Title not available (Why is that?)
- An enhanced classical approach to graph isomorphism using continuous-time quantum walk
- A quantum Jensen-Shannon graph kernel using the continuous-time quantum walk
- A Continuous-Time Quantum Walk Kernel for Unattributed Graphs
Cited In (1)
Uses Software
This page was built for publication: Bosonic random walk neural networks for graph learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5050348)