Implementation of Continuous-Time Quantum Walks on Quantum Computers

Abstract

Quantum walk is a useful model to simulate complex quantum systems and to build quantum algorithms; in particular, to develop spatial search algorithms on graphs, which aim to find a marked vertex as quickly as possible. Quantum walks are interesting candidates to be implemented on quantum computers. In this work, we describe efficient circuits that implement the evolution operator of continuous-time quantum-walk-based search algorithms on three graph classes: complete graphs, complete bipartite graphs, and hypercubes. For the class of complete and complete bipartite graphs, the circuits implement the evolution operator exactly. For the class of hypercubes, the circuit implements an approximate evolution operator, which tends to the exact evolution operator when the number of vertices is large. Our Qiskit simulations show that the implementation is successful at finding the marked vertex even for low-dimensional hypercubes.

9 pages, 12 figures

References in corpus (14)

• Universal computation by quantum walk
• Spatial search by quantum walk
• Universal computation by multi-particle quantum walk
• Generalized quantum-classical correspondence for random walks on graphs
• Quantum walk-based search algorithms with multiple marked vertices
• Quantum spatial search in two-dimensional waveguide arrays
• Efficient quantum circuits for continuous-time quantum walks on composite graphs
• Continuous-time quantum walk spatial search on the Bollobás scale-free network
• Efficient implementation of discrete-time quantum walks on quantum computers
• Quantum search with a continuous-time quantum walk in momentum space
• Circuit Implementation of Discrete-Time Quantum Walks via the Shunt Decomposition Method
• Spatial search by continuous-time quantum walks on renormalized Internet networks
• Walking on Vertices and Edges by Continuous-Time Quantum Walk
• Multimarked Spatial Search by Continuous-Time Quantum Walk