Now showing items 1-3 of 3

    • Efficient Composition of Discrete Time Quantum Walks 

      Lou, Xingliang (University of Waterloo, 2017-01-20)
      It is well known that certain search problems are efficiently solved by quantum walk algorithms. Of particular interest are those problems whose efficient solutions involve nesting of search algorithms. The nesting of ...
    • Quantum Snake Walk on Graphs 

      Rosmanis, Ansis (University of Waterloo, 2010-01-13)
      Quantum walks on graphs have been proven to be a useful tool in quantum algorithm construction for various problems. In this thesis we introduce a new type of continuous-time quantum walk on graphs called the quantum snake ...
    • Quantum Walks on Strongly Regular Graphs 

      Guo, Krystal (University of Waterloo, 2010-08-30)
      This thesis studies the transition matrix of a quantum walk on strongly regular graphs. It is proposed by Emms, Hancock, Severini and Wilson in 2006, that the spectrum of a matrix based on the amplitudes of walks in the ...

      UWSpace

      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages