Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Conference on Experience of Designing and Applications of CAD Systems in Microelectronics

Automaton MQT-model for virtual computer design

Ivan Hahanov, Тамер Бани Амер, Irina Hahanova, Dementiev Sergey, Anton Arefiev

Published Feb 1, 2015• 2 citations
Publisher

Abstract

Quantum-like automaton memory-based model is offered; it is characterized by the properties of superposition, entanglement and parallelism for the synthesis of high-performance computers and focused on high-speed analysis of deterministic processes and phenomena in cyberspace.
DOI
10.1109/cadsm.2015.7230798

Related papers

Quantum data structures for SoC design

Svetlana V. Chumachenko, Alexander Shkil, Anastasiya Hahanova +2 more

A qubit-vector model of computing automaton is proposed; it is characterized by the transactional interaction of memory components, which represent the combinational and sequential elements and are implemented in the form of a qubit or “quantum” primitives needed to create parallel virtual computers and cloud-focused processors.

International Conference on Experience of Designing and Applications of CAD Systems in Microelectronics•Feb 1, 2015•0 citations

Qubit Data Structures for Analyzing Computing Systems

Vladimir I. Hahanov, Wajeb Gharibi, Svetlana V. Chumachenko +1 more

Qubit models and methods for improving the performance of software and hardware for analyzing digital devices through increasing the dimension of the data structures and memory are proposed.The basic concepts, terminology and definitions necessary for the implementation of quantum computing when analyzing virtual computers are introduced.The investigation results concerning design and modeling computer systems in a cyberspace based on the use of two-component structure <memory -transactions> are presented.

arXiv:1412.1402•Nov 7, 2014•1 citation

QUANTUM DIGITAL-ANALOGUE COMPUTING

A. Khakhanova, Svetlana V. Chumachenko, Дарія Рахліс +2 more

Context. Nature is the relation among processes and phenomena. Nothing exists in the universe without relations. Computer is transactions of relations between data with the help of control and execution mechanisms. Quantum relations are a superposition of particles and their states. Superposition and entanglement are equivalent concepts. Entanglement is a non-local superposition of deterministic states. A quantum computer is unconditional transactions of relations between qubit data. Quantum computer is an analog device for parallel solution of combinatorial problems. Practically oriented definitions of the quantum computer concepts are the path to development of scalable quantum parallel algorithms for combinatorial problems solving. Any algorithm can be reduced to a sequence of operations without conditions, because any truth table is a collection of a complete system of conditions-states. Any sequence of actions can always be reduced to one parallel operation. Conditions and sequences arise only when the developer wants to use previously created primitive constructs to build an always non-optimal computing unit. The paradigm of quantum computer creation is determined through the use of photonic transactions on the electrons of an atom may exclude the use of quantum logic. The evolutionary path of a quantum computer from the classical one: “memory-address-transaction” (MAT) → “electron-addresstransaction” → “electron-address-quantaction” (EAQ) → state-superposition-logic. The meeting point of classical and quantum computers is photon transactions on the structure of electrons. Everything that is calculated on a quantum computer can be calculated in parallel on a classical one on account of memory redundancy. The given example is a memory-driven algorithm for modeling digital products based on qubit-vector forms of functionality description for significant performance boost of computing processes by parallel execution of logical operations. Objective. Simulation of the correct SoC-component behavior based on vector representation of the logic. Formation of the triggering development of a computing based on the superposition of the classical, quantum and analog computing process, which in its development should be based on technological qubit, tabular and vector data structures for the parallel solution of combinatorial problems. Method. MAT-computing implements any algorithms on account of transactions (read-write) in memory. Qubit-vector models for describing functionalities, which differ from known truth tables in compactness of description and manufacturability for the implementation of parallel algorithms of the synthesis and analysis of digital devices and SoC-components. Results. 1) The metric of the technological data structures, focused on parallel troubleshooting in digital systems based on the usage of two logical vector operations, was proposed for the first time. 2) The metric of relations between the individual components of QC, allowing organizing a quantum deterministic computer, has been further developed. 3) Quantum architectural solutions, that allow solving coverage problems in a quasi-parallel mode, were proposed for the first time. 4) Architectural solutions based on an analog-to-digital computing, which can be used to solve the problems of the digital systems parallel analysis, have been further developed. 5) Vector-qubit structures of the logic data, that allow a quasi-parallel simulation of digital circuits, were proposed. Conclusions. Qubit models, quantum methods and combinatorial algorithms for technical diagnostics of digital devices have been implemented, which can significantly (up to 25%) reduce the time of test synthesis, deductive modeling of faulty and correct behavior, search for defective states by introducing an innovative idea of using qubit-vector data structures for describing logical components. Comparative assessments of qubit models and methods usage show an increase in the efficiency of algorithms for modeling digital devices compared to tabular ones. The superposition of a classical, quantum and analog computer is integrally represented, which allows to find the best solutions for recognition and decision making.

