Quantum function computation using sublogarithmic space (abstract & poster)

نویسندگان

A. C. Cem Say

Abuzer Yakaryilmaz

چکیده

We examine the power of quantum Turing machines (QTM’s) which compute string-valued functions of their inputs using small workspace. A (probabilistic or quantum) Turing machine has three tapes: A read-only input tape, a read/write work tape, and a “1.5-way" write-only output tape. Consider a partial function f : Σ 1 → Σ 2 , where Σ1 and Σ2 are the input and output tape alphabets, respectively. We say that such a machine M computes the function f with bounded error if, when started with string w ∈ Σ 1

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Classical and quantum computation with small space bounds (PhD thesis)

In this thesis, we introduce a new quantum Turing machine (QTM) model that supports general quantum operators, together with its pushdown, counter, and finite automaton variants, and examine the computational power of classical and quantum machines using small space bounds in many different cases. The main contributions are summarized below. Firstly, we consider QTMs in the unbounded error sett...

متن کامل

A Sharp Separation of Sublogarithmic Space Complexity Classes

We present very sharp separation results for Turing machine sublogarithmic space complexity classes which are of the form: For any, arbitrarily slow growing, recursive nondecreasing and unbounded function s there is a k ∈ N and an unary language L such that L ∈ SPACE(s(n) + k) \ SPACE(s(n − 1)). For a binary L the supposition lim s = ∞ is sufficient. The witness languages differ from each langu...

متن کامل

Languages recognized by nondeterministic quantum finite automata

The nondeterministic quantum finite automaton (NQFA) is the only known case where a one-way quantum finite automaton (QFA) model has been shown to be strictly superior in terms of language recognition power to its probabilistic counterpart. We give a characterization of the class of languages recognized by NQFA's, demonstrating that it is equal to the class of exclusive stochastic languages. We...

متن کامل

Theoretical computation of the quantum transport of zigzag mono-layer Graphenes with various z-direction widths

The quantum transport computations have been carried on four different width of zigzag graphene using a nonequilibrium Green’s function method combined with density functional theory. The computed properties are included transmittance spectrum, electrical current and quantum conductance at the 0.3V as bias voltage. The considered systems were composed from one-layer graphene sheets differing w...

متن کامل