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!
|
| _version_ | 1850179512386453504 |
|---|---|
| author | Romain Piron Muhammad Idham Habibie Claire Goursaud |
| author_facet | Romain Piron Muhammad Idham Habibie Claire Goursaud |
| author_sort | Romain Piron |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-f2334ea3fa8d48e9bf3d66ee7071d213 |
| institution | OA Journals |
| issn | 2689-1808 |
| language | English |
| publishDate | 2025-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Transactions on Quantum Engineering |
| spelling | doaj-art-f2334ea3fa8d48e9bf3d66ee7071d2132025-08-20T02:18:28ZengIEEEIEEE Transactions on Quantum Engineering2689-18082025-01-01611310.1109/TQE.2025.355556210944580Mixed Grover: A Hybrid Version to Improve Grover's Algorithm for Unstructured Database SearchRomain Piron0https://orcid.org/0009-0001-1984-9659Muhammad Idham Habibie1Claire Goursaud2https://orcid.org/0000-0003-0971-9305INSA Lyon, Inria, CITI EA 3720, Université de Lyon, Lyon, FranceINSA Lyon, Inria, CITI EA 3720, Université de Lyon, Lyon, FranceINSA Lyon, Inria, CITI EA 3720, Université de Lyon, Lyon, FranceIn 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.https://ieeexplore.ieee.org/document/10944580/Complexitygrover's algorithmhybrid quantum computingunstructured search |
| spellingShingle | Romain Piron Muhammad Idham Habibie Claire Goursaud Mixed Grover: A Hybrid Version to Improve Grover's Algorithm for Unstructured Database Search IEEE Transactions on Quantum Engineering Complexity grover's algorithm hybrid quantum computing unstructured search |
| title | Mixed Grover: A Hybrid Version to Improve Grover's Algorithm for Unstructured Database Search |
| title_full | Mixed Grover: A Hybrid Version to Improve Grover's Algorithm for Unstructured Database Search |
| title_fullStr | Mixed Grover: A Hybrid Version to Improve Grover's Algorithm for Unstructured Database Search |
| title_full_unstemmed | Mixed Grover: A Hybrid Version to Improve Grover's Algorithm for Unstructured Database Search |
| title_short | Mixed Grover: A Hybrid Version to Improve Grover's Algorithm for Unstructured Database Search |
| title_sort | mixed grover a hybrid version to improve grover x0027 s algorithm for unstructured database search |
| topic | Complexity grover's algorithm hybrid quantum computing unstructured search |
| url | https://ieeexplore.ieee.org/document/10944580/ |
| work_keys_str_mv | AT romainpiron mixedgroverahybridversiontoimprovegroverx0027salgorithmforunstructureddatabasesearch AT muhammadidhamhabibie mixedgroverahybridversiontoimprovegroverx0027salgorithmforunstructureddatabasesearch AT clairegoursaud mixedgroverahybridversiontoimprovegroverx0027salgorithmforunstructureddatabasesearch |