Výsledky vyhledávání - "Ulyanov, Sergey"

Report

Unconventional Cognitive Intelligent Robotic Control: Quantum Soft Computing Approach in Human Being Emotion Estimation -- QCOptKB Toolkit Application

Autor: Ulyanov, Sergey V., Kurawaki, Ichiro, Ulyanov, Viktor S., Hagiwara, Takakhide

Strategy of intelligent cognitive control systems based on quantum and soft computing presented. Quantum self-organization knowledge base synergetic effect extracted from intelligent fuzzy controllers imperfect knowledge bases described. That technol

Externí odkaz: http://arxiv.org/abs/2307.06858

Zobrazit plný text záznamu

Report

Unified Information Dynamic Analysis of Quantum Decision-Making and Search Algorithms: Computational Intelligence Measure

Autor: Ulyanov, Sergey V., Ghisi, Fabio, Kurawaki, Ichiro, Ulyanov, Viktor S.

There are important algorithms built upon a mixture of basic techniques described; for example, the Fast Fourier Transform (FFT) employs both Divide-and-Conquer and Transform-and-Conquer techniques. In this article, the evolution of a quantum algorit

Externí odkaz: http://arxiv.org/abs/2306.03233

Zobrazit plný text záznamu

Report

Robust Quantum Controllers: Quantum Information -- Thermodynamic Hidden Force Control in Intelligent Robotics based on Quantum Soft Computing

Autor: Ulyanov, Sergey V., Ulyanov, Viktor S., Hagiwara, Takakhide

A generalized strategy for the design of intelligent robust control systems based on quantum / soft computing technologies is described. The reliability of hybrid intelligent controllers increase by providing the ability to self-organize of imperfect

Externí odkaz: http://arxiv.org/abs/2305.11254

Zobrazit plný text záznamu

Report

Quantum Algorithmic Gate-Based Computing: Grover Quantum Search Algorithm Design in Quantum Software Engineering

Autor: Ulyanov, Sergey V., Ulyanov, Viktor S.

The difference between classical and quantum algorithms (QA) is following: problem solved by QA is coded in the structure of the quantum operators. Input to QA in this case is always the same. Output of QA says which problem coded. In some sense, giv

Externí odkaz: http://arxiv.org/abs/2304.13703

Zobrazit plný text záznamu

Report

Fast quantum search algorithm modelling on conventional computers: Information analysis of termination problem

Autor: Ulyanov, Sergey V., Ulyanov, Viktor S.

The simplest technique for simulating a quantum algorithm - QA described based on the direct matrix representation of the quantum operators. Using this approach, it is relatively simple to simulate the operation of a QA and to perform fidelity analys

Externí odkaz: http://arxiv.org/abs/2304.09745

Zobrazit plný text záznamu