Efficient Algorithms for Quantum Hashing
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866909681554817024 |
|---|---|
| author | Zinnatullin, Ilnar Khadiev, Kamil |
| author_facet | Zinnatullin, Ilnar Khadiev, Kamil |
| contents | Quantum hashing is a useful technique that allows us to construct memory-efficient algorithms and secure quantum protocols. First, we present a circuit that implements the phase form of quantum hashing using $2^{n-1}$ CNOT gates, where n is the number of control qubits. Our method outperforms existing approaches and reduces the circuit depth. Second, we propose an algorithm that provides a trade-off between the number of CNOT gates (and consequently, the circuit depth) and the precision of rotation angles. This is particularly important in the context of NISQ (Noisy Intermediate-Scale Quantum) devices, where hardware-imposed angle precision limit remains a critical constraint. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_07002 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Efficient Algorithms for Quantum Hashing Zinnatullin, Ilnar Khadiev, Kamil Quantum Physics Computational Complexity Quantum hashing is a useful technique that allows us to construct memory-efficient algorithms and secure quantum protocols. First, we present a circuit that implements the phase form of quantum hashing using $2^{n-1}$ CNOT gates, where n is the number of control qubits. Our method outperforms existing approaches and reduces the circuit depth. Second, we propose an algorithm that provides a trade-off between the number of CNOT gates (and consequently, the circuit depth) and the precision of rotation angles. This is particularly important in the context of NISQ (Noisy Intermediate-Scale Quantum) devices, where hardware-imposed angle precision limit remains a critical constraint. |
| title | Efficient Algorithms for Quantum Hashing |
| topic | Quantum Physics Computational Complexity |
| url | https://arxiv.org/abs/2507.07002 |