Analysis of properties of quantum hashing

DOI10.1007/s10958-019-04412-9zbMath1426.81033OpenAlexW2965415189MaRDI QIDQ2331334

M. A. Latypov, A. R. Vasilov, Alexander V. Vasiliev

Publication date: 29 October 2019

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-019-04412-9

zbMATH Keywords

quantum computingquantum cryptographyrandom searchquantum hashinglinear binary codeparticle swarm algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Quantum computation (81P68) Cryptography (94A60) Quantum coding (general) (81P70) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Binary quantum hashing
• Quantum hashing via \(\epsilon\)-universal hashing constructions and classical fingerprinting
• Stochastic adaptive search for global optimization.
• Greedy randomized adaptive search procedures
• 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
• Minimization by Random Search Techniques
• Random Cayley graphs and expanders
• Constructing Small-Bias Sets from Algebraic-Geometric Codes
• Improved Constructions of Quantum Automata

This page was built for publication: Analysis of properties of quantum hashing