activity
20062009
most citedComputing Boolean Functions: Exact Quantum Query Algorithms and Low Degree Polynomials

6 citations · 11 across the 5 of their papers we have counts for

collaborators

5 papers

quant-ph2009★ 3 cited

Exact Quantum Query Algorithm for Error Detection Code Verification

Alina Vasilieva

Quantum algorithms can be analyzed in a query model to compute Boolean functions. Function input is provided in a black box, and the aim is to compute the function value using as f…

quant-ph2007★ 1 cited

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

Alina Vasilieva

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 us…

quant-ph2006

Quantum Query Algorithms for Certain Problems and Generalization of Algorithm Designing Techniques

Alina Dubrovska Vasilieva, Taisia Mischenko-Slatenkova

Quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given in a black box, but the aim is to compute function value for arbitrary input u…

quant-ph2006★ 6 cited

Computing Boolean Functions: Exact Quantum Query Algorithms and Low Degree Polynomials

Alina Dubrovska Vasilieva, Taisija Mischenko-Slatenkova

In this paper we study the complexity of quantum query algorithms computing the value of Boolean function and its relation to the degree of algebraic polynomial representing this f…

quant-ph2006★ 1 cited

Properties and Application of Nondeterministic Quantum Query Algorithms

Alina Dubrovska Vasilieva

Many quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given by a black box. As in the classical version of decision trees, different…