Graph Embedding Using Quantum Commute Times
Si trova su / Altri legami
In this paper, we explore analytically and experimentally the commute time of the continuous–time quantum walk. For the classical random walk, the commute time has been shown to be robust to errors in edge weight structure and to lead to spectral clustering algorithms with improved performance. Our analysis shows that the commute time of the continuous–time quantum walk can be determined via integrals of the Laplacian spectrum, calculated using Gauss–Laguerre quadrature. We analyse the quantum commute times with reference to their classical counterpart. Experimentally, we show that the quantum commute times can be used to emphasise cluster–structure
# | Istituto/Sede | Collocazione | Inventario patrimoniale |
---|---|---|---|
Area della ricerca di Genova, Servizio di Documentazione Scientifica | Sede di Genova |