Quantum Online Streaming Algorithms with Logarithmic Memory

dc.contributor.author	Khadiev K.
dc.contributor.author	Khadieva A.
dc.date.accessioned	2020-01-21T20:31:10Z
dc.date.available	2020-01-21T20:31:10Z
dc.date.issued	2019
dc.identifier.issn	0020-7748
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/157321
dc.description.abstract	© 2019, Springer Science+Business Media, LLC, part of Springer Nature. We consider quantum and classical (deterministic or randomize) streaming online algorithms with respect to competitive ratio. We show that there is a problem that can be solved by a quantum online streaming algorithm better than by classical ones in the case of logarithmic memory. The problem is an online version of the Disjointness problem (Checking weather two sets are disjoint or not).
dc.relation.ispartofseries	International Journal of Theoretical Physics
dc.subject	Computational complexity
dc.subject	Logarithmic space
dc.subject	OBDD
dc.subject	Online algorithms
dc.subject	Online minimization problems
dc.subject	Quantum computation
dc.subject	Streaming algorithms
dc.title	Quantum Online Streaming Algorithms with Logarithmic Memory
dc.type	Article
dc.collection	Публикации сотрудников КФУ
dc.source.id	SCOPUS00207748-2019-SID85069145774

Файлы в этом документе

Имя: SCOPUS00207748-20 ...

Размер: 101.9Kb

Формат: PDF

Публикации сотрудников КФУ Scopus [24551]
Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.