Quantum function computation using sublogarithmic space (abstract & poster)

Details Quantum function computation using sublogarithmic space (abstract & poster) Quantum function computation using sublogarithmic space (abstract & poster)

2010-09-16

arxiv.org/abs/1009.3124v1

Computer Science

Computational Complexity

2 pages, poster presented at the 13th Workshop on Quantum Information Processing (QIP2010)

Scientific paper

We prove that quantum Turing machines are strictly superior to probabilistic
Turing machines in function computation for any space bound $ o(\log(n)) $.

Affiliated with

Also associated with

No associations

Rating

Quantum function computation using sublogarithmic space (abstract & poster) 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 Quantum function computation using sublogarithmic space (abstract & poster), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum function computation using sublogarithmic space (abstract & poster) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-27396