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

Journal of Advanced Computational Intelligence and Intelligent Informatics

Emulating Qubits with Fuzzy Logic

M. Skander Hannachi, Yutaka Hatakeyama, Kaoru Hirota

Published Feb 20, 2007• 18 citations
Publisher

Abstract

An approach for emulating quantum circuits using conventional analog hardware is presented based on the intuitive similarity between fuzzy logic and quantum superposition, as well as some geometrical analogies. This approach has the advantage of being easy to implement on dedicated hardware for parallel processing of membership functions and fuzzy inference, compared to conventional quantum computing, which requires quantum mechanical systems which are extremely sensitive to noise and difficult to extend to large scale systems. Using geometrical analogies and a suitable transformation, qubits are modeled as pairs of fuzzy membership functions evolving on the unit square and basic one qubit gates are modeled as transformations on this unit square. A fuzzy implementation of the one bit and two bit Deutsch-Jozsa algorithm is proposed. Physical implementation and advantages, such as the possibility of implementing nonlinear or non-unitary gates, as well as drawbacks of the proposed model compared to conventional quantum computing are shown.

DOI
10.20965/jaciii.2007.p0242

Related papers

Emulating Quantum Interference and Quantum Associative Memory Using Fuzzy Qubits

M. Skander Hannachi, Fangyan Dong, Kaoru Hirota

The concept of fuzzy qubit is proposed as an approach to emulating quantum interference using fuzzy logic. This makes it possible to implement certain quantum computing algorithms, especially quantum associative memory, on hardware dedicated to fuzzy logic. The fuzzy qubit model is briefly reviewed and the fuzzy implementation of basic 1 and 2 qubit gates, such as Hadamard or C-not gates, is presented. The possibility of emulating quantum algorithms is discussed. Then quantum associative memory is presented and its implementation using the fuzzy qubit model is discussed. The advantages over the previous associative memory models, both quantum and classical, are discussed.

IEEE International Conference on Computational Cybernetics (ICCC)•Oct 1, 2007•6 citations

Fuzzy Tsetlin automata and their application in analog computing

Eugene Kagan, Alexander Rybalov

Abstract In the paper we suggest a system of fuzzy Tsetlin automata for analog computations. The system deals with fuzzy analogs of qubits and models operations of quantum gates used for quantum computations. In contrast to the existing models, the suggested system directly emulates reversible operators and the “square root of not” operator which is a key operator in quantum computations. Fuzzy information units called f-bits are defined by matrix with fuzzy normalized rows and emulate qubits with complex elements. Operations with these units are conducted by fuzzy Tsetlin automata based on the uninorm and absorbing norm. It is demonstrated that the suggested system emulates basic quantum computations; hence, it can implement analog computations and can support analog emulations of quantum algorithms.

Soft Computing•Apr 29, 2026•0 citations

Fuzzy Computing from Quantum Computing - Case Study in Reichenbach Implication Class

Adriano Maron, Lidiane Visintin, Renata Reiser +1 more

This paper shows that quantum computing extends the class of fuzzy sets, taking advantage of properties such as quantum parallelism. The central idea associates the states of a quantum register with membership functions of fuzzy subsets, and the rules for the processes of fuzzyfication are performed by unitary quantum transformations. Besides studying the construction of logical operators, such as negation, using quantum, this paper also introduces the definition of t-norms and t-conorms based on unitary and controlled quantum gates. Such constructors allow modelling and interpreting union, intersection and difference between fuzzy sets. As the main contribution, an interpretation for the Reichenbach implication from quantum computing is obtained. An evaluation of the corresponding computation is implemented and simulated in the VPE-qGM visual programming environment.

•Jan 1, 2013•4 citations

On the Use of Fuzzy Logic for Inherently Parallel Computations

M. Skander Hannachi, Fangyan Dong, Yutaka Hatakeyama +1 more

The possibility of using fuzzy logic for performing parallel computation is introduced. An analogy is drawn between non-deterministic models of computing and fuzzy computing. In practice this can be implemented using strings of fuzzy bits, which can represent a "superposition" of several crisp bit strings. Thus, using fuzzy logic and analog fuzzy hardware, inherently single instruction multiple data parallel computing can be achieved. The possibility of speeding up computations using oracle machines using the proposed concept is examined. As a proof of concept, the rapid solution to Deutsch's problem is presented.

