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

arXiv:2605.22900

Mediative Fuzzy Logic: From Type-1 Foundations to Type-2, Type-3 and Quantum Extensions

Oscar Montiel Ross

cs.AIcs.LOquant-phSubmitted May 21, 2026• Announced May 22, 2026
arXivHTMLPDF

Abstract

Mediative Fuzzy Logic was conceived as a practical scheme for reconciling hesitant or conflicting assessments in fuzzy control and decision-making. However, its logical and semantic foundations remain underdeveloped, especially beyond operational type-1 settings. This article develops a unified account of the type-1 core together with interval type-2, granular type-3, and quantum extensions. We characterize the mediative operator as a convex aggregation controlled by hesitation and contradiction, model mediative truth values as independent truth-falsity pairs in a continuous bilattice-like structure, and introduce a propositional system extending a standard t-norm-based fuzzy logic with a mediative connective. We establish soundness, paraconsistency, and conservativity over the underlying fuzzy base for formulas without mediation, and formulate coherent semantic extensions to interval type-2 truth values, granule-indexed local evaluations, and effects and density operators on Hilbert spaces. An autonomous-braking sensor-fusion example illustrates how the framework supports transparent, conservative, and safety-first decisions under incomplete, heterogeneous, and mildly contradictory evidence. Under suitable assumptions, the higher-level formulations reduce to the type-1 case, clarifying coherence across levels and reliably supporting future work in intelligent decision systems.

Comments
30 pages, 1 figure

Related papers

General System theory, Like-Quantum Semantics and Fuzzy Sets

Ignazio Francesco Licata

It is outlined the possibility to extend the quantum formalism in relation to the requirements of the general systems theory. It can be done by using a quantum semantics arising from the deep logical structure of quantum theory. It is so possible taking into account the logical openness relationship between observer and system. We are going to show how considering the truth-values of quantum propositions within the context of the fuzzy sets is here more useful for systemics . In conclusion we propose an example of formal quantum coherence.

arXiv:0704.0042•Mar 31, 2007•2 citations

Foundations of Quantum Granular Computing with Effect-Based Granules, Algebraic Properties and Reference Architectures

Oscar Montiel Ross

This paper develops the foundations of Quantum Granular Computing (QGC), extending classical granular computing including fuzzy, rough, and shadowed granules to the quantum regime. Quantum granules are modeled as effects on a finite dimensional Hilbert space, so granular memberships are given by Born probabilities. This operator theoretic viewpoint provides a common language for sharp (projective) and soft (nonprojective) granules and embeds granulation directly into the standard formalism of quantum information theory. We establish foundational results for effect based quantum granules, including normalization and monotonicity properties, the emergence of Boolean islands from commuting families, granular refinement under Luders updates, and the evolution of granules under quantum channels via the adjoint channel in the Heisenberg picture. We connect QGC with quantum detection and estimation theory by interpreting the effect operators realizing Helstrom minimum error measurement for binary state discrimination as Helstrom type decision granules, i.e., soft quantum counterparts of Bayes optimal decision regions. Building on these results, we introduce Quantum Granular Decision Systems (QGDS) with three reference architectures that specify how quantum granules can be defined, learned, and integrated with classical components while remaining compatible with near term quantum hardware. Case studies on qubit granulation, two qubit parity effects, and Helstrom style soft decisions illustrate how QGC reproduces fuzzy like graded memberships and smooth decision boundaries while exploiting noncommutativity, contextuality, and entanglement. The framework thus provides a unified and mathematically grounded basis for operator valued granules in quantum information processing, granular reasoning, and intelligent systems.

quant-pharXiv:2511.22679•Nov 28, 2025•1 citation

Aggregation operations from quantum computing

Lidiane Visintin, Adriano Maron, Renata Reiser +1 more

Computer systems based on fuzzy logic are capable of generating a reliable output even when handling inaccurate input data by applying a rule based system. The main contribution of this paper is to show that quantum computing can be used to extend the class of fuzzy sets. The central idea associates the states of a quantum register to membership functions (mFs) of fuzzy subsets, and the rules for the processes of fuzzyfication are performed by unitary quantum transformations. Thus, this paper describes multi-dimensional quantum registers, associated to mFs on the unitary interval U, in order to introduce a novel interpretation of aggregations found in fuzzy set theory. In particular, t-norms and t-conorms based on quantum gates allows the modeling and interpretation of union, intersection, difference and implication among fuzzy sets, also including an expression for the class of fuzzy S-implications. Furthermore, an interpretation of the symmetric sum was achieved by considering the quantum register sum operator.

IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)•Jul 1, 2013•13 citations

Quantum Fuzzy Sets Revisited: Density Matrices, Decoherence, and the Q-Matrix Framework

Mirco A. Mannucci

In 2006 we proposed Quantum Fuzzy Sets, observing that states of a quantum register could serve as characteristic functions of fuzzy subsets, embedding Zadeh's unit interval into the Bloch sphere. That paper was deliberately preliminary. In the two decades since, the idea has been taken up by researchers working on quantum annealers, intuitionistic fuzzy connectives, and quantum machine learning, while parallel developments in categorical quantum mechanics have reshaped the theoretical landscape. The present paper revisits that programme and introduces two main extensions. First, we move from pure states to density matrices, so that truth values occupy the entire Bloch ball rather than its surface; this captures the phenomenon of semantic decoherence that pure-state semantics cannot express. Second, we introduce the Q-Matrix, a global density matrix from which individual quantum fuzzy sets emerge as local sections via partial trace. We define a category QFS of quantum fuzzy sets, establish basic structural properties (monoidal structure, fibration over Set), characterize the classical limit as simultaneous diagonalizability, and exhibit an obstruction to a fully internal Frobenius-algebra treatment.

quant-pharXiv:2603.26739•Mar 24, 2026•0 citations

Quantum-Fuzzy Integration for Emotion-Aware in Computational Intelligent Systems

Cecília Botelho, Larissa Schonhofen, Hélida Santos +3 more

Understanding human decision-making in uncertain and dynamic scenarios is essential for advancing technologies in AI, predictive analytics, and behavioral simulations. Fuzzy logic provides an approach for representing gradual transitions and capturing the nuances of human behaviors, making it a foundation for tackling such challenges. This study explores a hybrid approach integrating fuzzy logic, quantum computing, and machine learning to model complex decision-making scenarios. Using a case study of the Prisoner’s Dilemma, the methodology captures nuanced human behaviors and uncertainties through fuzzy membership degrees while leveraging quantum properties like superposition and entanglement to simulate dynamic agent interactions. The resulting simulations generated a comprehensive dataset, which was subsequently applied in a quantum-based artificial intelligence model, demonstrating the capability of this integrated approach to uncover complex patterns in uncertain systems. This work offers a foundation for advancing computational models in decision support systems and predictive analytics, highlighting the promise of emerging technologies in addressing challenges in multidimensional and interdependent environments.

IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)•Jul 6, 2025•1 citation

Fuzzy quantum logics

María Luisa Dalla Chiara, Roberto Giuntini

Quantum logic is a particular example of a fuzzy quantum logic. QL is semantically characterized by the class of all quantum MV algebras. The standard quantum MV algebra is based on the set of all effects in a Hilbert space. From the physical point of view, effects represent physical properties that may be noisy and ambiguous.

