On quantum methods for machine learning problems part I: Quantum tools
This is a review of quantum methods for machine learning problems that consists of two
parts. The first part," quantum tools", presents the fundamentals of qubits, quantum registers …
parts. The first part," quantum tools", presents the fundamentals of qubits, quantum registers …
[PDF][PDF] Quantum neural networks for disease treatment identification
V Dutt, S Chandrasekaran… - European Journal of …, 2020 - academia.edu
Machine learning is the advanced methodology to solve the issues related to the real world.
The problems of the real-world can be solved with the help of medical science, where plenty …
The problems of the real-world can be solved with the help of medical science, where plenty …
Lecture notes on quantum algorithms
K Khadiev - arxiv preprint arxiv:2212.14205, 2022 - arxiv.org
The lecture notes contain three parts. The first part is Grover's Search Algorithm with
modifications, generalizations, and applications. The second part is a discussion on the …
modifications, generalizations, and applications. The second part is a discussion on the …
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 …
On the computational power of probabilistic and quantum branching program
In this paper, we show that one-qubit polynomial time computations are as powerful as NC1
circuits. More generally, we define syntactic models for quantum and stochastic branching …
circuits. More generally, we define syntactic models for quantum and stochastic branching …
Reversible cellular automata
J Kari - Developments in Language Theory: 9th International …, 2005 - Springer
Reversible cellular automata (RCA) are models of massively parallel computation that
preserve information. This paper is a short survey of research on reversible cellular …
preserve information. This paper is a short survey of research on reversible cellular …
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 …
Reordering method and hierarchies for quantum and classical ordered binary decision diagrams
K Khadiev, A Khadieva - International computer science symposium in …, 2017 - Springer
We consider Quantum OBDD model. It is restricted version of read-once Quantum Branching
Programs, with respect to “width” complexity. It is known that maximal complexity gap …
Programs, with respect to “width” complexity. It is known that maximal complexity gap …
Quantum neural networks for dynamic route identification to avoid traffic
Computation is the primary task performed for the evaluation of the solution for a specific
problem, and in realtime, having better challenges to implementing the solution path with the …
problem, and in realtime, having better challenges to implementing the solution path with the …