Lecture notes in computer science

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

Masaki Nakanishi, Kiyoharu Hamaguchi, Toshinobu Kashiwabara

Published Jan 1, 2000• 35 citations

Related papers

Quantum and Stochastic Branching Programs of Bounded Width

Farid Mansurovich Ablayev, Cristopher Moore, Christopher John Pollett

On the computational power of probabilistic and quantum branching program

Farid Mansurovich Ablayev, Aida Gainutdinova, Marek Karpiński +2 more

Quantum and stochastic branching programs of bounded width: (Track A)

Farid Mansurovich Ablayev, Cristopher Moore, Christopher John Pollett

Lower Bound and Hierarchies for Quantum Ordered Read-K-Times Branching Programs

Kamil Ravilevich Khadiev, Farid Mansurovich Ablayev, Aliya Khadieva +1 more

On Computational Power of Quantum Branching Programs

Farid Mansurovich Ablayev, Aida Gainutdinova, Marek Karpiński

Quantum branching programs and space-bounded nonuniform quantum complexity

Martin Sauerhoff, Detlef Sieling