Quantum finite automata: A modern introduction
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 …
counterparts. This may be useful as a relatively simple technique to introduce quantum …
Automata and quantum computing
Quantum computing is a new model of computation, based on quantum physics. Quantum
computers can be exponentially faster than conventional computers for problems such as …
computers can be exponentially faster than conventional computers for problems such as …
Nuclear electric resonance for spatially resolved spin control via pulsed optical excitation in the UV-visible spectrum
JK Krondorfer, AW Hauser - Physical Review A, 2023 - APS
Nuclear electric resonance (NER) spectroscopy is currently experiencing a revival as a tool
for nuclear spin-based quantum computing. Compared to magnetic or electric fields, local …
for nuclear spin-based quantum computing. Compared to magnetic or electric fields, local …
Classical and quantum computations with restricted memory
Abstract Automata and branching programs are known models of computation with restricted
memory. These models of computation were in focus of a large number of researchers …
memory. These models of computation were in focus of a large number of researchers …
Very narrow quantum OBDDs and width hierarchies for classical OBDDs
In the paper we investigate Ordered Binary Decision Diagrams (OBDDs)–a model for
computing Boolean functions. We present a series of results on the comparative complexity …
computing Boolean functions. We present a series of results on the comparative complexity …
Quantum and classical log-bounded automata for the online disjointness problem
K Khadiev, A Khadieva - Mathematics, 2022 - mdpi.com
We consider online algorithms with respect to the competitive ratio. In this paper, we explore
one-way automata as a model for online algorithms. We focus on quantum and classical …
one-way automata as a model for online algorithms. We focus on quantum and classical …
Generalized Deutsch-Jozsa problem and the optimal quantum algorithm
D Qiu, S Zheng - Physical Review A, 2018 - APS
The Deutsch-Jozsa algorithm is one of the first examples of a quantum algorithm that is
exponentially faster than any possible deterministic classical algorithm. It was proposed by …
exponentially faster than any possible deterministic classical algorithm. It was proposed by …
Very narrow quantum OBDDs and width hierarchies for classical OBDDs
In the paper we investigate a model for computing of Boolean functions–Ordered Binary
Decision Diagrams (OBDDs), which is a restricted version of Branching Programs. We …
Decision Diagrams (OBDDs), which is a restricted version of Branching Programs. We …
Quantum online algorithms with respect to space and advice complexity
K Khadiev, A Khadieva, I Mannapov - Lobachevskii Journal of …, 2018 - Springer
Online computation is a well-known area of computer science. We introduce quantum online
algorithms and investigate them with respect to a competitive ratio in two points of view …
algorithms and investigate them with respect to a competitive ratio in two points of view …
Quantum online streaming algorithms with logarithmic memory
K Khadiev, A Khadieva - International Journal of Theoretical Physics, 2021 - Springer
We consider quantum and classical (deterministic or randomize) streaming online
algorithms with respect to competitive ratio. We show that there is a problem that can be …
algorithms with respect to competitive ratio. We show that there is a problem that can be …