Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Direct Equivalence of Coined and Szegedy's Quantum Walks

Thomas G. Wong

Published Nov 7, 2016• 0 citations
OpenAlex

Related papers

Equivalence of Szegedy’s and coined quantum walks

Thomas G. Wong

arXiv:1611.02238•Quantum Information Processing•Jul 24, 2017•30 citations

Establishing the equivalence between Szegedy’s and coined quantum walks using the staggered model

Renato Portugal

arXiv:1509.08852•Quantum Information Processing•Jan 12, 2016•39 citations

Szegedy Walk Unitaries for Quantum Maps

Paweł Wocjan, Kristan Temme

arXiv:2107.07365•Communications in Mathematical Physics•Jul 31, 2023•41 citations

Efficient quantum circuits for Szegedy quantum walks

T. Loke, Jingbo B. Wang

arXiv:1609.00173•Annals of Physics•Apr 28, 2017•35 citations

Connecting Coined Quantum Walks with Szegedy's Model

Renato Portugal, Etsuo Segawa

We analyze the equivalence between discrete-time coined quantum walks and Szegedy's quantum walks. We characterize a class of flip-flop coined models with generalized Grover coin on a graph Γ that can be directly converted into Szegedy's model on the subdivision graph of Γ and we describe a method to convert one model into the other. This method improves previous results in literature that need to use the staggered model and the concept of line graph, which are avoided here.

arXiv:1612.02448•Interdisciplinary Information Sciences•Jan 1, 2017•13 citations

The spectra of the unitary marix of a 2-tessellable staggered quantum walk on a graph

Norio Konno, Iwao Sato, Etsuo Segawa

Recently, the staggered quantum walk (SQW) on a graph is discussed as a generalization of coined quantum walks on graphs and Szegedy walks. We present a formula for the time evolution matrix of a 2-tessellable SQW on a graph, and so directly give its spectra. Furthermore, we present a formula for the Szegedy matrix of a bipartite graph by the same method, and so give its spectra. As an application, we present a formula for the characteristic polynomial of the modified Szegedy matrix in the quantum search problem on a graph, and give its spectra.

arXiv:1701.08274•Jan 28, 2017•1 citation
Recently, the staggered quantum walk (SQW) on a graph is discussed as a generalization of coined quantum walks on graphs and Szegedy walks. We present a formula for the time evolution matrix of a 2-tessellable SQW on a graph, and so directly give its spectra. Furthermore, we present a formula for the Szegedy matrix of a bipartite graph by the same method, and so give its spectra. As an application, we present a formula for the characteristic polynomial of the modified Szegedy matrix in the quantum search problem on a graph, and give its spectra.