This work introduces an innovative approach from modeling to simulations, integrating quantum fuzzy interpretations, focusing on the expression of membership degrees in quantum circuits, interpreted as a unitary quantum transformation. Our research contrasts Quantum Fuzzy Computing with Classical Computing, particularly in the context of the prisoner's dilemma and parent-child relationships. Through the Qiskit framework, we conduct simulations, demonstrating the differences in results obtained by both approaches. Well-known fuzzy connectives, such as “exclusive or” and “arithmetic means”, provide an algebraic description for the corresponding composition of quantum operators and circuit representations. Thus, such algorithms can easily extend to model multiple agents' relationships, described by multidimensional quantum registers. The Qiskit simulations provide the structure for the algorithms' computation on the actual quantum platforms, indicating a promising direction for future research in this hybrid research area.

In this paper, we discussconsensus measures for typical hesitant fuzzy elements (THFE), which are the finite and nonempty fuzzy membership degrees under the scope of typical hesitant fuzzy sets (THFS). In our approach, we present a model that formally constructs consensus measures by means of aggregations functions, fuzzy implication-like functions and fuzzy negations, using admissible orders to compare the THFE, and also providing an analysis of consistency on them. Our theoretical results are applied into a problem of decision making with multicriteria illustrating our methodology to achieve consensus in a group of experts working with THFS.

Multi Expert-Multi Criteria Decision Making (ME-MCDM) problems have been well explored on hesitant fuzzy environments dealing with membership degrees as subsets which do not necessarily have the same cardinality. Admissible (total) orders collaborate by reducing the collapse in the ranking of alternatives related to preference relations. In such context, three classes of admissible orders are presented in a non-restrictive way, integrating the concepts of linearity and cardinality and providing support to the comparison between two typical hesitant fuzzy elements. In the sense of hesitant fuzzy logic, the study of fuzzy operators and their main properties is extended considering the admissible linear orders. Namely, the typical hesitant fuzzy aggregation functions, negations and implication functions are discussed mainly related to their (iso/anti)tonicity properties w.r.t. these admissible orders. An algorithmic procedure is introduced illustrating our strategy to solve an ME-MCDM problem, by selecting a Computer Integrating Manufacturing software and making use of the achieved theoretical results.

In this study, we discuss a new class of fuzzy subsethood measures between fuzzy sets. We propose a new definition of fuzzy subsethood measure as an intersection of other axiomatizations and provide two construction methods to obtain them. The advantage of this new approach is that we can construct fuzzy subsethood measures by aggregating fuzzy implication operators which may satisfy some properties widely studied in literature. We also obtain some of the classical measures such as the one defined by Goguen. The relationships with fuzzy distances, penalty functions, and similarity measures are also investigated. Finally, we provide an illustrative example which makes use of a fuzzy entropy defined by means of our fuzzy subsethood measures for choosing the best fuzzy technique for a specific problem.