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

- RUS
- 中文
- ES

LOWER BOUNDS AND HIERARCHIES FOR QUANTUM MEMORYLESS COMMUNICATION PROTOCOLS AND QUANTUM ORDERED BINARY DECISION DIAGRAMS WITH REPEATED TEST

Form of presentation

Articles in international journals and collections

Year of publication

2018

��

��

Authors, employees of KFU

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

Field DC	Value	Language
dc.contributor.author	Ablaev Farid Mansurovich	ru_RU
dc.contributor.author	Khadiev Kamil Ravilevich	ru_RU
dc.contributor.author	Khadieva Aliya Ikhsanovna	ru_RU
dc.date.accessioned	2018-01-01T00:00:00Z	ru_RU
dc.date.available	2018-01-01T00:00:00Z	ru_RU
dc.date.issued	2018	ru_RU
dc.identifier.citation	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.	ru_RU
dc.identifier.uri	https://repository.kpfu.ru/eng/?p_id=176477&p_lang=2	ru_RU
dc.description.abstract	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	ru_RU
dc.language.iso	ru	ru_RU
dc.subject	quantum computation	ru_RU
dc.subject	communication complexity	ru_RU
dc.subject	Branching programs	ru_RU
dc.subject	Binary decision diagrams	ru_RU
dc.subject	OBDD	ru_RU
dc.subject	quantum models	ru_RU
dc.subject	hierarchy	ru_RU
dc.subject	computational complexity	ru_RU
dc.title	Lower bounds and hierarchies for quantum memoryless communication protocols and quantum ordered binary decision diagrams with repeated test	ru_RU
dc.type	Articles in international journals and collections	ru_RU