Computing boolean functions via quantum hashing

© Springer International Publishing Switzerland 2014. 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

Quantum Hashing for Finite Abelian Groups

We propose a generalization of the quantum hashing technique based on the notion of the small-bias sets. These sets have proved useful in different areas of computer science, and here their properties give an optimal construction for succinct quantum presentation of elements of any finite abelian group, which can be used in various computational and cryptographic scenarios. The known quantum fingerprinting schemas turn out to be the special cases of the proposed quantum hashing for the corresponding abelian group

Quantum Communications Based on Quantum Hashing

In this paper we consider an application of the recently proposed quantum hashing technique for computing Boolean functions in the quantum communication model. The combination of binary functions on non-binary quantum hash function is done via polynomial presentation, which we have called a characteristic of a Boolean function. Based on the characteristic polynomial presentation of Boolean functions and quantum hashing technique we present a method for computing Boolean functions in the quantum one-way communication model, where one of the parties performs his computations and sends a message to the other party, who must output the result after his part of computations. Some of the results are also true in a more restricted Simultaneous Message Passing model with no shared resources, in which communicating parties can interact only via the referee. We give several examples of Boolean functions whose polynomial presentations have specific properties allowing for construction of quantum communication protocols that are provably exponentially better than classical ones in the simultaneous message passing setting

Minimizing collisions for quantum hashing

© Medwell Journals, 2017.Hashing is a widely used technique in computer science. The recently proposed quantum hashing has also proved its usefulness in a number of applications. The key property of both classical and quantum hashing is the ability to withstand collisions however, the notion of collision itself is different in the classical and quantum setting. In this study we analyze the set of numeric parameters that determine the probability of quantum collisions for the quantum hashing. Although, there is a general method of obtaining good hashing parameters, it makes sense for comparatively large inputs. That is why we construct different methods to complement the general one. We present two explicit optimization algorithms for computation of quantum hashing parameters: one is based on the genetic approach and the other uses the annealing simulation. The solution to the considered optimization problem can be used for the variety of quantum hash functions and also provides a solution to the general problem of constructing sets of pairwise distinguishable states in low-dimensional spaces

Computing boolean functions via quantum hashing

© Springer International Publishing Switzerland 2014. 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

Computing boolean functions via quantum hashing

© Springer International Publishing Switzerland 2014. 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

Computing boolean functions via quantum hashing

© Springer International Publishing Switzerland 2014. 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