Log In Sign Up

Multidimensional Quantum Walks, with Application to k-Distinctness

by   Stacey Jeffery, et al.

While the quantum query complexity of k-distinctness is known to be O(n^3/4-1/4(2^k-1)) for any constant k ≥ 4, the best previous upper bound on the time complexity was O(n^1-1/k). We give a new upper bound of O(n^3/4-1/4(2^k-1)) on the time complexity, matching the query complexity up to polylogarithmic factors. In order to achieve this upper bound, we give a new technique for designing quantum walk search algorithms, which is an extension of the electric network framework. We also show how to solve the welded trees problem in O(n) queries and O(n^2) time using this new technique, showing that the new quantum walk framework can achieve exponential speedups.


page 1

page 2

page 3

page 4


Quantum Query Complexity of Dyck Languages with Bounded Height

We consider the problem of determining if a sequence of parentheses is w...

On the extension complexity of polytopes separating subsets of the Boolean cube

We show that 1. for every A⊆{0, 1}^n, there exists a polytope P⊆ℝ^n wi...

Quantum Subroutine Composition

An important tool in algorithm design is the ability to build algorithms...

A Unified Framework of Quantum Walk Search

The main results on quantum walk search are scattered over different, in...

Best Arm Identification for Cascading Bandits in the Fixed Confidence Setting

We design and analyze CascadeBAI, an algorithm for finding the best set ...

On The Complexity of Sparse Label Propagation

This paper investigates the computational complexity of sparse label pro...

How fast do quantum walks mix?

The fundamental problem of sampling from the limiting distribution of qu...