A Time-Efficient Quantum Walk for 3-Distinctness Using Nested Updates

We present an extension to the quantum walk search framework that facilitates quantum walks with nested updates. We apply it to give a quantum walk algorithm for 3-Distinctness with query complexity ~O(n^{5/7}), matching the best known upper bound (obtained via learning graphs) up to log factors. Furthermore, our algorithm has time complexity ~O(n^{5/7}), improving the previous ~O(n^{3/4}).

[1]  Stacey Jeffery,et al.  Nested Quantum Walks with Quantum Data Structures , 2012, SODA.

[2]  Frédéric Magniez,et al.  Learning graph based quantum query algorithms for finding constant-size subgraphs , 2011, Chic. J. Theor. Comput. Sci..

[3]  Andrew M. Childs,et al.  Quantum Query Complexity of Minor-Closed Graph Properties , 2010, SIAM J. Comput..

[4]  Aleksandrs Belovs,et al.  Span programs for functions with constant-sized 1-certificates: extended abstract , 2011, STOC '12.

[5]  M. Szegedy,et al.  Quantum Walk Based Search Algorithms , 2008, TAMC.

[6]  M. Skala.  Hypergeometric tail inequalities: ending the insanity , 2013, 1311.5939.

[7]  Frédéric Magniez,et al.  Quantum algorithms for element distinctness , 2000, Proceedings 16th Annual IEEE Conference on Computational Complexity.

[8]  Frédéric Magniez,et al.  On the Hitting Times of Quantum Versus Random Walks , 2008, Algorithmica.

[9]  Aleksandrs Belovs,et al.  Learning-Graph-Based Quantum Algorithm for k-Distinctness , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[10]  Troy Lee,et al.  Quantum Query Complexity of State Conversion , 2010, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[11]  Ben Reichardt,et al.  Reflections for quantum query algorithms , 2010, SODA '11.

[12]  Frédéric Magniez,et al.  Improved quantum query algorithms for triangle finding and associativity testing , 2013, SODA.

[13]  Andris Ambainis,et al.  Quantum walk algorithm for element distinctness , 2003, 45th Annual IEEE Symposium on Foundations of Computer Science.

[14]  Scott Aaronson,et al.  Quantum lower bounds for the collision and the element distinctness problems , 2004, JACM.

[15]  Aleksandrs Belovs,et al.  Quantum Walks and Electric Networks , 2013, 1302.3143.

[16]  Larry Carter,et al.  New Hash Functions and Their Use in Authentication and Set Equality , 1981, J. Comput. Syst. Sci..