Among clustering algorithms, fuzzy clustering stands out for its ability to offer a nuanced representation of the data by assigning degrees of membership to clusters, providing a more flexible and adaptive approach than the rigid partitioning of hard clustering algorithms. This has proved highly advantageous, particularly for image segmentation problems. Numerous approaches have been proposed to improve the Fuzzy C-means (FCM) algorithm using quantum computing, some are quantum-inspired and others can be run on quantum simulators. In this paper, a study was conducted on Quantum Fuzzy Means (QFCM) approaches. Then, a novel QFCM algorithm is introduced to address the challenges associated with these current algorithms, particularly in handling large datasets and incorporating genuine fuzzy system principles. Using concepts from quantum computing, our approach aims to improve distance calculations between data points by using a quantum distance measure. This method enables significant acceleration of the clustering process especially when dealing with extensive datasets. Moreover, our proposed algorithm integrates a structured fuzzy system framework into the membership matrix calculation, enhancing the precision and interpretability of the clustering results. Furthermore, unlike other FCM algorithms, which often lack explicit representation of fuzzy logic principles, our approach incorporates a well-defined fuzzy system to capture the inherent uncertainty and ambiguity in real-world data.
Among clustering algorithms, fuzzy clustering stands out for its ability to offer a nuanced representation of the data by assigning degrees of membership to clusters, providing a more flexible and adaptive approach than the rigid partitioning of hard clustering algorithms. This has proved highly advantageous, particularly for image segmentation problems. Numerous approaches have been proposed to improve the Fuzzy C-means (FCM) algorithm using quantum computing, some are quantum-inspired and others can be run on quantum simulators. In this paper, a study was conducted on Quantum Fuzzy Means (QFCM) approaches. Then, a novel QFCM algorithm is introduced to address the challenges associated with these current algorithms, particularly in handling large datasets and incorporating genuine fuzzy system principles. Using concepts from quantum computing, our approach aims to improve distance calculations between data points by using a quantum distance measure. This method enables significant acceleration of the clustering process especially when dealing with extensive datasets. Moreover, our proposed algorithm integrates a structured fuzzy system framework into the membership matrix calculation, enhancing the precision and interpretability of the clustering results. Furthermore, unlike other FCM algorithms, which often lack explicit representation of fuzzy logic principles, our approach incorporates a well-defined fuzzy system to capture the inherent uncertainty and ambiguity in real-world data.
Quantum Machine Learning (QML) has emerged as a groundbreaking approach within the rapidly evolving field of Quantum Computing (QC), leveraging quantum phenomena such as superposition and entanglement to surpass classical models in representational power, optimization speed, and computational efficiency. This paradigm shift paves the way for transformative applications across diverse domains while simultaneously confronting the inherent complexities of quantum mechanics and hardware limitations. Among the powerful computational models used for decision-making and pattern recognition, Fuzzy Cognitive Maps (FCMs) have demonstrated exceptional capabilities in modeling complex systems. Researchers have continually refined the traditional FCM framework by integrating novel features to enhance its effectiveness. However, despite its potential, the integration of quantum computing with FCMs remains largely unexplored, with only a limited number of studies addressing this intersection. This work provides a comprehensive theoretical algorithmic evaluation of the integration between Quantum Computing and FCMs, investigating potential advancements, challenges, and novel applications. Additionally, we present a systematic review of existing research on Quantum Fuzzy Cognitive Maps (QFCMs), offering new insights into their theoretical foundations and future directions. By bridging the gap between quantum computing and cognitive modeling, this study aims to unlock new possibilities for intelligent decision-making systems in the quantum era.
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.
Traditional clustering algorithms, such as k-means and DBSCAN, often face significant challenges when applied to big data. The computational complexity associated with distance calculations and nearest neighbor searches scales poorly with dataset size, limiting their effectiveness. This paper proposes a novel approach to clustering inspired by quantum measurement theory, specifically quantum-inspired nearest neighbor search. We leverage concepts from quantum mechanics, such as superposition and measurement, to design clustering algorithms that can efficiently identify clusters within high-dimensional datasets. The core idea is to treat the clustering problem as a measurement process, where candidate cluster centers are repeatedly measured against data points, and the most likely cluster centers are selected. The resulting algorithms aim to provide scalability improvements over conventional methods, particularly for datasets with a large number of features and data points. The effectiveness of the proposed algorithms is demonstrated through theoretical analysis and conceptual explanations, highlighting the potential benefits and future research directions.
Accurate quantum state discrimination is critical for reliable qubit readout in current superconducting quantum processors, as it enables precise measurement outcomes, reduces readout-induced errors, and improves the overall reliability of quantum algorithm execution. Recently, machine learning (ML) techniques have been explored to enhance quantum state discrimination, outperforming traditional methods based on static thresholds. However, these approaches rely on hard-decision schemes that assign binary outcomes without accounting for readout uncertainty, thereby disregarding signal-level variations that can degrade measurement fidelity. This article introduces a measurement-aware classification approach based on Fuzzy C-means (FCM) clustering combined with data filtering, enabling soft-decision readout discrimination through confidence-based shot selection. Experimental validation was conducted on four different real IBM quantum devices, including single- and two-qubit readout scenarios, as well as multi-qubit circuits preparing GHZ and W-state with up to 10 qubits. Results show that the proposed method consistently outperforms state-of-the-art ML-based discriminators in terms of assignment fidelity and state reconstruction accuracy, demonstrating its effectiveness for enhancing readout quality in near-term quantum computing platforms. Quantitatively, the FCM-based discriminator yields 2–3% assignment fidelity improvements in single- and two-qubit readout and statistically significant gains in over 94% of GHZ and 97% of W multi-qubit experiments.
The article introduces Q-ClusterSim, a resource-efficient hybrid quantum-classical framework designed to accelerate clustering operations on large-scale and high-dimensional datasets. The proposed model combines quantum-enhanced k-means and density-based clustering within a unified quantum simulation environment to achieve improved computational efficiency and scalability. By leveraging the parallelism of quantum circuits and the adaptability of classical optimization, Q-ClusterSim significantly reduces execution time while maintaining clustering accuracy. Simulations are conducted using IBM Qiskit and TensorFlow Quantum on benchmark datasets, where the proposed model consistently outperforms classical clustering algorithms in terms of convergence speed, precision, and resource consumption. Results validate the model’s effectiveness in managing complex data structures under limited qubit resources, making it suitable for real-world large data applications. This study highlights the transformative potential of quantum-assisted clustering in reshaping future data analytics and computational intelligence paradigms..
Recently, Quantum Computing is entered in the so-called Noisy Intermediate-Scale Quantum (NISQ) era, where devices characterized by a few number of qubits are potentially able to overcome classical computers in performing specific tasks. However, noise in quantum operators still limits the size of quantum circuits that can be run in a reliable way. Consequently, there is a strong need for error mitigation approaches aimed at increasing reliability in quantum computation and making this paradigm really useful and productive in real world applications. In this paper, a fuzzy method, such as Fuzzy C-Means (FCM) clustering, has been used, for the very first time, to support the identification of matrices for error mitigation in quantum measurement. As shown in experiments, mitigation matrices identified with the support of FCM are able to strongly reduce error in computation when compared to mitigation matrices conventionally identified, like those used by IBM in its quantum library named Qiskit.