Radio Electronics Computer Science Control•Dec 4, 2022•2 citations

Quantum memory-driven computing for test synthesis

Vladimir I. Hahanov, Wajeb Gharibi, Eugenia I. Litvinova +2 more

Memory-driven computing for the design and test of digital devices is considered. One of the possible solutions to the problem of design and test theory and methods of quantum memory-driven computing on the classical computers for their subsequent application in all fields of human activity is proposed. Engineering-focused definitions of computing types are presented, including quantum one, which leverages the superposition and entanglement notions, and also memory-driven computing. The necessity of joint and parallel solving the problem of the creation of a market-accessible quantum computer and development of quantum-focused applications and cloud services is explained. Examples of quantum memory-driven design and test of digital circuit fragments are presented. A method for synthesis and minimization test for the black-box functionality, based on a qubit derivative matrix and sequencer for searching a quasioptimum coverage, is proposed.

IEEE East-West Design & Test Symposium (EWDTS)•Sep 1, 2017•14 citations

Chapter 8 Quantum computing in automata theory

G. Ignisha Rajathi, R. Vedhapriyavadhana, R. Niranjana +2 more

In the contemporary era we dwell in, every now and then, new technologies are developed by master brains such as researchers and scientists. This also paves the way to discover replacements to classical computers. One such progression among the great inventions is the essence of quantum computing. They are brought to light for the purpose of solving problems and scenarios solved by classical computers but in a more effective way and in the least span of time. The study of quantum computing focuses on finding new ways to compute by using quantum physics phenomena. A qubit, in contrast to a typical computer bit, can be either 0 or 1, or it can be a superposition of both 0 and 1. Quantum theory commemorates with automata theory, thereby formulating quantum finite automata. Quantum finite automaton, or basically a deterministic finite automaton, is one of the simplest models of computation, which is an input-driven model, which takes an input, and according to the input, we just read the machine, and it changes its state. This proves that any quantum finite automata are completely capable of recognizing languages like Tally with given cut point too. Such languages recognized by a cut point, by quantum finite automata, are called stochastic languages. It further collaborates with the chemical industry with its qubit power over molecular collide, interactive models, and collaborative string processing using nonregular languages.

De Gruyter eBooks•Aug 7, 2023•2 citations

Quantum Digital–Analogue Computing

Vladimir I. Hahanov, Wajeb Gharibi, Mikhail F. Karavay +6 more

