Equivalence of Szegedy’s and coined quantum walks

@article{Wong2017EquivalenceOS,
  title={Equivalence of Szegedy’s and coined quantum walks},
  author={Thomas G. Wong},
  journal={Quantum Information Processing},
  year={2017},
  volume={16},
  pages={1-15}
}
  • Thomas G. Wong
  • Published 2017
  • Physics, Computer Science, Mathematics
  • Quantum Information Processing
  • Szegedy’s quantum walk is a quantization of a classical random walk or Markov chain, where the walk occurs on the edges of the bipartite double cover of the original graph. To search, one can simply quantize a Markov chain with absorbing vertices. Recently, Santos proposed two alternative search algorithms that instead utilize the sign-flip oracle in Grover’s algorithm rather than absorbing vertices. In this paper, we show that these two algorithms are exactly equivalent to two algorithms… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    Coined quantum walks on weighted graphs
    9
    Exceptional quantum walk search on the cycle
    4
    Probability distributions for Markov chain based quantum walks
    6
    Discrete-time quantum walks and graph structures
    3
    Quantum Random Walks on Cayley Graphs
    Faster search by lackadaisical quantum walk
    10
    Quantum walks on embeddings
    1

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 43 REFERENCES
    Establishing the equivalence between Szegedy’s and coined quantum walks using the staggered model
    24
    Grover Search with Lackadaisical Quantum Walks
    40
    Szegedy’s quantum walk with queries
    6
    Connecting Coined Quantum Walks with Szegedy's Model
    8
    Exceptional quantum walk search on the cycle
    4
    Stationary States in Quantum Walk Search
    6
    Doubling the success of quantum walk search using internal-state measurements
    8
    Quantum walks: a comprehensive review
    457