Circuit Implementation of Discrete-Time Quantum Walks on Complex Networks
Abstract
In this paper, we propose a circuit design for implementing quantum walks on complex networks. Quantum walks are powerful tools for various graph-based applications such as spatial search, community detection, and node classification. Although many quantum-walk-based graph algorithms have been extensively studied, specific quantum circuits for implementing these algorithms have not yet been provided. To address this issue, we present a circuit design for implementing the discrete-time quantum walk on complex networks. We investigate the functionality of our circuit using the small-sized Watts-and-Strogatz model as the complex network model, comparing it with theoretical calculations. This work offers a new approach to constructing quantum circuits for implementing quantum walks on arbitrary complex networks.
Cite
@article{arxiv.2408.15653,
title = {Circuit Implementation of Discrete-Time Quantum Walks on Complex Networks},
author = {Rei Sato and Kazuhiro Saito},
journal= {arXiv preprint arXiv:2408.15653},
year = {2026}
}
Comments
2pages, 2figures, This paper will be published in the proceedings of the IEEE International Conference on Quantum Computing and Engineering 2024 (QCE24)