A note on quantum black-box complexity of almost all Boolean functions

Details A note on quantum black-box complexity of almost all Boolean functions A note on quantum black-box complexity of almost all Boolean functions

1998-11-28

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

Inform.Proc.Lett. 71 (1999) 5-7

Physics

Quantum Physics

4 pages, LaTeX

Scientific paper

We show that, for almost all N-variable Boolean functions f, at least
N/4-O(\sqrt{N} log N) queries are required to compute f in quantum black-box
model with bounded error.

Affiliated with

Also associated with

No associations

Rating

A note on quantum black-box complexity of almost all Boolean functions 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 A note on quantum black-box complexity of almost all Boolean functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on quantum black-box complexity of almost all Boolean functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-401972