Bosonic random walk neural networks for graph learning
From MaRDI portal
Publication:5050348
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
- scientific article; zbMATH DE number 5320343 (Why is no real title available?)
- A Continuous-Time Quantum Walk Kernel for Unattributed Graphs
- A quantum Jensen-Shannon graph kernel using the continuous-time quantum walk
- An enhanced classical approach to graph isomorphism using continuous-time quantum walk
- Efficient quantum algorithms for simulating sparse Hamiltonians
- Graph kernels
- Multi-Walker discrete time quantum walks on arbitrary graphs, their properties and their photonic implementation
- On graph kernels: hardness results and efficient alternatives.
- One-dimensional quantum walks
- Quantum neural networks
- Quantum walk on distinguishable non-interacting many-particles and indistinguishable two-particle
- Quantum walks on graphs
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)