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 application/pdf
.
Time-Efficient Quantum Walks for 3-Distinctness
[chapter]
2013
Lecture Notes in Computer Science
We present two quantum walk algorithms for 3-Distinctness. Both algorithms have time complexityÕ(n 5/7 ), improving the previous O(n 3/4 ) and matching the best known upper bound for query complexity (obtained via learning graphs) up to log factors. The first algorithm is based on a connection between quantum walks and electric networks. The second algorithm uses an extension of the quantum walk search framework that facilitates quantum walks with nested updates. Introduction Element
doi:10.1007/978-3-642-39206-1_10
fatcat:whevi2trfrbalgl4xayov3m2ei