Efficient Branching Programs for Quantum Hash Functions Generated by Small-Biased Sets

dc.contributor.author	Ablayev M.
dc.date.accessioned	2019-01-22T20:51:49Z
dc.date.available	2019-01-22T20:51:49Z
dc.date.issued	2018
dc.identifier.issn	1995-0802
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/149153
dc.description.abstract	© 2018, Pleiades Publishing, Ltd. In the paper we consider quantum (δ, ϵ)-hash functions in so called phase form (phase quantum (δ, ϵ)-hash function). It is known that ϵ-biased sets generate phase quantum (δ, ϵ)- hash function. We show that the construction is invertible, that is, phase quantum (δ, ϵ)-hash function defines ϵ-biased sets. Next, we present an efficient (in the sense of time and qubits needed) Branching program construction for phase quantum (δ, ϵ)-hash function.
dc.relation.ispartofseries	Lobachevskii Journal of Mathematics
dc.subject	Branching programs
dc.subject	Hash function
dc.subject	Quantum computations
dc.title	Efficient Branching Programs for Quantum Hash Functions Generated by Small-Biased Sets
dc.type	Article
dc.relation.ispartofseries-issue	7
dc.relation.ispartofseries-volume	39
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	961
dc.source.id	SCOPUS19950802-2018-39-7-SID85053520304

Files in this item

Size: 378.3Kb

Format: PDF

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