TY - GEN
T1 - Quantum Digital-Analogue Computing
AU - Hahanov, Vladimir
AU - Gharibi, Wajeb
AU - Karavay, Mikhail
AU - Man, Ka Lok
AU - Chumachenko, Svetlana
AU - Litvinova, Eugenia
AU - Salih, Tariq Hama
AU - Devadze, David
AU - Hahanov, Ivan
N1 - Publisher Copyright:
© 2021 IEEE.
PY - 2021/9/10
Y1 - 2021/9/10
N2 - 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) Electron-Address-Transaction Electron-Address-Quantaction (EAQ) 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.
AB - 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) Electron-Address-Transaction Electron-Address-Quantaction (EAQ) 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.
KW - Electron-Address- Quantaction
KW - Memory-Address-Transaction
KW - digital systems-on-chips
KW - matrix data structures
KW - quantum determinism
KW - quantum digital-analog computing
KW - quantum transactions on the structure of electrons
KW - qubit vectors
UR - http://www.scopus.com/inward/record.url?scp=85119004226&partnerID=8YFLogxK
U2 - 10.1109/EWDTS52692.2021.9581044
DO - 10.1109/EWDTS52692.2021.9581044
M3 - Conference Proceeding
AN - SCOPUS:85119004226
T3 - 2021 IEEE East-West Design and Test Symposium, EWDTS 2021 - Proceedings
BT - 2021 IEEE East-West Design and Test Symposium, EWDTS 2021 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2021 IEEE East-West Design and Test Symposium, EWDTS 2021
Y2 - 10 September 2021 through 13 September 2021
ER -