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 Symposium on Computational Intelligence and Intelligent Informatics (ISCIII)

On the Use of Fuzzy Logic for Inherently Parallel Computations

M. Skander Hannachi, Fangyan Dong, Yutaka Hatakeyama, Kaoru Hirota

Published Mar 1, 2007• 4 citations
Publisher

Abstract

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.

DOI
10.1109/isciii.2007.367368

Related papers

Emulating Qubits with Fuzzy Logic

M. Skander Hannachi, Yutaka Hatakeyama, Kaoru Hirota

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.

Journal of Advanced Computational Intelligence and Intelligent Informatics•Feb 20, 2007•18 citations

Fuzzy Logic on Quantum Annealers

Amir Pourabdollah, Giovanni Acampora, Roberto Schiattarella

Quantum computation is going to revolutionize the world of computing by enabling the design of massive parallel algorithms that solve hard problems in an efficient way, thanks to the exploitation of quantum mechanics effects, such as superposition, entanglement, and interference. These computational improvements could strongly influence the way how fuzzy systems are designed and used in contexts, such as Big Data, where computational efficiency represents a nonnegligible constraint to be taken into account. In order to pave the way toward this innovative scenario, this article introduces a novel representation of fuzzy sets and operators based on quadratic unconstrained binary optimization problems, so as to enable the implementation of fuzzy inference engines on a type of quantum computers known as quantum annealers.

IEEE Transactions on Fuzzy Systems•Sep 20, 2021•27 citations

Parallelization of a fuzzy control algorithm using quantum computation

Gerasimos G. Rigatos, Spyros G. Tzafestaş

Quantum computation is proposed for the parallelization of a fuzzy logic control (FLC) algorithm. Quantum computation speeds up the fuzzy inference since serial operations between matrices of large dimensionality are now replaced by a one-step quantum addition or a quantum subtraction. The unitarity properties of the algorithm prove that the FLC stands for a simulator of a quantum computing machine.

IEEE Transactions on Fuzzy Systems•Aug 1, 2002•59 citations

Quantum State Superposition for Parallel Data Processing

Jincheng Zhang

This paper explores the potential of utilizing quantum state superposition for parallel data processing, aiming to enhance data processing speeds. The core claim rests on leveraging the inherent parallelism offered by superposition, where data is encoded into a quantum state. This encoded state then undergoes processing by a quantum computer, exploiting its parallel computational capabilities. The proposed mechanism represents a novel approach to data handling, specifically targeting applications demanding high computational throughput. The research investigates the theoretical framework and potential benefits of this paradigm, laying a foundation for future explorations in quantum-enhanced data processing. The primary focus is on conceptualization and outlining the possibilities rather than practical implementation due to the current limitations of quantum computing hardware. ---

•Sep 1, 2026•0 citations

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

On the Implementation of Fuzzy Inference Engines on Quantum Computers

Giovanni Acampora, Roberto Schiattarella, Autilia Vitiello

Quantum computers can be a revolutionary tool to implement inference engines for fuzzy rule-based systems. In fact, the use of quantum mechanical principles can enable parallel execution of fuzzy rules and allow them to be used efficiently in complex contexts such as distributed and big data environments. This article introduces the very first quantum-based fuzzy inference engine that is capable of providing exponential acceleration in fuzzy rule execution compared to its classical counterpart, and allows a quantum computer to be programmed by fuzzy linguistic rules. The proposed inference engine was implemented using a quantum algorithm design scheme based on the oracle notion. This scheme allows the modeling of a fuzzy rule-based system as a Boolean function, the oracle, which is able to reconstruct the relationships between the antecedent and consequent parts of fuzzy rules, and can be efficiently computed on a quantum computer. The suitability of the proposed quantum algorithm for use as a fuzzy inference engine was tested in a typical benchmark scenario, such as that provided by inverted pendulum control.

IEEE Transactions on Fuzzy Systems•Aug 29, 2022•47 citations
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.
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.
Quantum computation is going to revolutionize the world of computing by enabling the design of massive parallel algorithms that solve hard problems in an efficient way, thanks to the exploitation of quantum mechanics effects, such as superposition, entanglement, and interference. These computational improvements could strongly influence the way how fuzzy systems are designed and used in contexts, such as Big Data, where computational efficiency represents a nonnegligible constraint to be taken into account. In order to pave the way toward this innovative scenario, this article introduces a novel representation of fuzzy sets and operators based on quadratic unconstrained binary optimization problems, so as to enable the implementation of fuzzy inference engines on a type of quantum computers known as quantum annealers.
This paper explores the potential of utilizing quantum state superposition for parallel data processing, aiming to enhance data processing speeds. The core claim rests on leveraging the inherent parallelism offered by superposition, where data is encoded into a quantum state. This encoded state then undergoes processing by a quantum computer, exploiting its parallel computational capabilities. The proposed mechanism represents a novel approach to data handling, specifically targeting applications demanding high computational throughput. The research investigates the theoretical framework and potential benefits of this paradigm, laying a foundation for future explorations in quantum-enhanced data processing. The primary focus is on conceptualization and outlining the possibilities rather than practical implementation due to the current limitations of quantum computing hardware. ---
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.
Quantum computers can be a revolutionary tool to implement inference engines for fuzzy rule-based systems. In fact, the use of quantum mechanical principles can enable parallel execution of fuzzy rules and allow them to be used efficiently in complex contexts such as distributed and big data environments. This article introduces the very first quantum-based fuzzy inference engine that is capable of providing exponential acceleration in fuzzy rule execution compared to its classical counterpart, and allows a quantum computer to be programmed by fuzzy linguistic rules. The proposed inference engine was implemented using a quantum algorithm design scheme based on the oracle notion. This scheme allows the modeling of a fuzzy rule-based system as a Boolean function, the oracle, which is able to reconstruct the relationships between the antecedent and consequent parts of fuzzy rules, and can be efficiently computed on a quantum computer. The suitability of the proposed quantum algorithm for use as a fuzzy inference engine was tested in a typical benchmark scenario, such as that provided by inverted pendulum control.