Lower Bounds and Hierarchies for Quantum Memoryless Communication Protocols and Quantum Ordered Binary Decision Diagrams with Repeated Test

We explore multi-round quantum memoryless communication protocols. These are restricted version of multi-round quantum communication protocols. The ``memoryless'' term means that players forget history from previous rounds, and their behavior is obtained only by input and message from the op

Lower Bounds and Hierarchies for Quantum Memoryless Communication Protocols and Quantum Ordered Binary Decision Diagrams with Repeated Test Farid Ablayev, Andris Ambainis, Kamil Khadiev, Aliya Khadieva

On the Hierarchies for Deterministic, Nondeterministic and Probabilistic Ordered Read-k-times Branching Programs

The paper examines hierarchies for nondeterministic and deterministic ordered read-k-times Branching programs. The currently known hierarchies for deterministic k-OBDD models of Branching programs for k=o(n^{1/2}/\log^{3/2}n) are proved by B. Bollig, M. Sauerhoff, D. Sieling, and I. Wegener in 1998.