A quantum Jensen-Shannon graph kernel using the continuous-time quantum walk
DOI10.1007/978-3-642-38221-5_13zbMATH Open1382.68160DBLPconf/gbrpr/BaiHTR13OpenAlexW1949805190WikidataQ60430890 ScholiaQ60430890MaRDI QIDQ4922155FDOQ4922155
Authors: Lu Bai, Edwin R. Hancock, Andrea Torsello, Luca Rossi 
Publication date: 28 May 2013
Published in: Graph-Based Representations in Pattern Recognition (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10278/37977
Recommendations
- A quantum Jensen-Shannon graph kernel for unattributed graphs
- A Quantum Jensen-Shannon Graph Kernel Using Discrete-Time Quantum Walks
- Attributed graph similarity from the quantum Jensen-Shannon divergence
- Graph kernels from the Jensen-Shannon divergence
- A Continuous-Time Quantum Walk Kernel for Unattributed Graphs
Graph theory (including graph drawing) in computer science (68R10) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
Cited In (10)
- Quantum walk and its application domains: a systematic review
- Bosonic random walk neural networks for graph learning
- A Mixed Weisfeiler-Lehman Graph Kernel
- A Quantum Jensen-Shannon Graph Kernel Using Discrete-Time Quantum Walks
- Title not available (Why is that?)
- A Continuous-Time Quantum Walk Kernel for Unattributed Graphs
- Depth-based complexity traces of graphs
- A quantum Jensen-Shannon graph kernel for unattributed graphs
- Attributed graph similarity from the quantum Jensen-Shannon divergence
- Graph kernels from the Jensen-Shannon divergence
This page was built for publication: A quantum Jensen-Shannon graph kernel using the continuous-time quantum walk
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4922155)