International Symposium on Computational Intelligence and Intelligent Informatics (ISCIII)•Mar 1, 2007•4 citations

Emulation of Quantum Algorithms Using CMOS Analog Circuits

Sharan Mourya, Brian R. La Cour, Bibhu Datta Sahoo

Quantum computers are regarded as the future of computing, as they are believed to be capable of solving extremely complex problems that are intractable on conventional digital computers. However, near-term quantum computers are prone to a plethora of noise sources that are difficult to mitigate, possibly limiting their scalability and precluding us from running any useful algorithms. Quantum emulation is an alternative approach that uses classical analog hardware to emulate the properties of superposition and entanglement, thereby mimicking quantum parallelism to attain similar speeds. By contrast, the use of classical digital hardware, such as field programmable gate arrays (FPGA), is less inefficient at emulating a quantum computer, as it does not take advantage of the fundamentally analog nature of quantum states. Consequently, this approach adds an inherent hardware overhead that also prevents scaling. In this work, an energy-efficient quantum emulator based on analog circuits realized in UMC 180-nm CMOS technology is proposed along with the design methodologies for a scalable computing architecture. A six-fold improvement in power consumption was observed over the FPGA-based approach for a ten-qubit emulation of Grover's search algorithm. The proposed emulator is also about 400 times faster than a Ryzen 5600x six-core processor performing a simulation of six-qubit Grover's search algorithm

IEEE Transactions on Quantum Engineering•Jan 1, 2023•15 citations

Quantum fuzzy logic for edge detection: A demonstration on NISQ hardware

G. Nunziata, Serena Crisci, G. De Gregorio +4 more

Quantum computing offers the potential to enhance computational efficiency beyond classical methods, but practical implementation remains challenging due to the limitations of Noisy Intermediate-Scale Quantum (NISQ) hardware, namely, restricted qubit counts, limited connectivity, and the presence of noise and decoherence. This study presents a novel approach to edge detection by leveraging a recently developed Quantum Fuzzy Inference Engine, implemented on a NISQ device. We introduce an optimized quantum circuit for its implementation, reducing qubit requirements and gate depth to improve execution on NISQ hardware. To overcome constraints related to large-scale image processing, a hybrid quantum–classical lookup table approach is employed. Edge detection performance is evaluated on the Berkeley Segmentation Data Set and Benchmarks 500 dataset under different conditions, including classical execution, ideal quantum simulation, noisy quantum simulation, and NISQ hardware calculation. Results demonstrate that the quantum fuzzy logic-based edge detection achieves outcomes comparable to classical methods by using fewer operations, marking a step toward practical quantum-enhanced image processing.

