Ordered Quantum Branching Programs Are More Powerful than Ordered Probabilistic Branching Programs under a Bounded-Width Restriction.

Masaki Nakanishi Kiyoharu Hamaguchi Toshinobu Kashiwabara Ordered Quantum Branching Programs Are More Powerful than Ordered Probabilistic Branching Programs under a Bounded-Width Restriction. 467-476 2000 conf/cocoon/2000 COCOON http://link.springer.de/link/service/series/0558/bibs/1858/18580467.htm db/conf/cocoon/cocoon2000.html#NakanishiHK00