In this paper, we show that one-qubit polynomial time computations are as powerful as NC1 circuits. More generally, we define syntactic models for quantum and stochastic branching programs of bounded width and prove upper ...