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 Congress on Evolutionary Computation (CEC)

A Hybrid Classical–Quantum Formulation of Fuzzy CRI Inference with a Triage Case Study

Cecília Botelho, Eduardo Buss, Adenauer Yamin, Renata Reiser, Hélida Santos, Giancarlo Lucca

Published Jun 1, 2026• 0 citations
Publisher

Abstract

Fuzzy rule-based systems are commonly employed in decision support due to their interpretability under uncertainty, yet their implementation in quantum computing remains largely unexplored. This work proposes a hybrid fuzzy–quantum framework that maps the Compositional Rule of Inference (CRI) into an executable quantum circuit. Fuzzy inputs and rule relations are encoded using amplitude-based representations, while relational composition and aggregation are implemented through controlled quantum operations. The approach is demonstrated in a triage decision-support scenario combining quantum aggregation with priority-based inference. By preserving fuzzy semantics within a structured quantum circuit, this work provides a practical pathway for quantum-enhanced decision systems.

DOI
10.1109/cec69861.2026.11727106

Related papers

Quantum Fuzzy Cognitive Maps: A Step Forward

Τheofanis Kalampokas, George A. Papakostas

As Quantum Machine Learning (QML) continues to mature, there is an increasing demand for novel architectures that broaden the ways quantum models learn from data, represent knowledge, and perform inference. In this work, we address this need by introducing a hybrid Quantum Fuzzy Cognitive Map (QFCM) model for pattern recognition, in which the core arithmetic operations of the classical Fuzzy Cognitive Map (FCM) inference mechanism are replaced by a parameterized quantum circuit. The proposed model preserves the structural foundations and causal inference principles of classical FCMs, while leveraging quantum computation to model and process interactions among concepts. The proposed QFCM was evaluated on six benchmark datasets, demonstrating competitive performance and achieving a 9.37% increase in prediction confidence compared to the classical FCM. Overall, this work contributes to the growing QML ecosystem by embedding the fundamental principles of FCMs into a quantum circuit–based formulation, thereby extending their representational and computational capabilities.

IEEE Access•Jan 1, 2026•1 citation

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

Fuzzy Inference on Quantum Annealers

Amir Pourabdollah, Colin Wilmott, Roberto Schiattarella +1 more

Quantum computers can potentially perform certain types of optimisation problems much more efficiently than classical computers, making them a promising tool for solving complex fuzzy logic problems. In two recent developments, based on solving Quadratic Unconstrained Binary Optimization (QUBO) problems on a type of quantum computers known as quantum annealers, we have introduced novel representations of a) fuzzy sets; b) implementations of some basic fuzzy logic operators (union, intersection, alpha-cut and maximum) and; c) the centroid defuzzification. In this paper, the previous works are further extended by presenting an implementation of Mamdani inference on the quantum annealer machines. We first present how the fuzzy rules can be formulated for such an implementation, then we present how to cascade different quantum-fuzzy operators in order to implement the quantum-fuzzy inference, and finally, a sample implementation of the inference on a real quantum computer is demonstrated. Having the main components of a rule-based fuzzy logic system implemented on quantum computers, this paper provides an integrated solution for implementing a whole fuzzy rule-based system on quantum computers.

IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)•Aug 13, 2023•4 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 Extended Epistemic Framework Beyond Probability for Quantum Information Processing with Applications in Security, Artificial Intelligence, and Financial Computing

Gerardo Iovane

In this work, we propose a novel quantum-informed epistemic framework that extends the classical notion of probability by integrating plausibility, credibility, and possibility as distinct yet complementary measures of uncertainty. This enriched quadruple (P, Pl, Cr, Ps) enables a deeper characterization of quantum systems and decision-making processes under partial, noisy, or ambiguous information. Our formalism generalizes the Born rule within a multi-valued logic structure, linking Positive Operator-Valued Measures (POVMs) with data-driven plausibility estimators, agent-based credibility priors, and fuzzy-theoretic possibility functions. We develop a hybrid classical-quantum inference engine that computes a vectorial aggregation of the quadruples, enhancing robustness and semantic expressivity in contexts where classical probability fails to capture non-Kolmogorovian phenomena such as entanglement, contextuality, or decoherence. The approach is validated through three real-world application domains-quantum cybersecurity, quantum AI, and financial computing-where the proposed model outperforms standard probabilistic reasoning in terms of accuracy, resilience to noise, interpretability, and decision stability. Comparative analysis against QBism, Dempster-Shafer, and fuzzy quantum logic further demonstrates the uniqueness of architecture in both operational semantics and practical outcomes. This contribution lays the groundwork for a new theory of epistemic quantum computing capable of modelling and acting under uncertainty beyond traditional paradigms.

Entropy•Sep 18, 2025•2 citations

Quantum Circuit Reasoning Models: A Variational Framework for Differentiable Logical Inference

Andrew Kiruluta

