Szegedy’s Quantum Walk

Part of the Quantum Science and Technology book series (QST)


In this chapter, we describe Szegedy’s model, which is a collection of discrete-time coinless quantum walks on symmetric bipartite digraphs. A symmetric bipartite digraph can be obtained from an underlying digraph by a duplication process. The underlying digraph defines a classical Markov chain , and Szegedy’s model is usually said to be the quantized version of this Markov chain.


Quantum Walk Szegedy Classical Markov Chain Bipartite Digraph Marked Vertices 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.National Laboratory of Scientific Computing (LNCC)PetrópolisBrazil

Personalised recommendations