Efficient Composition of Discrete Time Quantum Walks
MetadataShow full item record
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 search algorithms generally incurs an extra logarithmic factor in query and time complexity, due to the use of majority voting as an error reduction technique. We study whether composition of search algorithms can be achieved without the said logarithmic factor in complexity. Two methods of composition have been proposed in this thesis. The first is a slight simplification of the quantum walk algorithm due to Magniez, Nayak, Roland, and Santha. The second is a method for composition of Markov chains. Neither approach appear to be generally applicable to all cases of quantum walk composition. Further work is required to determine the circumstances under which these approaches provide the logarithmic factor of increase in efficiency that we desire.
Cite this version of the work
Xingliang Lou (2017). Efficient Composition of Discrete Time Quantum Walks. UWSpace. http://hdl.handle.net/10012/11231