Efficient Equivalent of Shallow Quantum Hashing
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909921438597120 |
|---|---|
| author | Zinnatullin, Ilnar Vasiliev, Alexander |
| author_facet | Zinnatullin, Ilnar Vasiliev, Alexander |
| contents | Quantum hashing is a widely used technique in quantum computation that allows us to design space-efficient algorithms and protocols. Recently, Vasiliev has shown that the phase form of shallow quantum hashing can be implemented by a circuit of depth 2. In this paper, we establish a connection between shallow quantum hashing and single-qubit quantum hashing for the amplitude form. For a shallow circuit, we propose a circuit of depth 1 that achieves the same collision resistance. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_19292 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Efficient Equivalent of Shallow Quantum Hashing Zinnatullin, Ilnar Vasiliev, Alexander Quantum Physics Quantum hashing is a widely used technique in quantum computation that allows us to design space-efficient algorithms and protocols. Recently, Vasiliev has shown that the phase form of shallow quantum hashing can be implemented by a circuit of depth 2. In this paper, we establish a connection between shallow quantum hashing and single-qubit quantum hashing for the amplitude form. For a shallow circuit, we propose a circuit of depth 1 that achieves the same collision resistance. |
| title | Efficient Equivalent of Shallow Quantum Hashing |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2511.19292 |