Cargando…
Continuous-time quantum walk based centrality testing on weighted graphs
Centrality measure is an essential tool in network analysis and widely used in the domain of computer science, biology and sociology. Taking advantage of the speedup offered by quantum computation, various quantum centrality measures have been proposed. However, few work of quantum centrality involv...
Autores principales: | Wang, Yang, Xue, Shichuan, Wu, Junjie, Xu, Ping |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group UK
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8994786/ https://www.ncbi.nlm.nih.gov/pubmed/35397632 http://dx.doi.org/10.1038/s41598-022-09915-1 |
Ejemplares similares
-
Transport Efficiency of Continuous-Time Quantum Walks on Graphs
por: Razzoli, Luca, et al.
Publicado: (2021) -
Implementing graph-theoretic quantum algorithms on a silicon photonic quantum walk processor
por: Qiang, Xiaogang, et al.
Publicado: (2021) -
Marking Vertices to Find Graph Isomorphism Mapping Based on Continuous-Time Quantum Walk
por: Wang, Xin, et al.
Publicado: (2018) -
Multi-qubit quantum computing using discrete-time quantum walks on closed graphs
por: Chawla, Prateek, et al.
Publicado: (2023) -
MapEff: An Effective Graph Isomorphism Agorithm Based on the Discrete-Time Quantum Walk
por: Liu, Kai, et al.
Publicado: (2019)