Is the Measurement Based Quantum Computing Search Algorithm Really Grover's Algorithm?
Abstract
We question whether the measurement based quantum computing algorithm is in fact Grover's algorithm or simply a similar oracular search method. The two algorithms share several qualitative features especially in the case of the trivial 4 element search, which is the largest size photonic search algorithm that has been experimentally implemented to date. This has led some to refer to both substantiations as Grover's algorithm. We compare multiple features of the two algorithms including the behavior of the oracle tags and the entanglement dynamics, both qualitatively and quantitatively. We find significant and fundamental differences in the operation of the two algorithms, particularly in cases involving searches on more than four elements.
Cite
@article{arxiv.1211.3407,
title = {Is the Measurement Based Quantum Computing Search Algorithm Really Grover's Algorithm?},
author = {A. Matthew Smith and P. M. Alsing and J. R. McDonald and D. B. Uskov},
journal= {arXiv preprint arXiv:1211.3407},
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