Abstract
In this paper we show a computational aspect of the quantum hashing technique. In particular we apply it for computing Boolean functions in the model of read-once quantum branching programs based on the properties of specific polynomial presentation of those functions.
Cite
CITATION STYLE
APA
Ablayev, F., & Vasiliev, A. (2014). Computing boolean functions via quantum hashing. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8808, 149–160. https://doi.org/10.1007/978-3-319-13350-8_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free