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

arXiv:1509.08852 · Quantum Information Processing

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

Renato Portugal

Published Jan 12, 2016• 38 citations
arXivHTMLPDF
DOI
10.1007/s11128-015-1230-7

Related papers

Equivalence of Szegedy’s and coined quantum walks

Thomas G. Wong

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

Direct Equivalence of Coined and Szegedy's Quantum Walks

Thomas G. Wong

•Nov 7, 2016•0 citations

Exact simulation of coined quantum walks with the continuous-time model

Pascal Philipp, Renato Portugal

Quantum Information Processing•Dec 16, 2016•18 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•9 citations

Staggered quantum walks on graphs

Renato Portugal

The staggered quantum-walk model makes it possible to establish an unprecedented connection between discrete-time quantum walks and graph theory. We call attention to the fact that a large subclass of the coined model is included in Szegedy's model, which in its turn is entirely included in the staggered model. In order to compare those three quantum-walk models, we put them in the staggered formalism and show that the Szegedy and coined models are defined on a special subclass of graphs. This inclusion scheme is also true when the searching framework is added. We use graph theory to characterize which staggered quantum walks can be reduced to the Szegedy or coined quantum-walk model. We analyze a staggered-based search that cannot be included in Szegedy's model and show numerically that this search is more efficient than a random-walk-based search.

arXiv:1603.02210•Physical Review A•Jun 27, 2016•44 citations

An analysis of quantum walks

Sanjeev Naguleswaran, Ian Fuss, Lang White

•Jan 1, 2007•1 citation
The staggered quantum-walk model makes it possible to establish an unprecedented connection between discrete-time quantum walks and graph theory. We call attention to the fact that a large subclass of the coined model is included in Szegedy's model, which in its turn is entirely included in the staggered model. In order to compare those three quantum-walk models, we put them in the staggered formalism and show that the Szegedy and coined models are defined on a special subclass of graphs. This inclusion scheme is also true when the searching framework is added. We use graph theory to characterize which staggered quantum walks can be reduced to the Szegedy or coined quantum-walk model. We analyze a staggered-based search that cannot be included in Szegedy's model and show numerically that this search is more efficient than a random-walk-based search.