Quantum function computation using sublogarithmic space (abstract & poster)

preprint2010arXivOpen access

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

Quantum function computation using sublogarithmic space (abstract & poster)

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0