Computing Boolean Functions via Quantum Hashing
From MaRDI portal
Publication:2944885
DOI10.1007/978-3-319-13350-8_11zbMath1323.68266OpenAlexW58750062WikidataQ62045227 ScholiaQ62045227MaRDI QIDQ2944885
Alexander V. Vasiliev, Farid M. Ablayev
Publication date: 8 September 2015
Published in: Computing with New Resources (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-13350-8_11
Related Items
Quantum hashing for finite abelian groups, On quantum \((\delta,\varepsilon)\)-resistant hashing, Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations, Binary quantum hashing, Computing Boolean Functions via Quantum Hashing, Dynamic full quantum one-way function based on quantum circuit mapping, Quantum computer with atomic logical qubits encoded on macroscopic three-level systems in common quantum electrodynamic cavity, О понятии квантового хеширования, Efficient branching programs for quantum hash functions generated by small-biased sets, Attacking quantum hashing. Protocols and their cryptanalysis, Constructing quantum hash functions based on quantum walks on Johnson graphs, Quantum to classical one-way function and its applications in quantum money authentication, Минимизация коллизий при квантовом хешировании, Analysis of properties of quantum hashing
Cites Work
- Unnamed Item
- Unnamed Item
- Probabilistic verification of Boolean functions
- Numerical computation of characteristic polynomials of Boolean functions and its applications
- Quantum branching programs and space-bounded nonuniform quantum complexity
- Quantum computer with atomic logical qubits encoded on macroscopic three-level systems in common quantum electrodynamic cavity
- On the computational power of probabilistic and quantum branching program
- Computing Boolean Functions via Quantum Hashing
- Quantum computational networks
- Constructing Small Sets that are Uniform in Arithmetic Progressions
- Branching Programs and Binary Decision Diagrams
