Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations
From MaRDI portal
Publication:5042223
DOI10.1007/978-3-030-50026-9_1OpenAlexW3036484014MaRDI QIDQ5042223
Alexander V. Vasiliev, Marat Ablayev, Farid M. Ablayev
Publication date: 19 October 2022
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-50026-9_1
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Discrete-time interacting quantum walks and quantum hash schemes
- Analysis of the two-particle controlled interacting quantum walks
- Quantum hashing via \(\epsilon\)-universal hashing constructions and classical fingerprinting
- Quantum hashing for finite abelian groups
- Small-Bias Sets for Nonabelian Groups
- Computing Boolean Functions via Quantum Hashing
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Randomness-efficient low degree tests and short PCPs via epsilon-biased sets
- Random Cayley graphs and expanders
- Constructing Small-Bias Sets from Algebraic-Geometric Codes
- Improved Constructions of Quantum Automata