Quick Navigation
Topics
Topological Quantum Computing
Quantum Simulation
Entanglement Theory Quantum Correlations
Quantum hashing based on symmetric groups
arXiv
Authors: Mansur Ziatdinov
Year
2016
Paper ID
41693
Status
Preprint
Abstract Read
~2 min
Abstract Words
103
Citations
N/A
Abstract
The notion of quantum hashing formalized by F. Ablayev and A. Vasiliev in 2013. F. Ablayev and M. Ablayev in 2014 introduced the notion of quantum hash generator which is convenient technical tool for constructing quantum hash func- tions. M. Ziatdinov in 2014 presented group approach for constructing quantum hash functions. All these mentioned above results present constructions of quan- tum hash functions based on abelian groups. This paper continue the research on quantum hashing. Our approach allows us to construct quantum hash function working on any (finite) group. Also our approach allows us to construct quantum hash functions based on classical hash function from NC1.
Why This Paper Matters
- This paper contributes to the Quantum Simulation research area in the Quantum Articles archive.
- It adds a 2016 reference point for readers tracking recent quantum research.
- The notion of quantum hashing formalized by F.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.