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 Transactions on Fuzzy Systems

Parallelization of a fuzzy control algorithm using quantum computation

Gerasimos G. Rigatos, Spyros G. Tzafestaş

Published Aug 1, 2002• 59 citations
Publisher

Abstract

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.

DOI
10.1109/tfuzz.2002.800690

Related papers

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

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

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

A Comparison of Quantum Computer Architectures in Running Fuzzy Inference Engines

Giovanni Acampora, Michele Grossi, Roberto Schiattarella

The increasing need to work in environments characterized by a large number of variables and data is driving the development of ad hoc fuzzy reasoners. Recently, the first quantum fuzzy inference engine (QFIE) has been proposed to evaluate fuzzy rules in parallel on quantum computers, whose design hardware is based on different technologies such as superconductors, photonics, trap-ion, cold atoms, and so on. Although the theoretical potential of this approach is very promising, its practical usage is still limited by the current quantum hardware, in term of dimension and noise. This paper attempts to bridge this theoretical/practical gap and pave the way for the execution of fuzzy rule-based systems on real quantum hardware by presenting a comparative study between two of the most promising quantum computing platforms, superconducting and trap-ion devices. The comparison is carried out by using QFIE for the control of a simulated particle accelerator system inspired by a real facility at the European Organization for Nuclear Research (CERN). The result of this original study allow to establish the ideal running backend for the practical use case of quantum fuzzy systems.

IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)•Aug 13, 2023•1 citation
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.
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.
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.
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 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.
The increasing need to work in environments characterized by a large number of variables and data is driving the development of ad hoc fuzzy reasoners. Recently, the first quantum fuzzy inference engine (QFIE) has been proposed to evaluate fuzzy rules in parallel on quantum computers, whose design hardware is based on different technologies such as superconductors, photonics, trap-ion, cold atoms, and so on. Although the theoretical potential of this approach is very promising, its practical usage is still limited by the current quantum hardware, in term of dimension and noise. This paper attempts to bridge this theoretical/practical gap and pave the way for the execution of fuzzy rule-based systems on real quantum hardware by presenting a comparative study between two of the most promising quantum computing platforms, superconducting and trap-ion devices. The comparison is carried out by using QFIE for the control of a simulated particle accelerator system inspired by a real facility at the European Organization for Nuclear Research (CERN). The result of this original study allow to establish the ideal running backend for the practical use case of quantum fuzzy systems.