Efficient Circuit Implementations of Continuous-Time Quantum Walks for Quantum Search

Quantum walks are a powerful framework for simulating complex quantum systems and designing quantum algorithms, particularly for spatial search on graphs, where the goal is to find a marked vertex efficiently. In this work, we present efficient quantum circuits that implement the evolution operator...

Full description

Bibliographic Details

Published in:	Entropy
Main Authors:	Renato Portugal, Jalil Khatibi Moqadam
Format:	Article
Language:	English
Published:	MDPI AG 2025-04-01
Subjects:	quantum computer quantum walk spatial search algorithm complete graph bipartite graph hypercube
Online Access:	https://www.mdpi.com/1099-4300/27/5/454