Efficient Branching Programs for Quantum Hash Functions Generated by Small-Biased Sets
- Autores: Ablayev M.1
-
Afiliações:
- Institute of Computational Mathematics and Information Technologies
- Edição: Volume 39, Nº 7 (2018)
- Páginas: 961-966
- Seção: Article
- URL: https://journals.rcsi.science/1995-0802/article/view/202716
- DOI: https://doi.org/10.1134/S199508021807003X
- ID: 202716
Citar
Resumo
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.
Palavras-chave
Sobre autores
M. Ablayev
Institute of Computational Mathematics and Information Technologies
Autor responsável pela correspondência
Email: mablayev@gmail.com
Rússia, ul. Kremlevskaya 18, Kazan, Tatarstan, 420008
![](/img/style/loading.gif)