Abuzer Yakaryılmaz

Abuzer Yakaryılmaz

Auto-generated profile, based on publicly available information

Abuzer Yakaryılmaz

Center for Quantum Computer Science University of Latvia Street LV-1586 Rīga Latvia

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 2011 in Information and Computation
Verified
Journal Article
Closed access
AYAbuzer Yakaryılmaz
Abuzer Yakaryılmaz
ASA.C. Cem Say
A.C. Cem Say

1 March 2012 in Information Processing Letters
Verified
Journal Article
Closed access
AAAndris Ambainis
Andris Ambainis
AYAbuzer Yakaryılmaz
Abuzer Yakaryılmaz

13 November 2016 in Lobachevskii Journal of Mathematics
Verified
Journal Article
Closed access
PDF file
FAFarid Ablayev
Farid Ablayev
AGA. Gainutdinova
A. Gainutdinova
KKKamil Khadiev
Kamil Khadiev
AYA. Yakaryılmaz
A. Yakaryılmaz

10 December 2014
Verified
Book Chapter
Closed access
PDF file
ASA.C. Cem Say
A.C. Cem Say
AYAbuzer Yakaryılmaz
Abuzer Yakaryılmaz

1 September 2010 in Quantum Information & Computation
Verified
Journal Article
Closed access
AYAbuzer Yakaryilmaz
Abuzer Yakaryilmaz
ASA.C. Cem Say
A.C. Cem Say
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 NQFAs, demonstrating that it is equal to the class of exclusive stochastic languages. We also characterize the class of languages that are recognized necessarily by two-sided error by QFAs. It is shown that these classes remain the same when the QFAs used in their definitions are replaced by several different model variants that have appeared in the literature. We prove several closure properties of the related classes. The ramifications of these results about classical and quantum sublogarithmic space complexity classes are examined.

1 January 2014
Verified
Book Chapter
Closed access
PDF file
FAFarid Ablayev
Farid Ablayev
AGAida Gainutdinova
Aida Gainutdinova
KKKamil Khadiev
Kamil Khadiev
AYAbuzer Yakaryılmaz
Abuzer Yakaryılmaz