2000 character limit reached
Quantum Search on the Spatial Grid
Published 18 Mar 2013 in quant-ph | (1303.4127v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.