Rodolphe Griset1,#,*, Ioannis Lavdas2,§, Jiří Guth Jarkovský3
Journal of Quantum Computing, Vol.7, pp. 81-105, 2025, DOI:10.32604/jqc.2025.066064
- 08 December 2025
Abstract Quantum search has emerged as one of the most promising fields in quantum computing. State-of-the-art quantum search algorithms enable the search for specific elements in a distribution by monotonically increasing the density of these elements relative to the rest of the distribution. These kinds of algorithms demonstrate a theoretical quadratic speed-up on the number of queries compared to classical search algorithms in unstructured spaces. Unfortunately, the major part of the existing literature applies quantum search to problems whose size grows exponentially with the input size without exploiting any specific problem structure, rendering this kind of… More >
Login
Register