Applied Soft Computing•Sep 10, 2025•5 citations
An approach for emulating quantum circuits using conventional analog hardware is presented based on the intuitive similarity between fuzzy logic and quantum superposition, as well as some geometrical analogies. This approach has the advantage of being easy to implement on dedicated hardware for parallel processing of membership functions and fuzzy inference, compared to conventional quantum computing, which requires quantum mechanical systems which are extremely sensitive to noise and difficult to extend to large scale systems. Using geometrical analogies and a suitable transformation, qubits are modeled as pairs of fuzzy membership functions evolving on the unit square and basic one qubit gates are modeled as transformations on this unit square. A fuzzy implementation of the one bit and two bit Deutsch-Jozsa algorithm is proposed. Physical implementation and advantages, such as the possibility of implementing nonlinear or non-unitary gates, as well as drawbacks of the proposed model compared to conventional quantum computing are shown.
The concept of fuzzy qubit is proposed as an approach to emulating quantum interference using fuzzy logic. This makes it possible to implement certain quantum computing algorithms, especially quantum associative memory, on hardware dedicated to fuzzy logic. The fuzzy qubit model is briefly reviewed and the fuzzy implementation of basic 1 and 2 qubit gates, such as Hadamard or C-not gates, is presented. The possibility of emulating quantum algorithms is discussed. Then quantum associative memory is presented and its implementation using the fuzzy qubit model is discussed. The advantages over the previous associative memory models, both quantum and classical, are discussed.
Abstract In the paper we suggest a system of fuzzy Tsetlin automata for analog computations. The system deals with fuzzy analogs of qubits and models operations of quantum gates used for quantum computations. In contrast to the existing models, the suggested system directly emulates reversible operators and the “square root of not” operator which is a key operator in quantum computations. Fuzzy information units called f-bits are defined by matrix with fuzzy normalized rows and emulate qubits with complex elements. Operations with these units are conducted by fuzzy Tsetlin automata based on the uninorm and absorbing norm. It is demonstrated that the suggested system emulates basic quantum computations; hence, it can implement analog computations and can support analog emulations of quantum algorithms.
This paper shows that quantum computing extends the class of fuzzy sets, taking advantage of properties such as quantum parallelism. The central idea associates the states of a quantum register with membership functions of fuzzy subsets, and the rules for the processes of fuzzyfication are performed by unitary quantum transformations. Besides studying the construction of logical operators, such as negation, using quantum, this paper also introduces the definition of t-norms and t-conorms based on unitary and controlled quantum gates. Such constructors allow modelling and interpreting union, intersection and difference between fuzzy sets. As the main contribution, an interpretation for the Reichenbach implication from quantum computing is obtained. An evaluation of the corresponding computation is implemented and simulated in the VPE-qGM visual programming environment.
The possibility of using fuzzy logic for performing parallel computation is introduced. An analogy is drawn between non-deterministic models of computing and fuzzy computing. In practice this can be implemented using strings of fuzzy bits, which can represent a "superposition" of several crisp bit strings. Thus, using fuzzy logic and analog fuzzy hardware, inherently single instruction multiple data parallel computing can be achieved. The possibility of speeding up computations using oracle machines using the proposed concept is examined. As a proof of concept, the rapid solution to Deutsch's problem is presented.
Quantum computers are regarded as the future of computing, as they are believed to be capable of solving extremely complex problems that are intractable on conventional digital computers. However, near-term quantum computers are prone to a plethora of noise sources that are difficult to mitigate, possibly limiting their scalability and precluding us from running any useful algorithms. Quantum emulation is an alternative approach that uses classical analog hardware to emulate the properties of superposition and entanglement, thereby mimicking quantum parallelism to attain similar speeds. By contrast, the use of classical digital hardware, such as field programmable gate arrays (FPGA), is less inefficient at emulating a quantum computer, as it does not take advantage of the fundamentally analog nature of quantum states. Consequently, this approach adds an inherent hardware overhead that also prevents scaling. In this work, an energy-efficient quantum emulator based on analog circuits realized in UMC 180-nm CMOS technology is proposed along with the design methodologies for a scalable computing architecture. A six-fold improvement in power consumption was observed over the FPGA-based approach for a ten-qubit emulation of Grover's search algorithm. The proposed emulator is also about 400 times faster than a Ryzen 5600x six-core processor performing a simulation of six-qubit Grover's search algorithm
Quantum computing offers the potential to enhance computational efficiency beyond classical methods, but practical implementation remains challenging due to the limitations of Noisy Intermediate-Scale Quantum (NISQ) hardware, namely, restricted qubit counts, limited connectivity, and the presence of noise and decoherence. This study presents a novel approach to edge detection by leveraging a recently developed Quantum Fuzzy Inference Engine, implemented on a NISQ device. We introduce an optimized quantum circuit for its implementation, reducing qubit requirements and gate depth to improve execution on NISQ hardware. To overcome constraints related to large-scale image processing, a hybrid quantum–classical lookup table approach is employed. Edge detection performance is evaluated on the Berkeley Segmentation Data Set and Benchmarks 500 dataset under different conditions, including classical execution, ideal quantum simulation, noisy quantum simulation, and NISQ hardware calculation. Results demonstrate that the quantum fuzzy logic-based edge detection achieves outcomes comparable to classical methods by using fewer operations, marking a step toward practical quantum-enhanced image processing.