On quantum realisation of Boolean functions by the fingerprinting technique
-
F. M. Ablayev
Abstract
In this paper, we develop the fingerprinting technique of calculation of Boolean functions in quantum calculation models.
The use of the fingerprinting technique is demonstrated on the example of calculation of the function MODm in the class of quantum OBDD (oblivious read-once branching programs). Next, the potentialities of the fingerprinting technique are demonstrated in the example of realisation of the ‘equality’ function in the quantum model of communication with a referee (the SMP communication model) and in examples of recognition of languages in quantum automata.
All given realisations of Boolean functions in various quantum calculation models (OBDD, SMP communication model, and a finite automaton) are asymptotically optimal.
The authors thank Juhani Karhumäki for the invitation to the University of Turku and fruitful discussions of this research.
© de Gruyter 2009
Artikel in diesem Heft
- On quantum realisation of Boolean functions by the fingerprinting technique
- On the choice of the defence strategy for an authentication code with two-state source
- A parametric model of embedding and its statistical analysis
- On some equations related to the tpp-groups
- Description of finite nonnilpotent rings with planar zero-divisor graphs
- Rings over which all finitely generated modules are ℵ0-injective
- On the number of boundary classes in the 3-colouring problem
- Periods of output sequences of an automaton for a given periodic input sequence
- On the complexity of representation of k-valued functions by generalised polarised polynomials
Artikel in diesem Heft
- On quantum realisation of Boolean functions by the fingerprinting technique
- On the choice of the defence strategy for an authentication code with two-state source
- A parametric model of embedding and its statistical analysis
- On some equations related to the tpp-groups
- Description of finite nonnilpotent rings with planar zero-divisor graphs
- Rings over which all finitely generated modules are ℵ0-injective
- On the number of boundary classes in the 3-colouring problem
- Periods of output sequences of an automaton for a given periodic input sequence
- On the complexity of representation of k-valued functions by generalised polarised polynomials
