9 citations · 40 across the 12 of their papers we have counts for
4 papers · 2 filters
Quantum versus Classical Online Streaming Algorithms with Logarithmic Size of Memory
Kamil Khadiev, Aliya Khadieva, Dmitry Kravchenko +3
We consider online algorithms with respect to the competitive ratio. Here, we investigate quantum and classical one-way automata with non-constant size of memory (streaming algorit…
Quantum Online Algorithms with Respect to Space Complexity
Kamil Khadiev, Aliya Khadieva, Ilnaz Mannapov
Online algorithm is a well-known computational model. We introduce quantum online algorithms and investigate them with respect to a competitive ratio in two points of view: space c…
Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams
Kamil Khadiev, Aliya Khadieva
We consider Quantum OBDD model. It is restricted version of read-once Quantum Branching Programs, with respect to "width" complexity. It is known that maximal complexity gap betwee…
Lower Bounds and Hierarchies for Quantum Memoryless Communication Protocols and Quantum Ordered Binary Decision Diagrams with Repeated Test
Farid Ablayev, Andris Ambainis, Kamil Khadiev +1
We explore multi-round quantum memoryless communication protocols. These are restricted version of multi-round quantum communication protocols. The "memoryless" term means that pla…