Zobrazeno 1 - 10
of 176
pro vyhledávání: '"Yakaryılmaz, Abuzer"'
Publikováno v:
UCNC 2024, LNCS 14776, 2024
We present a framework for the implementation of quantum finite automata algorithms designed for the language $ MOD_p = \{ a^{i\cdot p } \mid i \geq 0 \}$ on gate-based quantum computers. First, we compile the known theoretical results from the liter
Externí odkaz:
http://arxiv.org/abs/2406.11360
Publikováno v:
EPTCS 386, 2023, pp. 269-280
Quantum fingerprinting is a technique that maps classical input word to a quantum state. The obtained quantum state is much shorter than the original word, and its processing uses less resources, making it useful in quantum algorithms, communication,
Externí odkaz:
http://arxiv.org/abs/2304.12868
Autor:
Yakaryılmaz, Abuzer
We introduce Merlin-Arthur (MA) automata where Merlin provides a certificate at the beginning of computation and it is scanned by Arthur before reading the input. We define Merlin-Arthur deterministic, probabilistic, and quantum finite state automata
Externí odkaz:
http://arxiv.org/abs/2212.13801
Autor:
Yakaryılmaz, Abuzer
We show that bounded-error affine finite automata recognize uncountably many (and so some non-Turing recognizable) languages when using real-valued transitions.
Comment: 8 pages
Comment: 8 pages
Externí odkaz:
http://arxiv.org/abs/2212.11834
Autor:
Ukpabi, Dandison, Karjaluoto, Heikki, Bötticher, Astrid, Nikiforova, Anastasija, Petrescu, Dragoş, Schindler, Paulina, Valtenbergs, Visvaldis, Lehmann, Lennard, Yakaryilmaz, Abuzer
Recently, there has been increasing awareness of the tremendous opportunities inherent in quantum computing (QC). Specifically, the speed and efficiency of QC will significantly impact the Internet of Things, cryptography, finance, and marketing. Acc
Externí odkaz:
http://arxiv.org/abs/2212.13909
Publikováno v:
Quantum 6, 752 (2022)
Quantum finite automata (QFA) are basic computational devices that make binary decisions using quantum operations. They are known to be exponentially memory efficient compared to their classical counterparts. Here, we demonstrate an experimental impl
Externí odkaz:
http://arxiv.org/abs/2202.04915
Autor:
Salehi, Özlem, Yakaryılmaz, Abuzer
The study of quantum finite automata (QFAs) is one of the possible approaches in exploring quantum computers with finite memory. Despite being one of the most restricted models, Moore-Crutchfield quantum finite automaton (MCQFA) is proven to be expon
Externí odkaz:
http://arxiv.org/abs/2107.02262
Autor:
Yakaryılmaz, Abuzer
Affine finite automata (AfA) can be more succinct than probabilistic and quantum finite automata when recognizing some regular languages with bounded-error. In this paper, we improve previously known constructions given for the succinctness of AfAs i
Externí odkaz:
http://arxiv.org/abs/2106.16197
Quantum finite automata (QFAs) literature offers an alternative mathematical model for studying quantum systems with finite memory. As a superiority of quantum computing, QFAs have been shown exponentially more succinct on certain problems such as re
Externí odkaz:
http://arxiv.org/abs/2105.06184
Publikováno v:
Proceedings of the 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021), 10:1--10:17, 2021
Post-selection, the power of discarding all runs of a computation in which an undesirable event occurs, is an influential concept introduced to the field of quantum complexity theory by Aaronson (Proceedings of the Royal Society A, 2005). In the pres
Externí odkaz:
http://arxiv.org/abs/2105.02681