Nature is the relations between processes and phenomena. Nothing exists in a Universe without relations. Computing is the transaction of relations between data using control and execution mechanisms. Quantum relations are a superposition of particles and their states. Quantum computing is unconditional transactions of relations between qubit data. Entanglement is a nonlocal superposition of deterministic states. A quantum computer is an analog device for solving combinatorial problems in parallel. Practically focused definitions of the concepts of quantum computing represent a path to the development of scalable quantum parallel algorithms for solving combinatorial problems. Any algorithm can be reduced to a sequence of operations without conditions, because any truth table is a collection of a complete system of conditions-states. Any sequence of actions can always be reduced to one parallel operation. Conditions and sequences arise only when the developer uses previously created primitives-constructs to build an always non-optimal calculator. The deterministic paradigm of creating quantum computing by using photon transactions on the electrons of an atom can exclude the use of quantum logic. The evolutionary path of quantum computing from the classical one: Memory-Address-Transaction (MAT) $\rightarrow$ Electron-Address-Transaction $\rightarrow$Electron-Address-Quantaction (EAQ)$\rightarrow$State-Superposition- Logic. What is calculated on a quantum computer can be calculated in parallel on a classical computer due to the redundancy of memory. MAT-computing implements any algorithms through transactions (read-write) in memory. Qubit-vector models for describing functionalities differ from the known truth tables in terms of compactness of description and technological implementation of parallel algorithms for the synthesis and analysis of digital devices and SoC-components. An example is given – a memory-driven algorithm for simulating digital devices based on qubit-vector forms of describing functionalities for a significant increase in the productivity of computing processes by parallel execution of logical operations. Comparative evaluations of the use of qubit models and methods show an increase in the efficiency of algorithms for simulating digital devices in comparison with tabular ones. The superposition of classical, quantum and analog computing is integrally presented, which makes it possible to search the best solutions for recognition and decision making.

