2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/91935We will show that if there exists a quantum query algorithm that exactly computes some total Boolean function f by making T queries, then there is a classical deterministic algorithm A that exactly computes f making O(T^3) queries. The best know bound previously was O(T^4) due to Beals et al.5 pages, corrected grammar, some comments addedQuantum Physicstext