Efficient Branching Programs for Quantum Hash Functions Generated by Small-Biased Sets
- 作者: Ablayev M.1
-
隶属关系:
- Institute of Computational Mathematics and Information Technologies
- 期: 卷 39, 编号 7 (2018)
- 页面: 961-966
- 栏目: Article
- URL: https://journals.rcsi.science/1995-0802/article/view/202716
- DOI: https://doi.org/10.1134/S199508021807003X
- ID: 202716
如何引用文章
详细
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.
作者简介
M. Ablayev
Institute of Computational Mathematics and Information Technologies
编辑信件的主要联系方式.
Email: mablayev@gmail.com
俄罗斯联邦, ul. Kremlevskaya 18, Kazan, Tatarstan, 420008
![](/img/style/loading.gif)