Published January 22, 2026
| Version v1
Technical note
Open
Self-Improving Quantum Search: Using Grover's Algorithm to Discover Superior Algorithms
Authors/Creators
Description
We propose a framework for algorithmic self-improvement based on quantum search. The core idea is to use Grover’s algorithm to search the space of quantum algorithms for one that outperforms Grover itself. The discovered algorithm then searches for an even better algorithm, and so on. We formalize this recursive improvement process and analyze the conditions under which it converges to optimal query complexity.
Files
Self_Improving_Quantum_Search__Using_Grover_s_Algorithm_to_Discover_Superior_Algorithms.pdf
Files
(253.2 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:2299be006acff51cbfdc74f4a60292d9
|
14.3 kB | Download |
|
md5:bcc06f39d6d696c59fa2db6ed87f89c7
|
238.9 kB | Preview Download |
Additional details
References
- L. K. Grover, "A fast quantum mechanical algorithm for database search," Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pp. 212–219, 1996.
- C. H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani, "Strengths and weaknesses of quantum computing," SIAM Journal on Computing, vol. 26, no. 5, pp. 1510–1523, 1997.
- L. A. Levin, "Universal sequential search problems," Problemy Peredachi Informatsii, vol. 9, no. 3, pp. 115–116, 1973.