Computing Boolean functions via quantum hashing

DOI10.1007/978-3-319-13350-8_11MaRDI QIDQ2944885zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Alexander V. Vasiliev, F. 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

Mathematics Subject Classification ID

Quantum computation (81P68)

Recommendations

• On quantum realisation of Boolean functions by the fingerprinting technique
• Binary quantum hashing
• Algorithms for quantum branching programs based on fingerprinting
• SOFSEM 2005: Theory and Practice of Computer Science
• Boolean functions identification via quantum computing methods

Cites work

• Branching Programs and Binary Decision Diagrams
• Computing Boolean functions via quantum hashing
• Constructing Small Sets that are Uniform in Arithmetic Progressions
• Numerical computation of characteristic polynomials of Boolean functions and its applications
• On computational power of quantum branching programs
• On the computational power of probabilistic and quantum branching program
• Ordered quantum branching programs are more powerful than ordered probabilistic branching programs under a bounded-width restriction
• Probabilistic verification of Boolean functions
• Quantum branching programs and space-bounded nonuniform quantum complexity
• Quantum computational networks
• Quantum computer with atomic logical qubits encoded on macroscopic three-level systems in common quantum electrodynamic cavity

Cited in

(17)

• 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
• Quantum hashing for finite abelian groups
• On quantum \((\delta,\varepsilon)\)-resistant hashing
• Quantum computer with atomic logical qubits encoded on macroscopic three-level systems in common quantum electrodynamic cavity
• Computing Boolean functions via quantum hashing
• On quantum realisation of Boolean functions by the fingerprinting technique
• Binary quantum hashing
• Минимизация коллизий при квантовом хешировании
• Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations
• Algorithms for quantum branching programs based on fingerprinting
• On the concept of quantum hashing
• Dynamic full quantum one-way function based on quantum circuit mapping
• Implementation of quantum Fourier transform and quantum hashing for quantum devices with arbitrary qubit connectivity graphs

This page was built for publication: Computing Boolean functions via quantum hashing

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