Fast quantum verification for the formulas of predicate calculus

Details Fast quantum verification for the formulas of predicate calculus Fast quantum verification for the formulas of predicate calculus

1998-09-08

arxiv.org/abs/quant-ph/9809015v3

Physics

Quantum Physics

Reference to the work quant-ph/9802040 with the similar result is added

Scientific paper

Quantum algorithm is constructed which verifies the formulas of predicate
calculus in time $O(\sqrt N)$ with bounded error probability, where $N$ is the
time required for classical algorithms. This algorithm uses the polynomial
number of simultaneous oracle queries. This is a modification of the result of
Buhrman, Cleve and Wigderson quant-ph/9802040.

Affiliated with

Also associated with

No associations

Rating

Fast quantum verification for the formulas of predicate calculus 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 Fast quantum verification for the formulas of predicate calculus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast quantum verification for the formulas of predicate calculus will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-329729