Mixed Grover: A Hybrid Version to Improve Grover's Algorithm for Unstructured Database Search
In this article, we propose a new strategy to exploit Grover's algorithm for unstructured search problems. We first show that running Grover's routine with a reduced number of iterations but allowing several trials presents a complexity advantage while keeping the same success...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2025-01-01
|
| Series: | IEEE Transactions on Quantum Engineering |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10944580/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In this article, we propose a new strategy to exploit Grover's algorithm for unstructured search problems. We first show that running Grover's routine with a reduced number of iterations but allowing several trials presents a complexity advantage while keeping the same success probability. Then, by a theoretical analysis of the performance, we provide a generic procedure to parameterize the number of iterations <inline-formula><tex-math notation="LaTeX">$k$</tex-math></inline-formula> within one shot of Grover's algorithm and the maximum number of trials <inline-formula><tex-math notation="LaTeX">$T$</tex-math></inline-formula>, given a targeted success <inline-formula><tex-math notation="LaTeX">$p$</tex-math></inline-formula> and the size of the database <inline-formula><tex-math notation="LaTeX">$N$</tex-math></inline-formula>. At the end, we highlight that this new approach permits to reduce the computational time by at least 10% for <inline-formula><tex-math notation="LaTeX">$p \geq 0.999$</tex-math></inline-formula> independently of the size of the database. |
|---|---|
| ISSN: | 2689-1808 |