Volume 11 (2015) Article 16 pp. 403-412 [Note]

Quantum Algorithm for Monotonicity Testing on the Hypercube

by Aleksandrs Belovs and Eric Blais

Received: March 24, 2015
Revised: July 16, 2015
Published: December 29, 2015

In this note, we develop a bounded-error quantum algorithm that makes $\tilde{O}(n^{1/4}\varepsilon^{-1/2})$ queries to a function $f\colon \{0,1\}^n \to\{0,1\}$, accepts when $f$ is monotone, and rejects when $f$ is $\varepsilon$-far from being monotone. This result gives a super-quadratic improvement compared to the best known randomized algorithm for all $\varepsilon = o(1)$. The improvement is cubic when $\varepsilon = 1/\sqrt{n}$.

DOI: 10.4086/toc.2015.v011a016

© 2015 Aleksandrs Belovs and Eric Blais
Licensed under a Creative Commons Attribution License (CC-BY)