Structured search algorithm: A quantum leap
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915399831912448 |
|---|---|
| author | Prabhat, Yash Thakur, Snigdha Raina, Ankur |
| author_facet | Prabhat, Yash Thakur, Snigdha Raina, Ankur |
| contents | We introduce a structured quantum search algorithm that leverages entanglement maps and a fixed-point method to minimize oracle query complexity in unsorted datasets. By partitioning qubits into rows based on their entanglement order, the algorithm enables parallel subspace searches, achieving solution identification with at most two oracle calls per row. Experimental results on IBM Kyiv hardware demonstrate successful searches in datasets with up to 5 TB of unsorted data. Our findings indicate that with optimal encoding, the quantum search complexity becomes $\mathcal{O}(1)$, that is, independent of the dataset size $N$, surpassing both classical $\mathcal{O}(N)$ and Grover's $\mathcal{O}(\sqrt{N})$ scaling. Furthermore, the letter hypothesizes a scalable simulation of the said algorithm using classical means. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_03426 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Structured search algorithm: A quantum leap Prabhat, Yash Thakur, Snigdha Raina, Ankur Quantum Physics We introduce a structured quantum search algorithm that leverages entanglement maps and a fixed-point method to minimize oracle query complexity in unsorted datasets. By partitioning qubits into rows based on their entanglement order, the algorithm enables parallel subspace searches, achieving solution identification with at most two oracle calls per row. Experimental results on IBM Kyiv hardware demonstrate successful searches in datasets with up to 5 TB of unsorted data. Our findings indicate that with optimal encoding, the quantum search complexity becomes $\mathcal{O}(1)$, that is, independent of the dataset size $N$, surpassing both classical $\mathcal{O}(N)$ and Grover's $\mathcal{O}(\sqrt{N})$ scaling. Furthermore, the letter hypothesizes a scalable simulation of the said algorithm using classical means. |
| title | Structured search algorithm: A quantum leap |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2504.03426 |