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.

arXiv comment2pages, 2figures, This paper will be published in the proceedings of the IEEE International Conference on Quantum Computing and Engineering 2024 (QCE24)

References in corpus (6)

• Experimental Implementation of Quantum Walks on IBM Quantum Computers
• Discrete-time quantum walk on complex networks for community detection
• Asymptotically Improved Circuit for $d$-ary Grover's Algorithm with Advanced Decomposition of $n$-qudit Toffoli Gate
• Efficient implementation of discrete-time quantum walks on quantum computers
• Circuit Implementation of Discrete-Time Quantum Walks via the Shunt Decomposition Method
• QWalkVec: Node Embedding by Quantum Walk