We develop quantum fingerprinting technique for constructing quantum
branching programs (QBPs), which are considered as circuits with an
ability to use classical bits as control variables.

We demonstrate our approach constructing optimal quantum ordered
binary decision diagram (QOBDD) for $MOD_m$ and $DMULT_n$ Boolean
functions. The construction of our technique also allows to extend
the recent result of Ambainis and Nahimovs it is based on. In
addition we show how our technique works for encoding quantum
information for the equality problem in the simultaneous message
passing model.

Removed the erroneous algorithm fo DMULT function.

We develop quantum fingerprinting technique for constructing quantum
branching programs (QBPs), which are considered as circuits with an
ability to use classical bits as control variables.

We demonstrate our approach constructing optimal quantum ordered
binary decision diagram (QOBDD) for $MOD_m$ and $DMULT_n$ Boolean
functions. The construction of our technique also allows to extend
the recent result of Ambainis and Nahimovs it is based on. In
addition we show how our technique works for encoding quantum
information for the equality problem in the simultaneous message
passing model.