Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

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
Publisher
DOI
10.1007/3-540-44968-x_46

Related papers

Quantum and Stochastic Branching Programs of Bounded Width

Farid Mansurovich Ablayev, Cristopher Moore, Christopher John Pollett

arXiv:quant-ph/0201139•Lecture notes in computer science•Jan 1, 2002•13 citations

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

Farid Mansurovich Ablayev, Cristopher Moore, Christopher John Pollett

•Jan 1, 2002•1 citation

On the computational power of probabilistic and quantum branching program

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

Information and Computation•Sep 27, 2005•48 citations

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

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

•Jan 1, 2023•2 citations

On Computational Power of Quantum Branching Programs

Farid Mansurovich Ablayev, Aida Gainutdinova, Marek Karpiński

arXiv:quant-ph/0302022•Lecture notes in computer science•Jan 1, 2001•43 citations

Quantum branching programs and space-bounded nonuniform quantum complexity

Martin Sauerhoff, Detlef Sieling

arXiv:quant-ph/0403164•Theoretical Computer Science•Feb 8, 2005•43 citations