Noise tolerance via reinforcement in the quantum search problem
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866910105158549504 |
|---|---|
| author | Homayouni-Sangari, Marjan Ramezanpour, Abolfazl |
| author_facet | Homayouni-Sangari, Marjan Ramezanpour, Abolfazl |
| contents | We find that reinforcement exponentially reduces computation time of the quantum search problem from $\sqrt{D}$ to $\ln D$ in a $D$-dimensional system. Therefor, a reinforced quantum search is expected to exhibit an exponentially larger noise threshold compared to a standard search algorithm in a noisy environment. We use numerical simulations to characterize the level of noise tolerance via reinforcement in the presence of both coherent and incoherent noise, considering a system of $N$ qubits and a single $D$-level (qudit) system. Our results show that reinforcement significantly enhances the algorithm's success probability and improves the scaling of its computation time with system size. These findings indicate that reinforcement offers a promising strategy for error mitigation, especially when a precise noise model is unavailable. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_04137 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Noise tolerance via reinforcement in the quantum search problem Homayouni-Sangari, Marjan Ramezanpour, Abolfazl Quantum Physics Disordered Systems and Neural Networks Data Structures and Algorithms We find that reinforcement exponentially reduces computation time of the quantum search problem from $\sqrt{D}$ to $\ln D$ in a $D$-dimensional system. Therefor, a reinforced quantum search is expected to exhibit an exponentially larger noise threshold compared to a standard search algorithm in a noisy environment. We use numerical simulations to characterize the level of noise tolerance via reinforcement in the presence of both coherent and incoherent noise, considering a system of $N$ qubits and a single $D$-level (qudit) system. Our results show that reinforcement significantly enhances the algorithm's success probability and improves the scaling of its computation time with system size. These findings indicate that reinforcement offers a promising strategy for error mitigation, especially when a precise noise model is unavailable. |
| title | Noise tolerance via reinforcement in the quantum search problem |
| topic | Quantum Physics Disordered Systems and Neural Networks Data Structures and Algorithms |
| url | https://arxiv.org/abs/2604.04137 |