Classical and quantum parallelism in the quantum fingerprinting method

Abstract

In this paper we focus on how the classical and quantum parallelism are combined in the quantum fingerprinting technique we proposed earlier. We also show that our method can be used not only to efficiently compute Boolean functions with linear polynomial presentations but also can be adapted for the functions with nonlinear presentations of bounded "nonlinearity". © 2011 Springer-Verlag Berlin Heidelberg.