Superiority of exact quantum automata for promise problems

Details Superiority of exact quantum automata for promise problems Superiority of exact quantum automata for promise problems

2011-01-20

arxiv.org/abs/1101.3837v2

Computer Science

Computational Complexity

A completely new version. 6 pages. (The previous version contains some errata.)

Scientific paper

In this note, we present an infinite family of promise problems which can be
solved exactly by just tuning transition amplitudes of a two-state quantum
finite automata operating in realtime mode, whereas the size of the
corresponding classical automata grow without bound.

Affiliated with

Also associated with

No associations

Rating

Superiority of exact quantum automata for promise problems 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 Superiority of exact quantum automata for promise problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Superiority of exact quantum automata for promise problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-333145