Efficient algorithms for quantum hashing

DOI10.1007/978-3-032-15641-9_21MaRDI QIDQ7348944zbMATH OpenFDO

Authors Ilnar Zinnatullin, Kamil Khadiev

Publication date 15 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-15641-9_21

Mathematics Subject Classification ID

Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07) Other nonclassical models of computation (68Q09) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites work

• 1-way quantum finite automata: strengths, weaknesses and generalizations
• A representative framework for implementing quantum finite automata on real devices
• Classical and Quantum Computations with Restricted Memory
• Efficient branching programs for quantum hash functions generated by small-biased sets
• Exponential separation of quantum and classical online space complexity
• GAPs for Shallow Implementation of Quantum Finite Automata
• Improved constructions of quantum automata
• Nondeterministic unitary OBDDs
• Quantum algorithms for string processing
• Quantum computation and quantum information. 10th anniversary edition
• Quantum hashing for finite abelian groups
• Quantum online streaming algorithms with logarithmic memory
• Two-way and one-way quantum and classical automata with advice for online minimization problems
• Unary probabilistic and quantum automata on promise problems

This page was built for publication: Efficient algorithms for quantum hashing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7348944)