Year: 2013
Type: preprint
Abstract: This paper explores Quantum Search on the two dimensional spatial grid. Recent exploration into the topic has devised a solution that runs in O(sqrt(n*ln(n))). This paper explores a new algorithm that gives promise for the O(sqrt(n)) result that is the lower bound off of the grid.
Source: arXiv (Cornell University)
Author: Falk, Matthew
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2306862440
