On Computational Power of Quantum Branching Programs
Farid Mansurovich Ablayev, Aida Gainutdinova, Marek Karpiński · arXiv (Cornell University) · 2003
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.