The Measurement Based Quantum Computing Search Algorithm is Faster than Grover's Algorithm
A. Matthew Smith, P. M. Alsing
TL;DR
This paper demonstrates that the Measurement Based Quantum Computing search algorithm operates differently and more efficiently than Grover's algorithm when searching unsorted lists.
Contribution
It reveals that MBQC search algorithm is distinct from and faster than Grover's algorithm for unsorted list searches.
Findings
MBQC search algorithm differs from Grover's algorithm.
MBQC algorithm is faster for unsorted list searches.
The paper clarifies the relationship between MBQC and GSA.
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).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture