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

IEEE International Conference on Advanced Trends in Radioelectronics, Telecommunications and Computer Engineering (TCSET)

Methods for quantum analysis of digital circuits

Vladimir I. Hahanov, Eugenia I. Litvinova, Svetlana V. Chumachenko, Ivan Hahanov, Anastasia Hahanova

Published Feb 1, 2018• 3 citations
Publisher

Abstract

The memory-driven innovative architecture of logic-free quantum computing is presented, which is characterized by the use of photon read-write transactions in the structure of electrons associated with superposition and entanglement of states. The quantum methods for parallel analysis, diagnosis of digital circuits and solving the coverage problem based on the use of qubit data structures are proposed.

DOI
10.1109/tcset.2018.8336317

Related papers

Quantum Mem-Computing for Design and Test

Vladimir I. Hahanov, Wajeb Gharibi, Mykhailo Liubarskyi +4 more

Cyberculture of quantum memory-driven computing integrates emerging technologies of parallel solution for time-consuming combinatorial problems. A scalable map of research relevant to quantum cyberculture is aimed at creating parallel algorithms for SoC Design and Test. The memory-driven innovation architecture of quantum computing is presented, which is defined by the leverage of photon read-write transactions on the structure of electrons in the absence of logic, associated with superposition and entanglement. A class of logical X-functions and their qubit models is introduced, that are technologically feasible for test, diagnosis, and fault simulation of SoC components. The architecture of services for design, test and verification of digital devices based on qubit models of logical primitives is described. A service for fault-free circuits simulation based on the qubit coverage of functional primitives is given. The models, cubit data structures and methods are focused and simulated on the classical computers by leveraging unitary coding binary states.

IEEE Globecom Workshops (GC Wkshps)•Dec 1, 2018•6 citations

Architectures of Quantum Memory-driven Computing

Vladimir I. Hahanov, Svetlana V. Chumachenko, Eugenia I. Litvinova +1 more

Cyberculture of quantum memory-driven computing integrates emerging technologies of parallel solution for time-consuming combinatorial problems, which eliminates transactions between memory and ALU-processor. A scalable map of research relevant to quantum cyberculture is aimed at creating parallel algorithms for SoC Design and Test. The innovative proposal in terms of quantum memory-driven computing architecture is represented, that is based on the leverage of photon transactions on the electron structure where read-write operations are fulfilled in the absence of logic, corresponds to entanglement and superposition commands.

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

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 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

Quantum Models and Method for Analysis and Testing Computing Systems

Vladimir I. Hahanov, S. Hyduke, Wajeb Gharibi +3 more

Matrix method for quantum diagnosing functional failures and stuck-at faults in software or hardware units is proposed. It is based on qubit data structures comprising diagnostic information, which allows significantly reducing the computational complexity of the simulation and diagnosis due to the introduction of parallel logical operations on the matrix data. The quantum method for fault-free simulating digital units with the possibility of online repair of digital system components is presented. It is characterized by significantly improved performance due to addressed processing procedure of the functional primitives, defined by Q-coverages.

International Conference on Information Technology: New Generations•Apr 1, 2014•19 citations

Qubit-driven Fault Simulation

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

Quantum data structures, methods, algorithms and software applications for parallel solution of combinatorial problems, including design and test, on classical computers by using extra memory are proposed. Quantum models and methods for design and test of specific logic functionalities are developed based on the use of vector qubit data structures and memory-driven architectures for parallel computing algorithms, in order to significantly improve the performance of testing and deductive simulation of digital systems-on-chips. A new quantum method of test generation for single stuck-at faults of logic functions through taking Boolean derivatives with respect to their qubit coverages is proposed. The quantum method of deductive simulation of stuck-at faults of logical functions through the synthesis of matrices of Boolean derivatives with respect to their qubit coverage has been developed. The performance of methods for test synthesis and their analysis has no analogues in algorithmic performance.

IEEE Latin American Test Symposium (LATS)•Mar 1, 2019•25 citations
The memory-driven innovative architecture of logic-free quantum computing is presented, which is characterized by the use of photon read-write transactions in the structure of electrons associated with superposition and entanglement of states. The quantum methods for parallel analysis, diagnosis of digital circuits and solving the coverage problem based on the use of qubit data structures are proposed.
Cyberculture of quantum memory-driven computing integrates emerging technologies of parallel solution for time-consuming combinatorial problems. A scalable map of research relevant to quantum cyberculture is aimed at creating parallel algorithms for SoC Design and Test. The memory-driven innovation architecture of quantum computing is presented, which is defined by the leverage of photon read-write transactions on the structure of electrons in the absence of logic, associated with superposition and entanglement. A class of logical X-functions and their qubit models is introduced, that are technologically feasible for test, diagnosis, and fault simulation of SoC components. The architecture of services for design, test and verification of digital devices based on qubit models of logical primitives is described. A service for fault-free circuits simulation based on the qubit coverage of functional primitives is given. The models, cubit data structures and methods are focused and simulated on the classical computers by leveraging unitary coding binary states.
Cyberculture of quantum memory-driven computing integrates emerging technologies of parallel solution for time-consuming combinatorial problems, which eliminates transactions between memory and ALU-processor. A scalable map of research relevant to quantum cyberculture is aimed at creating parallel algorithms for SoC Design and Test. The innovative proposal in terms of quantum memory-driven computing architecture is represented, that is based on the leverage of photon transactions on the electron structure where read-write operations are fulfilled in the absence of logic, corresponds to entanglement and superposition commands.
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.
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.
Matrix method for quantum diagnosing functional failures and stuck-at faults in software or hardware units is proposed. It is based on qubit data structures comprising diagnostic information, which allows significantly reducing the computational complexity of the simulation and diagnosis due to the introduction of parallel logical operations on the matrix data. The quantum method for fault-free simulating digital units with the possibility of online repair of digital system components is presented. It is characterized by significantly improved performance due to addressed processing procedure of the functional primitives, defined by Q-coverages.
Quantum data structures, methods, algorithms and software applications for parallel solution of combinatorial problems, including design and test, on classical computers by using extra memory are proposed. Quantum models and methods for design and test of specific logic functionalities are developed based on the use of vector qubit data structures and memory-driven architectures for parallel computing algorithms, in order to significantly improve the performance of testing and deductive simulation of digital systems-on-chips. A new quantum method of test generation for single stuck-at faults of logic functions through taking Boolean derivatives with respect to their qubit coverages is proposed. The quantum method of deductive simulation of stuck-at faults of logical functions through the synthesis of matrices of Boolean derivatives with respect to their qubit coverage has been developed. The performance of methods for test synthesis and their analysis has no analogues in algorithmic performance.