A simple, explicit boolean function on 2n input bits is presented that is

computable by errorfree quantum read-once branching programs of size

O(n^3), while each classical randomized read-once branching program

and each quantum OBDD for this function with bounded two-sided error

requires size 2^{omega(n)}.