A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Nested Quantum Walks with Quantum Data Structures
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms
We develop a new framework that extends the quantum walk framework of Magniez, Nayak, Roland, and Santha, by utilizing the idea of quantum data structures to construct an efficient method of nesting quantum walks. Surprisingly, only classical data structures were considered before for searching via quantum walks. The recently proposed learning graph framework of Belovs has yielded improved upper bounds for several problems, including triangle finding and more general subgraph detection. Wedoi:10.1137/1.9781611973105.106 dblp:conf/soda/JefferyKM13 fatcat:3lhu2elwmbhspkcszgicjgxzmi