KFU. Card publication. Width Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams with Repeated Test

KAZAN
FEDERAL UNIVERSITY

- RUS
- 中文
- ES

WIDTH HIERARCHIES FOR QUANTUM AND CLASSICAL ORDERED BINARY DECISION DIAGRAMS WITH REPEATED TEST

Form of presentation

Articles in international journals and collections

Year of publication

2017

��

��

Authors, employees of KFU

Ibragimov Rishat Narimanovich, author

Khadiev Kamil Ravilevich, author

Authors, postgraduates KFU

Ibragimov Rishat Narimanovich, postgraduate kfu

Bibliographic description in the original language

Khadiev K. Width Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams with Repeated Test / Khadiev K., Ibrahimov R.//Proceedings of the Fourth Russian Finnish Symposium on Discrete Mathematics, TUCS Lecture Notes. - 2017. - N. 26. - P. 98-108

Annotation

Turku Centre for Computer Science Lecture Note

Keywords

quantum computing, quantum OBDD, OBDD, Branching programs, quantum vs classical, quantum models, hierarchy, computational complexity, probabilistic OBDD, nondeterministic OBDD

The name of the journal

Turku Centre for Computer Science Lecture Note

URL

http://tucs.fi/publications/view/?pub_id=pKaSa17a

Please use this ID to quote from or refer to the card

https://repository.kpfu.ru/eng/?p_id=157538&p_lang=2

Full metadata record

Field DC	Value	Language
dc.contributor.author	Ibragimov Rishat Narimanovich	ru_RU
dc.contributor.author	Khadiev Kamil Ravilevich	ru_RU
dc.contributor.author	Ibragimov Rishat Narimanovich	ru_RU
dc.date.accessioned	2017-01-01T00:00:00Z	ru_RU
dc.date.available	2017-01-01T00:00:00Z	ru_RU
dc.date.issued	2017	ru_RU
dc.identifier.citation	Khadiev K. Width Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams with Repeated Test / Khadiev K., Ibrahimov R.//Proceedings of the Fourth Russian Finnish Symposium on Discrete Mathematics, TUCS Lecture Notes. - 2017. - N. 26. - P. 98-108	ru_RU
dc.identifier.uri	https://repository.kpfu.ru/eng/?p_id=157538&p_lang=2	ru_RU
dc.description.abstract	Turku Centre for Computer Science Lecture Note	ru_RU
dc.description.abstract	We consider quantum, nondterministic and probabilistic versions of known computational model Ordered Read-k-times Branching Programs or Ordered Binary Decision Diagrams with repeated test (k-QOBDD, k-NOBDD and k-POBDD). We show width hierarchy for complexity classes of Boolean function computed by these models and discuss relation between different variants of k-OBDD.	ru_RU
dc.language.iso	ru	ru_RU
dc.subject	quantum computing	ru_RU
dc.subject	quantum OBDD	ru_RU
dc.subject	OBDD	ru_RU
dc.subject	Branching programs	ru_RU
dc.subject	quantum vs classical	ru_RU
dc.subject	quantum models	ru_RU
dc.subject	hierarchy	ru_RU
dc.subject	computational complexity	ru_RU
dc.subject	probabilistic OBDD	ru_RU
dc.subject	nondeterministic OBDD	ru_RU
dc.title	Width Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams with Repeated Test	ru_RU
dc.type	Articles in international journals and collections	ru_RU