KFU. Card publication. Upperbounds on the probability of finding marked connected components using quantum walks

KAZAN
FEDERAL UNIVERSITY

- RUS
- 中文
- ES

UPPERBOUNDS ON THE PROBABILITY OF FINDING MARKED CONNECTED COMPONENTS USING QUANTUM WALKS

Form of presentation

Articles in international journals and collections

Year of publication

2021

��

��

Authors, employees of KFU

Khadiev Kamil Ravilevich, author

Bibliographic description in the original language

Glos A, Nahimovs N, Balakirev K, Khadiev K., Upperbounds on the probability of finding marked connected components using quantum walks//Quantum Information Processing. - 2021. - Vol.20, Is.1. - Art. � 6.

Keywords

�� , �� , ��

The name of the journal

Quantum Information Processing

URL

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85098787024&doi=10.1007%2fs11128-020-02939-4&partnerID=40&md5=3e4a90ca7f2c82bbe8d7d7a16a8dac02

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

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

Full metadata record

Field DC	Value	Language
dc.contributor.author	Khadiev Kamil Ravilevich	ru_RU
dc.date.accessioned	2021-01-01T00:00:00Z	ru_RU
dc.date.available	2021-01-01T00:00:00Z	ru_RU
dc.date.issued	2021	ru_RU
dc.identifier.citation	Glos A, Nahimovs N, Balakirev K, Khadiev K., Upperbounds on the probability of finding marked connected components using quantum walks//Quantum Information Processing. - 2021. - Vol.20, Is.1. - Art. � 6.	ru_RU
dc.identifier.uri	https://repository.kpfu.ru/eng/?p_id=247268&p_lang=2	ru_RU
dc.description.abstract	Quantum Information Processing	ru_RU
dc.language.iso	ru	ru_RU
dc.subject	��	ru_RU
dc.subject	��	ru_RU
dc.subject	��	ru_RU
dc.title	Upperbounds on the probability of finding marked connected components using quantum walks	ru_RU
dc.type	Articles in international journals and collections	ru_RU