Browsing Combinatorics and Optimization by Subject "quantum walk"
Now showing items 1-2 of 2
-
Efficient Composition of Discrete Time Quantum Walks
(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 Walks on Strongly Regular Graphs
(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 ...