On Computational Power of Quantum Branching Programs
Farid Ablayev, Aida Gainutdinova and Marek Karpinski
In 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.