Kazan Federal University Digital Repository

Lower bounds and hierarchies for quantum memoryless communication protocols and quantum ordered binary decision diagrams with repeated test

Show simple item record

dc.date.accessioned 2019-01-22T20:36:45Z
dc.date.available 2019-01-22T20:36:45Z
dc.date.issued 2018
dc.identifier.issn 0302-9743
dc.identifier.uri https://dspace.kpfu.ru/xmlui/handle/net/147960
dc.description.abstract © 2018, Springer International Publishing AG. 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 opposite player. The model is interesting because this allows us to get lower bounds for models like automata, Ordered Binary Decision Diagrams and streaming algorithms. At the same time, we can prove stronger results with this restriction. We present a lower bound for quantum memoryless protocols. Additionally, we show a lower bound for Disjointness function for this model. As an application of communication complexity results, we consider Quantum Ordered Read-k-times Branching Programs (k-QOBDD). Our communication complexity result allows us to get lower bound for k-QOBDD and to prove hierarchies for sublinear width bounded error k-QOBDDs, where k=o(n). Furthermore, we prove a hierarchy for polynomial size bounded error k-QOBDDs for constant k. This result differs from the situation with an unbounded error where it is known that an increase of k does not give any advantage.
dc.relation.ispartofseries Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.subject Binary decision diagrams
dc.subject Branching programs
dc.subject Communication complexity
dc.subject Computational complexity
dc.subject Hierarchy
dc.subject OBDD
dc.subject Quantum computation
dc.subject Quantum models
dc.title Lower bounds and hierarchies for quantum memoryless communication protocols and quantum ordered binary decision diagrams with repeated test
dc.type Conference Paper
dc.relation.ispartofseries-volume 10706 LNCS
dc.collection Публикации сотрудников КФУ
dc.relation.startpage 197
dc.source.id SCOPUS03029743-2018-10706-SID85041826422


Files in this item

This item appears in the following Collection(s)

  • Публикации сотрудников КФУ Scopus [24551]
    Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.

Show simple item record

Search DSpace


Advanced Search

Browse

My Account

Statistics