1211.3405 (A. Matthew Smith et al.)

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

A. Matthew Smith, P. M. Alsing

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). More importantly, the MBQC search algorithm is exponentially faster than both GSA and its classical counterpart. We develop and describe the numerical formalism we utilize that confirms the MBQC exponential speedup over the GSA and classical search algorithms.

View original: http://arxiv.org/abs/1211.3405