Quantum Query Algorithm Constructions for Computing AND, OR and MAJORITY Boolean Functions

Understand

Quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given in a black box and the aim is to compute function value for arbitrary input using as few queries as possible.

• We concentrate on quantum query algorithm designing tasks in this paper.
• The main aim of the research was to find new efficient algorithms and develop general algorithm designing techniques.
• First, we present several exact quantum query algorithms for certain problems that are better than classical counterparts.