Classical and quantum parallelism in the quantum fingerprinting method

dc.contributor.author	Ablayev F.
dc.contributor.author	Vasiliev A.
dc.date.accessioned	2018-09-18T20:08:19Z
dc.date.available	2018-09-18T20:08:19Z
dc.date.issued	2011
dc.identifier.issn	0302-9743
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/136884
dc.description.abstract	In this paper we focus on how the classical and quantum parallelism are combined in the quantum fingerprinting technique we proposed earlier. We also show that our method can be used not only to efficiently compute Boolean functions with linear polynomial presentations but also can be adapted for the functions with nonlinear presentations of bounded "nonlinearity". © 2011 Springer-Verlag Berlin Heidelberg.
dc.relation.ispartofseries	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.title	Classical and quantum parallelism in the quantum fingerprinting method
dc.type	Conference Paper
dc.relation.ispartofseries-volume	6873 LNCS
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	1
dc.source.id	SCOPUS03029743-2011-6873-SID80053099064

Files in this item

Name: SCOPUS03029743-20 ...

Size: 43.63Kb

Format: PDF

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