Kazan (Volga region) Federal University, KFU
KAZAN
FEDERAL UNIVERSITY
 
LOWER BOUNDS AND HIERARCHIES FOR QUANTUM MEMORYLESS COMMUNICATION PROTOCOLS AND QUANTUM ORDERED BINARY DECISION DIAGRAMS WITH REPEATED TEST
Form of presentationArticles in international journals and collections
Year of publication2018
Языканглийский
  • Ablaev Farid Mansurovich, author
  • Khadiev Kamil Ravilevich, author
  • Khadieva Aliya Ikhsanovna, author
  • Bibliographic description in the original language Ablayev F, Ambainis A, Khadiev K, Khadieva A, Lower bounds and hierarchies for quantum memoryless communication protocols and quantum ordered binary decision diagrams with repeated test//Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). - 2018. - Vol.10706 LNCS, Is.. - P.197-211.
    Keywords quantum computation, communication complexity, Branching programs, Binary decision diagrams, OBDD, quantum models, hierarchy, computational complexity
    The name of the journal Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    URL https://www.scopus.com/inward/record.uri?eid=2-s2.0-85041826422&doi=10.1007%2f978-3-319-73117-9_14&partnerID=40&md5=afd4daef9b9c99fd7ce49a35accc61b6
    Please use this ID to quote from or refer to the card https://repository.kpfu.ru/eng/?p_id=176477&p_lang=2

    Full metadata record