#### Filter Results:

- Full text PDF available (53)

#### Publication Year

2009

2018

- This year (5)
- Last 5 years (49)
- Last 10 years (75)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Jibran Rashid, Abuzer Yakaryilmaz
- CIAA
- 2014

We construct zero-error quantum finite automata (QFAs) for promise problems which cannot be solved by bounded-error probabilistic finite automata (PFAs). Here is a summary of our results: 1. There isâ€¦ (More)

- Abuzer Yakaryilmaz, A. C. Cem Say
- Discrete Mathematics & Theoretical Computerâ€¦
- 2010

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching andâ€¦ (More)

- A. C. Cem Say, Abuzer Yakaryilmaz
- Computing with New Resources
- 2014

We present five examples where quantum finite automata (QFAs) outperform their classical counterparts. This may be useful as a relatively simple technique to introduce quantum computation concepts toâ€¦ (More)

- Abuzer Yakaryilmaz, A. C. Cem Say
- Inf. Comput.
- 2011

We prove the following facts about the language recognition power of quantum Turing machines (QTMs) in the unbounded error setting: QTMs are strictly more powerful than probabilistic Turing machinesâ€¦ (More)

- A. C. Cem Say, Abuzer Yakaryilmaz
- Natural Computing
- 2012

We examine some variants of computation with closed timelike curves (CTCs), where various restrictions are imposed on the memory of the computer, and the information carrying capacity and range ofâ€¦ (More)

- Abuzer Yakaryilmaz
- ArXiv
- 2012

In this paper, we introduce a new public quantum interactive proof system and the first quantum alternating Turing machine: qAM proof system and qATM, respectively. Both are obtained from theirâ€¦ (More)

- Abuzer Yakaryilmaz
- Electronic Colloquium on Computational Complexity
- 2012

We introduce a new public quantum interactive proof system, namely qAM, by augmenting the verifier with a fixed-size quantum register in Arthur-Merlin game. We focus on spacebounded verifiers, andâ€¦ (More)

- Abuzer Yakaryilmaz, A. C. Cem Say
- Quantum Information & Computation
- 2010

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â€¦ (More)

- Marcos Villagra, Abuzer Yakaryilmaz
- Natural Computing
- 2016

In this work we study a non-linear generalization based on affine transformations of probabilistic and quantum automata proposed recently by DÃaz-Caro and YakaryÄ±lmaz (in: Computer scienceâ€”theory andâ€¦ (More)

- Masaki Nakanishi, Abuzer Yakaryilmaz
- CIAA
- 2015

In this paper, we show that one-way quantum one-counter automaton with zero-error is more powerful than its probabilistic counterpart on promise problems. Then, we obtain a similar separation resultâ€¦ (More)