KFU. Card publication. Adjacent vertices can be hard to find by quantum walks

KAZAN
FEDERAL UNIVERSITY

- RUS
- 中文
- ES

ADJACENT VERTICES CAN BE HARD TO FIND BY QUANTUM WALKS

Form of presentation

Conference proceedings in Russian journals and collections

Year of publication

2018

Язык

английский

Authors, employees of KFU

Khadiev Kamil Ravilevich, author

Other authors

Nahimovs Nikolajs , author

Santos Raqueline A. M. , author

Bibliographic description in the original language

Nahimovs N. Adjacent vertices can be hard to find by quantum walks /N. Nahimovs, R. A. M. Santos, K. R. Khadiev // Diskretnye modeli v teorii upravlyayushhikh sistem: Kh Mezhdunarodnaya konferenciya, Moskva i Podmoskove, 23–25 maya 2018 g. : Trudy. – M.: MAKS Press, 2018. – s. 20-22

Annotation

Дискретные модели в теории управляющих систем: Х Международная конференция, Москва и Подмосковье, 23?25 мая 2018 г. : Труды.

Keywords

quantum computing, algorithms, quantum walks, graphs

The name of the journal

URL

http://mks2.cmc.msu.ru:8000/downloads/dm10_book.pdf

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

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

Full metadata record

Field DC	Value	Language
dc.contributor.author	Khadiev Kamil Ravilevich	ru_RU
dc.contributor.author	Nahimovs Nikolajs	ru_RU
dc.contributor.author	Santos Raqueline A. M.	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	Nahimovs N. Adjacent vertices can be hard to find by quantum walks /N. Nahimovs, R. A. M. Santos, K. R. Khadiev // Дискретные модели в теории управляющих систем: Х Международная конференция, Москва и Подмосковье, 23–25 мая 2018 г. : Труды. – М.: МАКС Пресс, 2018. – с. 20-22	ru_RU
dc.identifier.uri	https://repository.kpfu.ru/eng/?p_id=181470&p_lang=2	ru_RU
dc.description.abstract	Дискретные модели в теории управляющих систем: Х Международная конференция, Москва и Подмосковье, 23?25 мая 2018 г. : Труды.	ru_RU
dc.description.abstract	We study search by quantum walks on general graphs with multiple marked vertices. We show what quantum walks with Grover?s coin have a wide class of exceptional configurations ? i. e. the number and the placement ? of marked vertices, for which the probability of finding a marked vertex does not grow over time	ru_RU
dc.language.iso	ru	ru_RU
dc.subject	quantum computing	ru_RU
dc.subject	algorithms	ru_RU
dc.subject	quantum walks	ru_RU
dc.subject	graphs	ru_RU
dc.title	Adjacent vertices can be hard to find by quantum walks	ru_RU
dc.type	Conference proceedings in Russian journals and collections	ru_RU