2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/96544We propose the use of a quantum algorithm to deal with the problem of searching with errors in the framework of two-person games. Specifically, we present a solution to the Ulam's problem that polynomially reduces its query complexity and makes it independent from the dimension of the search space.4 pages, RevTeX file, revised versionQuantum Physicstext