A quantum walk-based scheme for distributed searching on arbitrary graphs
Quantum Physics
2023-12-27 v2 Distributed, Parallel, and Cluster Computing
Abstract
A discrete time quantum walk is known to be the single-particle sector of a quantum cellular automaton. Searching in this mathematical framework has interested the community since a long time. However, most results consider spatial search on regular graphs. This work introduces a new quantum walk-based searching scheme, designed to search nodes or edges on arbitrary graphs. As byproduct, such new model allows to generalise quantum cellular automata, usually defined on regular grids, to quantum anonymous networks, allowing a new physics-like mathematical environment for distributed quantum computing.
Cite
@article{arxiv.2310.10451,
title = {A quantum walk-based scheme for distributed searching on arbitrary graphs},
author = {Mathieu Roget and Giuseppe Di Molfetta},
journal= {arXiv preprint arXiv:2310.10451},
year = {2023}
}
Comments
12 pages