Quantum function computation using sublogarithmic space (abstract & poster)
Computational Complexity
2010-09-17 v1
Abstract
We prove that quantum Turing machines are strictly superior to probabilistic Turing machines in function computation for any space bound .
Keywords
Cite
@article{arxiv.1009.3124,
title = {Quantum function computation using sublogarithmic space (abstract & poster)},
author = {A. C. Cem Say and Abuzer Yakaryilmaz},
journal= {arXiv preprint arXiv:1009.3124},
year = {2010}
}
Comments
2 pages, poster presented at the 13th Workshop on Quantum Information Processing (QIP2010)