Exact quantum query complexity for total Boolean functions

Details Exact quantum query complexity for total Boolean functions Exact quantum query complexity for total Boolean functions

2004-03-23

arxiv.org/abs/quant-ph/0403168v2

Physics

Quantum Physics

5 pages, corrected grammar, some comments added

Scientific paper

We will show that if there exists a quantum query algorithm that exactly
computes some total Boolean function f by making T queries, then there is a
classical deterministic algorithm A that exactly computes f making O(T^3)
queries. The best know bound previously was O(T^4) due to Beals et al.

Affiliated with

Also associated with

No associations

Rating

Exact quantum query complexity for total 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 Exact quantum query complexity for total Boolean functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exact quantum query complexity for total Boolean functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-679315