paper

The Measurement Based Quantum Computing Search Algorithm is Faster than Grover's Algorithm

arXiv:1211.3405

Abstract

We find that the Measurement Based Quantum Computing (MBQC) search algorithm on an unsorted list is not the same as Grover's search algorithm (GSA).

Currently being rewritten due to measurement angles being in the clifford group and thus can be efficiently simulated by the Gottsman-Knill theorem

The Measurement Based Quantum Computing Search Algorithm is Faster than Grover's Algorithm · wovepaper