The Measurement Based Quantum Computing Search Algorithm is Faster than Grover's Algorithm
Quantum Physics
2013-03-19 v3 Computational Physics
Optics
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).
Keywords
Cite
@article{arxiv.1211.3405,
title = {The Measurement Based Quantum Computing Search Algorithm is Faster than Grover's Algorithm},
author = {A. Matthew Smith and P. M. Alsing},
journal= {arXiv preprint arXiv:1211.3405},
year = {2013}
}
Comments
Currently being rewritten due to measurement angles being in the clifford group and thus can be efficiently simulated by the Gottsman-Knill theorem