•Jan 1, 1996•1 citation
Mediative Fuzzy Logic was conceived as a practical scheme for reconciling hesitant or conflicting assessments in fuzzy control and decision-making. However, its logical and semantic foundations remain underdeveloped, especially beyond operational type-1 settings. This article develops a unified account of the type-1 core together with interval type-2, granular type-3, and quantum extensions. We characterize the mediative operator as a convex aggregation controlled by hesitation and contradiction, model mediative truth values as independent truth-falsity pairs in a continuous bilattice-like structure, and introduce a propositional system extending a standard t-norm-based fuzzy logic with a mediative connective. We establish soundness, paraconsistency, and conservativity over the underlying fuzzy base for formulas without mediation, and formulate coherent semantic extensions to interval type-2 truth values, granule-indexed local evaluations, and effects and density operators on Hilbert spaces. An autonomous-braking sensor-fusion example illustrates how the framework supports transparent, conservative, and safety-first decisions under incomplete, heterogeneous, and mildly contradictory evidence. Under suitable assumptions, the higher-level formulations reduce to the type-1 case, clarifying coherence across levels and reliably supporting future work in intelligent decision systems.
It is outlined the possibility to extend the quantum formalism in relation to the requirements of the general systems theory. It can be done by using a quantum semantics arising from the deep logical structure of quantum theory. It is so possible taking into account the logical openness relationship between observer and system. We are going to show how considering the truth-values of quantum propositions within the context of the fuzzy sets is here more useful for systemics . In conclusion we propose an example of formal quantum coherence.
This paper develops the foundations of Quantum Granular Computing (QGC), extending classical granular computing including fuzzy, rough, and shadowed granules to the quantum regime. Quantum granules are modeled as effects on a finite dimensional Hilbert space, so granular memberships are given by Born probabilities. This operator theoretic viewpoint provides a common language for sharp (projective) and soft (nonprojective) granules and embeds granulation directly into the standard formalism of quantum information theory. We establish foundational results for effect based quantum granules, including normalization and monotonicity properties, the emergence of Boolean islands from commuting families, granular refinement under Luders updates, and the evolution of granules under quantum channels via the adjoint channel in the Heisenberg picture. We connect QGC with quantum detection and estimation theory by interpreting the effect operators realizing Helstrom minimum error measurement for binary state discrimination as Helstrom type decision granules, i.e., soft quantum counterparts of Bayes optimal decision regions. Building on these results, we introduce Quantum Granular Decision Systems (QGDS) with three reference architectures that specify how quantum granules can be defined, learned, and integrated with classical components while remaining compatible with near term quantum hardware. Case studies on qubit granulation, two qubit parity effects, and Helstrom style soft decisions illustrate how QGC reproduces fuzzy like graded memberships and smooth decision boundaries while exploiting noncommutativity, contextuality, and entanglement. The framework thus provides a unified and mathematically grounded basis for operator valued granules in quantum information processing, granular reasoning, and intelligent systems.
Computer systems based on fuzzy logic are capable of generating a reliable output even when handling inaccurate input data by applying a rule based system. The main contribution of this paper is to show that quantum computing can be used to extend the class of fuzzy sets. The central idea associates the states of a quantum register to membership functions (mFs) of fuzzy subsets, and the rules for the processes of fuzzyfication are performed by unitary quantum transformations. Thus, this paper describes multi-dimensional quantum registers, associated to mFs on the unitary interval U, in order to introduce a novel interpretation of aggregations found in fuzzy set theory. In particular, t-norms and t-conorms based on quantum gates allows the modeling and interpretation of union, intersection, difference and implication among fuzzy sets, also including an expression for the class of fuzzy S-implications. Furthermore, an interpretation of the symmetric sum was achieved by considering the quantum register sum operator.
In 2006 we proposed Quantum Fuzzy Sets, observing that states of a quantum register could serve as characteristic functions of fuzzy subsets, embedding Zadeh's unit interval into the Bloch sphere. That paper was deliberately preliminary. In the two decades since, the idea has been taken up by researchers working on quantum annealers, intuitionistic fuzzy connectives, and quantum machine learning, while parallel developments in categorical quantum mechanics have reshaped the theoretical landscape. The present paper revisits that programme and introduces two main extensions. First, we move from pure states to density matrices, so that truth values occupy the entire Bloch ball rather than its surface; this captures the phenomenon of semantic decoherence that pure-state semantics cannot express. Second, we introduce the Q-Matrix, a global density matrix from which individual quantum fuzzy sets emerge as local sections via partial trace. We define a category QFS of quantum fuzzy sets, establish basic structural properties (monoidal structure, fibration over Set), characterize the classical limit as simultaneous diagonalizability, and exhibit an obstruction to a fully internal Frobenius-algebra treatment.
Understanding human decision-making in uncertain and dynamic scenarios is essential for advancing technologies in AI, predictive analytics, and behavioral simulations. Fuzzy logic provides an approach for representing gradual transitions and capturing the nuances of human behaviors, making it a foundation for tackling such challenges. This study explores a hybrid approach integrating fuzzy logic, quantum computing, and machine learning to model complex decision-making scenarios. Using a case study of the Prisoner’s Dilemma, the methodology captures nuanced human behaviors and uncertainties through fuzzy membership degrees while leveraging quantum properties like superposition and entanglement to simulate dynamic agent interactions. The resulting simulations generated a comprehensive dataset, which was subsequently applied in a quantum-based artificial intelligence model, demonstrating the capability of this integrated approach to uncover complex patterns in uncertain systems. This work offers a foundation for advancing computational models in decision support systems and predictive analytics, highlighting the promise of emerging technologies in addressing challenges in multidimensional and interdependent environments.