arXiv Analytics

Sign in

arXiv:2408.15653 [quant-ph]AbstractReferencesReviewsResources

Circuit Implementation of Discrete-Time Quantum Walks on Complex Networks

Rei Sato, Kazuhiro Saito

Published 2024-08-28Version 1

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.

Comments: 2pages, 2figures, This paper will be published in the proceedings of the IEEE International Conference on Quantum Computing and Engineering 2024 (QCE24)
Categories: quant-ph
Related articles: Most relevant | Search more
arXiv:2202.09080 [quant-ph] (Published 2022-02-18)
Design for implementation of discrete-time quantum walk with circulant matrix on graph by optical polarizing elements
arXiv:1708.01052 [quant-ph] (Published 2017-08-03)
Resonant-tunneling in discrete-time quantum walk
arXiv:2405.17230 [quant-ph] (Published 2024-05-27)
Synergistic Dynamical Decoupling and Circuit Design for Enhanced Algorithm Performance on Near-Term Quantum Devices