Work

Quantum function computation using sublogarithmic space (abstract & poster)

Year: 2010

Type: preprint

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

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1009.3124

Authors: Say, A. C. Cem, Yakaryilmaz, Abuzer

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W4394649007

Cites:

Cited by: 4

Related to: 10