IEEE East-West Design & Test Symposium (EWDTS)•Sep 10, 2021•2 citations
Qubit models and methods for improving the performance of software and hardware for analyzing digital devices through increasing the dimension of the data structures and memory are proposed.The basic concepts, terminology and definitions necessary for the implementation of quantum computing when analyzing virtual computers are introduced.The investigation results concerning design and modeling computer systems in a cyberspace based on the use of two-component structure <memory -transactions> are presented.
Context. Nature is the relation among processes and phenomena. Nothing exists in the universe without relations. Computer is transactions of relations between data with the help of control and execution mechanisms. Quantum relations are a superposition of particles and their states. Superposition and entanglement are equivalent concepts. Entanglement is a non-local superposition of deterministic states. A quantum computer is unconditional transactions of relations between qubit data. Quantum computer is an analog device for parallel solution of combinatorial problems. Practically oriented definitions of the quantum computer concepts are the path to development of scalable quantum parallel algorithms for combinatorial problems solving. Any algorithm can be reduced to a sequence of operations without conditions, because any truth table is a collection of a complete system of conditions-states. Any sequence of actions can always be reduced to one parallel operation. Conditions and sequences arise only when the developer wants to use previously created primitive constructs to build an always non-optimal computing unit. The paradigm of quantum computer creation is determined through the use of photonic transactions on the electrons of an atom may exclude the use of quantum logic. The evolutionary path of a quantum computer from the classical one: “memory-address-transaction” (MAT) → “electron-addresstransaction” → “electron-address-quantaction” (EAQ) → state-superposition-logic. The meeting point of classical and quantum computers is photon transactions on the structure of electrons. Everything that is calculated on a quantum computer can be calculated in parallel on a classical one on account of memory redundancy. The given example is a memory-driven algorithm for modeling digital products based on qubit-vector forms of functionality description for significant performance boost of computing processes by parallel execution of logical operations. Objective. Simulation of the correct SoC-component behavior based on vector representation of the logic. Formation of the triggering development of a computing based on the superposition of the classical, quantum and analog computing process, which in its development should be based on technological qubit, tabular and vector data structures for the parallel solution of combinatorial problems. Method. MAT-computing implements any algorithms on account of transactions (read-write) in memory. Qubit-vector models for describing functionalities, which differ from known truth tables in compactness of description and manufacturability for the implementation of parallel algorithms of the synthesis and analysis of digital devices and SoC-components. Results. 1) The metric of the technological data structures, focused on parallel troubleshooting in digital systems based on the usage of two logical vector operations, was proposed for the first time. 2) The metric of relations between the individual components of QC, allowing organizing a quantum deterministic computer, has been further developed. 3) Quantum architectural solutions, that allow solving coverage problems in a quasi-parallel mode, were proposed for the first time. 4) Architectural solutions based on an analog-to-digital computing, which can be used to solve the problems of the digital systems parallel analysis, have been further developed. 5) Vector-qubit structures of the logic data, that allow a quasi-parallel simulation of digital circuits, were proposed. Conclusions. Qubit models, quantum methods and combinatorial algorithms for technical diagnostics of digital devices have been implemented, which can significantly (up to 25%) reduce the time of test synthesis, deductive modeling of faulty and correct behavior, search for defective states by introducing an innovative idea of using qubit-vector data structures for describing logical components. Comparative assessments of qubit models and methods usage show an increase in the efficiency of algorithms for modeling digital devices compared to tabular ones. The superposition of a classical, quantum and analog computer is integrally represented, which allows to find the best solutions for recognition and decision making.
Memory-driven computing for the design and test of digital devices is considered. One of the possible solutions to the problem of design and test theory and methods of quantum memory-driven computing on the classical computers for their subsequent application in all fields of human activity is proposed. Engineering-focused definitions of computing types are presented, including quantum one, which leverages the superposition and entanglement notions, and also memory-driven computing. The necessity of joint and parallel solving the problem of the creation of a market-accessible quantum computer and development of quantum-focused applications and cloud services is explained. Examples of quantum memory-driven design and test of digital circuit fragments are presented. A method for synthesis and minimization test for the black-box functionality, based on a qubit derivative matrix and sequencer for searching a quasioptimum coverage, is proposed.
In the contemporary era we dwell in, every now and then, new technologies are developed by master brains such as researchers and scientists. This also paves the way to discover replacements to classical computers. One such progression among the great inventions is the essence of quantum computing. They are brought to light for the purpose of solving problems and scenarios solved by classical computers but in a more effective way and in the least span of time. The study of quantum computing focuses on finding new ways to compute by using quantum physics phenomena. A qubit, in contrast to a typical computer bit, can be either 0 or 1, or it can be a superposition of both 0 and 1. Quantum theory commemorates with automata theory, thereby formulating quantum finite automata. Quantum finite automaton, or basically a deterministic finite automaton, is one of the simplest models of computation, which is an input-driven model, which takes an input, and according to the input, we just read the machine, and it changes its state. This proves that any quantum finite automata are completely capable of recognizing languages like Tally with given cut point too. Such languages recognized by a cut point, by quantum finite automata, are called stochastic languages. It further collaborates with the chemical industry with its qubit power over molecular collide, interactive models, and collaborative string processing using nonregular languages.
Nature is the relations between processes and phenomena. Nothing exists in a Universe without relations. Computing is the transaction of relations between data using control and execution mechanisms. Quantum relations are a superposition of particles and their states. Quantum computing is unconditional transactions of relations between qubit data. Entanglement is a nonlocal superposition of deterministic states. A quantum computer is an analog device for solving combinatorial problems in parallel. Practically focused definitions of the concepts of quantum computing represent a path to the development of scalable quantum parallel algorithms for solving combinatorial problems. Any algorithm can be reduced to a sequence of operations without conditions, because any truth table is a collection of a complete system of conditions-states. Any sequence of actions can always be reduced to one parallel operation. Conditions and sequences arise only when the developer uses previously created primitives-constructs to build an always non-optimal calculator. The deterministic paradigm of creating quantum computing by using photon transactions on the electrons of an atom can exclude the use of quantum logic. The evolutionary path of quantum computing from the classical one: Memory-Address-Transaction (MAT) →\rightarrow→ Electron-Address-Transaction →\rightarrow→Electron-Address-Quantaction (EAQ)→\rightarrow→State-Superposition- Logic. What is calculated on a quantum computer can be calculated in parallel on a classical computer due to the redundancy of memory. MAT-computing implements any algorithms through transactions (read-write) in memory. Qubit-vector models for describing functionalities differ from the known truth tables in terms of compactness of description and technological implementation of parallel algorithms for the synthesis and analysis of digital devices and SoC-components. An example is given – a memory-driven algorithm for simulating digital devices based on qubit-vector forms of describing functionalities for a significant increase in the productivity of computing processes by parallel execution of logical operations. Comparative evaluations of the use of qubit models and methods show an increase in the efficiency of algorithms for simulating digital devices in comparison with tabular ones. The superposition of classical, quantum and analog computing is integrally presented, which makes it possible to search the best solutions for recognition and decision making.