Noise tolerance via reinforcement in the quantum search problem

Abstract:The Grover lower bound for the unstructured search problem can be surpassed when some information about the data structure is available. Here, we numerically observe that reinforcement can exponentially reduce the number of required evolution layers from $\sqrt{D}$ to $\ln D$ in a $D$-dimensional system, by exploiting the information provided by the quantum state. Therefore, a reinforced quantum search is expected to exhibit a 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 the number of reinforced evolution layers with system size. These findings indicate that reinforcement offers a promising strategy for error mitigation, especially when a precise noise model is unavailable.

Quantum Physics (quant-ph); Disordered Systems and Neural Networks (cond-mat.dis-nn); Data Structures and Algorithms (cs.DS)

arXiv:2604.04137 [quant-ph]

(or arXiv:2604.04137v2 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2604.04137 Focus to learn more arXiv-issued DOI via DataCite

Phys. Rev. A 114, 022423 (2026)

https://doi.org/10.1103/qt8h-6dyg Focus to learn more DOI(s) linking to related resources

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.