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

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

2006-07-04

arxiv.org/abs/quant-ph/0607022v1

Physics

Quantum Physics

11 pages, 5 figures

Scientific paper

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 function. We pay special attention to Boolean functions with quantum query algorithm complexity lower than the deterministic one. Relation between the degree of representing polynomial and potentially possible quantum algorithm complexity has been already described; unfortunately, there are few examples of quantum algorithms to illustrate theoretical evaluation of the complexity. Work in this direction was aimed (1) to construct effective quantum query algorithms for computing Boolean functions, (2) to design methods for Boolean function construction with a large gap between deterministic complexity and degree of representing polynomial. In this paper we present our results in both directions.

Affiliated with

Also associated with

No associations

Rating

Computing Boolean Functions: Exact Quantum Query Algorithms and Low Degree Polynomials does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing Boolean Functions: Exact Quantum Query Algorithms and Low Degree Polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing Boolean Functions: Exact Quantum Query Algorithms and Low Degree Polynomials will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-239757