This report introduces a novel class of reasoning architectures, termed Quantum Circuit Reasoning Models (QCRM), which extend the concept of Variational Quantum Circuits (VQC) from energy minimization and classification tasks to structured logical inference and reasoning. We posit that fundamental quantum mechanical operations, superposition, entanglement, interference, and measurement, naturally map to essential reasoning primitives such as hypothesis branching, constraint propagation, consistency enforcement, and decision making. The resulting framework combines quantum-inspired computation with differentiable optimization, enabling reasoning to emerge as a process of amplitude evolution and interference-driven selection of self-consistent states. We develop the mathematical foundation of QCRM, define its parameterized circuit architecture, and show how logical rules can be encoded as unitary transformations over proposition-qubit states. We further formalize a training objective grounded in classical gradient descent over circuit parameters and discuss simulation-based implementations on classical hardware. Finally, we propose the Quantum Reasoning Layer (QRL) as a differentiable hybrid component for composable reasoning models applicable to scientific, biomedical, and chemical inference domains.

quant-pharXiv:2512.07871•Nov 28, 2025•1 citation
Fuzzy rule-based systems are commonly employed in decision support due to their interpretability under uncertainty, yet their implementation in quantum computing remains largely unexplored. This work proposes a hybrid fuzzy–quantum framework that maps the Compositional Rule of Inference (CRI) into an executable quantum circuit. Fuzzy inputs and rule relations are encoded using amplitude-based representations, while relational composition and aggregation are implemented through controlled quantum operations. The approach is demonstrated in a triage decision-support scenario combining quantum aggregation with priority-based inference. By preserving fuzzy semantics within a structured quantum circuit, this work provides a practical pathway for quantum-enhanced decision systems.
As Quantum Machine Learning (QML) continues to mature, there is an increasing demand for novel architectures that broaden the ways quantum models learn from data, represent knowledge, and perform inference. In this work, we address this need by introducing a hybrid Quantum Fuzzy Cognitive Map (QFCM) model for pattern recognition, in which the core arithmetic operations of the classical Fuzzy Cognitive Map (FCM) inference mechanism are replaced by a parameterized quantum circuit. The proposed model preserves the structural foundations and causal inference principles of classical FCMs, while leveraging quantum computation to model and process interactions among concepts. The proposed QFCM was evaluated on six benchmark datasets, demonstrating competitive performance and achieving a 9.37% increase in prediction confidence compared to the classical FCM. Overall, this work contributes to the growing QML ecosystem by embedding the fundamental principles of FCMs into a quantum circuit–based formulation, thereby extending their representational and computational capabilities.
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.
Quantum computers can potentially perform certain types of optimisation problems much more efficiently than classical computers, making them a promising tool for solving complex fuzzy logic problems. In two recent developments, based on solving Quadratic Unconstrained Binary Optimization (QUBO) problems on a type of quantum computers known as quantum annealers, we have introduced novel representations of a) fuzzy sets; b) implementations of some basic fuzzy logic operators (union, intersection, alpha-cut and maximum) and; c) the centroid defuzzification. In this paper, the previous works are further extended by presenting an implementation of Mamdani inference on the quantum annealer machines. We first present how the fuzzy rules can be formulated for such an implementation, then we present how to cascade different quantum-fuzzy operators in order to implement the quantum-fuzzy inference, and finally, a sample implementation of the inference on a real quantum computer is demonstrated. Having the main components of a rule-based fuzzy logic system implemented on quantum computers, this paper provides an integrated solution for implementing a whole fuzzy rule-based system on quantum computers.
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.
In this work, we propose a novel quantum-informed epistemic framework that extends the classical notion of probability by integrating plausibility, credibility, and possibility as distinct yet complementary measures of uncertainty. This enriched quadruple (P, Pl, Cr, Ps) enables a deeper characterization of quantum systems and decision-making processes under partial, noisy, or ambiguous information. Our formalism generalizes the Born rule within a multi-valued logic structure, linking Positive Operator-Valued Measures (POVMs) with data-driven plausibility estimators, agent-based credibility priors, and fuzzy-theoretic possibility functions. We develop a hybrid classical-quantum inference engine that computes a vectorial aggregation of the quadruples, enhancing robustness and semantic expressivity in contexts where classical probability fails to capture non-Kolmogorovian phenomena such as entanglement, contextuality, or decoherence. The approach is validated through three real-world application domains-quantum cybersecurity, quantum AI, and financial computing-where the proposed model outperforms standard probabilistic reasoning in terms of accuracy, resilience to noise, interpretability, and decision stability. Comparative analysis against QBism, Dempster-Shafer, and fuzzy quantum logic further demonstrates the uniqueness of architecture in both operational semantics and practical outcomes. This contribution lays the groundwork for a new theory of epistemic quantum computing capable of modelling and acting under uncertainty beyond traditional paradigms.
This report introduces a novel class of reasoning architectures, termed Quantum Circuit Reasoning Models (QCRM), which extend the concept of Variational Quantum Circuits (VQC) from energy minimization and classification tasks to structured logical inference and reasoning. We posit that fundamental quantum mechanical operations, superposition, entanglement, interference, and measurement, naturally map to essential reasoning primitives such as hypothesis branching, constraint propagation, consistency enforcement, and decision making. The resulting framework combines quantum-inspired computation with differentiable optimization, enabling reasoning to emerge as a process of amplitude evolution and interference-driven selection of self-consistent states. We develop the mathematical foundation of QCRM, define its parameterized circuit architecture, and show how logical rules can be encoded as unitary transformations over proposition-qubit states. We further formalize a training objective grounded in classical gradient descent over circuit parameters and discuss simulation-based implementations on classical hardware. Finally, we propose the Quantum Reasoning Layer (QRL) as a differentiable hybrid component for composable reasoning models applicable to scientific, biomedical, and chemical inference domains.