KFU. Card publication. Complexity of computing functions by quantum branching programs

KAZAN
FEDERAL UNIVERSITY

- RUS
- 中文
- ES

COMPLEXITY OF COMPUTING FUNCTIONS BY QUANTUM BRANCHING PROGRAMS

Form of presentation

Articles in international journals and collections

Year of publication

2005

Язык

английский

Authors, employees of KFU

Ablaev Farid Mansurovich, author

Khasyanov Ayrat Faridovich, author

Other authors

Karpinski Marek , author

Bibliographic description in the original language

Complexity of computing functions by quantum branching programs / Airat Khasianov, Marek Karpinski, Farid Ablayev // University of Bonn, 85285-CS, 2005

Annotation

University of Bonn, 85285-CS

Keywords

Computer Science, Quantum Computing, Quantum Branching Programs, Complexity Theory

The name of the journal

University of Bonn, 85285-CS

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

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

Full metadata record

Field DC	Value	Language
dc.contributor.author	Ablaev Farid Mansurovich	ru_RU
dc.contributor.author	Khasyanov Ayrat Faridovich	ru_RU
dc.contributor.author	Karpinski Marek	ru_RU
dc.date.accessioned	2005-01-01T00:00:00Z	ru_RU
dc.date.available	2005-01-01T00:00:00Z	ru_RU
dc.date.issued	2005	ru_RU
dc.identifier.citation	Complexity of computing functions by quantum branching programs / Airat Khasianov, Marek Karpinski, Farid Ablayev // University of Bonn, 85285-CS, 2005	ru_RU
dc.identifier.uri	https://repository.kpfu.ru/eng/?p_id=154868&p_lang=2	ru_RU
dc.description.abstract	University of Bonn, 85285-CS	ru_RU
dc.language.iso	ru	ru_RU
dc.subject	Computer Science	ru_RU
dc.subject	Quantum Computing	ru_RU
dc.subject	Quantum Branching Programs	ru_RU
dc.subject	Complexity Theory	ru_RU
dc.title	Complexity of computing functions by quantum branching programs	ru_RU
dc.type	Articles in international journals and collections	ru_RU