Optimal exact quantum algorithm for the promised element distinctness problem

TL;DR

This paper presents an optimal, exact quantum algorithm for the promised element distinctness problem, improving upon probabilistic methods by ensuring zero error with the same query complexity.

Contribution

It introduces a novel exact quantum algorithm for the promise version of element distinctness, utilizing modified quantum walk operators and the FXR method for guaranteed success.

Findings

Achieves $O(N^{2/3})$ query complexity with zero error.

Proves the optimality of the algorithm.

Extends quantum walk search techniques with phase modifications.

Abstract

The element distinctness problem is to determine whether a string $x=(x_1,\ldots,x_N)$ of $N$ elements contains two elements of the same value (a.k.a colliding pair), for which Ambainis proposed an optimal quantum algorithm. The idea behind Ambainis' algorithm is to first reduce the problem to the promised version in which $x$ is promised to contain at most one colliding pair, and then design an algorithm $\mathcal{A}$ requiring $O(N^{2/3})$ queries based on quantum walk search for the promise problem. However, $\mathcal{A}$ is probabilistic and may fail to give the right answer. We thus, in this work, design an exact quantum algorithm for the promise problem which never errs and requires $O(N^{2/3})$ queries. This algorithm is proved optimal. Technically, we modify the quantum walk search operator on quasi-Johnson graph to have arbitrary phases, and then use Jordan's lemma as the analyzing tool to reduce the quantum walk search operator to the generalized Grover's operator. This allows us to utilize the recently proposed fixed-axis-rotation (FXR) method for exact quantum search, and hence achieve 100\% success.