Another classical analog of Grover's quantum search
classification
🪐 quant-ph
keywords
quantumalgorithmanalogclassicalgroversearchableacting
read the original abstract
In this work I describe a classical analog of Grover's quantum searching algorithm, explaining why a quantum algorithm should be able to perform search in O(sqrtN) steps and also acting as a useful pedagogic demonstration.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.