Algorithms for quantum branching programs based on fingerprinting

zbMATH Open1456.68054MaRDI QIDQ5146647FDOQ5146647

Authors: Alexander V. Vasiliev, F. Ablayev 

Publication date: 26 January 2021

Full work available at URL: http://eptcs.web.cse.unsw.edu.au/paper.cgi?DCM2009.1

Recommendations

• On quantum realisation of Boolean functions by the fingerprinting technique
• Computing Boolean functions via quantum hashing
• scientific article; zbMATH DE number 2095528
• scientific article; zbMATH DE number 1839432
• SOFSEM 2005: Theory and Practice of Computer Science

Mathematics Subject Classification ID

Data structures (68P05) Quantum algorithms and complexity in the theory of computing (68Q12)

Cited In (10)

• Quantum hashing for finite abelian groups
• Collision resistance of the OAM-based quantum hashing
• Identification of quantum hashes: numerical experiment
• Analysis of properties of quantum hashing
• Quantum hashing. Group approach
• On quantum realisation of Boolean functions by the fingerprinting technique
• On quantum \((\delta,\varepsilon)\)-resistant hashing
• Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations
• Title not available (Why is that?)
• Computing Boolean functions via quantum hashing

This page was built for publication: Algorithms for quantum branching programs based on fingerprinting

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