Span-program-based quantum algorithm for evaluating unbalanced formulas

Details Span-program-based quantum algorithm for evaluating unbalanced formulas Span-program-based quantum algorithm for evaluating unbalanced formulas

2009-07-09

arxiv.org/abs/0907.1622v1

Physics

Quantum Physics

28 pages, 1 figure

Scientific paper

The formula-evaluation problem is defined recursively. A formula's evaluation is the evaluation of a gate, the inputs of which are themselves independent formulas. Despite this pure recursive structure, the problem is combinatorially difficult for classical computers. A quantum algorithm is given to evaluate formulas over any finite boolean gate set. Provided that the complexities of the input subformulas to any gate differ by at most a constant factor, the algorithm has optimal query complexity. After efficient preprocessing, it is nearly time optimal. The algorithm is derived using the span program framework. It corresponds to the composition of the individual span programs for each gate in the formula. Thus the algorithm's structure reflects the formula's recursive structure.

Affiliated with

Also associated with

No associations

Rating

Span-program-based quantum algorithm for evaluating unbalanced formulas 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 Span-program-based quantum algorithm for evaluating unbalanced formulas, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Span-program-based quantum algorithm for evaluating unbalanced formulas will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-342182