2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/90844In this paper we study a model of a Quantum Branching Program (QBP) and investigate its computational power. We prove a general lower bound on the width of read-once QBPs, which we show to be almost tight on certain symmetric function.Quantum PhysicsOn Computational Power of Quantum Branching Programstext