On a Quantum Circuit Implementing a Quantum Hash Function
Received: 23 Oct 2026 Revised: 05 Nov 2026 Accepted: 05 Nov 2026
Published: 2026, vol. 30, issue 4, pp. 266–269
Abstract
We present an algorithm for constructing a \(k\)-qubit quantum hashing circuit with \(d\) parameters, where \(k \geq 3\) and \(2^{k-2} < d \leq 2^{k-1}\). We obtain the bounds \(N_{1} \leq 2^{k-1} + 11k - 24\) and \(N_{2} \leq 2^{k-1} + 3k - 8\) on the numbers of elementary one-qubit gates and \(\mathrm {CNOT}\) gates, respectively. For \(k \geq 5\), both bounds are lower than the corresponding bounds for the algorithm of Bergholm et al. (2005) in the same gate basis.
Keywords: quantum hashing, quantum circuit.
BibTeX
@article{IS-Zinnatullin2026,
author = {Zinnatullin, Ilnar Gumarovich},
title = {{On a Quantum Circuit Implementing a Quantum Hash Function}},
journal = {Intelligent Systems. Theory and Applications},
year = {2026},
volume = {30},
number = {4},
pages = {266--269},
}
AMSBIB
\Bibitem{IS-Zinnatullin2026}
\by I.\,G.~Zinnatullin
\paper On a Quantum Circuit Implementing a Quantum Hash Function
\jour Intelligent Systems. Theory and Applications
\yr 2026
\vol 30
\issue 4
\pages 266--269
\lang In Russian
RU