Analog quantum computation offers a route to machine learning using controllable physical dynamics as a computational resource. However, many existing approaches rely on task-specific protocols or observables that are difficult to access experimentally, limiting generality and implementation. Here we introduce Qlustering, an unsupervised clustering framework based on steady-state quantum transport in quantum networks governed by the GKSL master equation, developed through algorithm-hardware co-design. Data are encoded as input states, and cluster assignments are inferred from steady-state output currents, avoiding full state tomography in favor of accessible transport observables. The method realizes a hybrid classical-quantum workflow in which data preparation and training are performed classically, while clustering is carried out by transport dynamics. We benchmark the method on synthetic datasets, localization, and QM9 and Iris, finding competitive performance and stability over a broad range of dephasing strengths. These results show that unlabeled data structure can be extracted directly from steady-state transport observables, identifying terminal-current readout as a native, tomography-free mechanism for unsupervised learning in open quantum networks.
Comments
arXiv admin note: substantial text overlap with arXiv:2510.22727
Analog quantum computation offers a route to machine learning using controllable physical dynamics as a computational resource. However, many existing approaches rely on task-specific protocols or observables that are difficult to access experimentally, limiting generality and implementation. Here we introduce Qlustering, an unsupervised clustering framework based on steady-state quantum transport in quantum networks governed by the GKSL master equation, developed through algorithm-hardware co-design. Data are encoded as input states, and cluster assignments are inferred from steady-state output currents, avoiding full state tomography in favor of accessible transport observables. The method realizes a hybrid classical-quantum workflow in which data preparation and training are performed classically, while clustering is carried out by transport dynamics. We benchmark the method on synthetic datasets, localization, and QM9 and Iris, finding competitive performance and stability over a broad range of dephasing strengths. These results show that unlabeled data structure can be extracted directly from steady-state transport observables, identifying terminal-current readout as a native, tomography-free mechanism for unsupervised learning in open quantum networks.
Quantum computing is one of the most promising solutions for solving optimization problems in the healthcare world. Quantum computing development aims to light up the execution of a vast and complex set of algorithmic instructions. For its implementation, the machine learning models are continuously evolving. Hence, the new challenge is to improve the existing complex and critical machine learning training models. Therefore, the healthcare sector is shifting from a classical to a quantum domain to sustain patient-oriented attention to healthcare patrons. This paper presents a hybrid classical-quantum approach for training the unsupervised data models. In order to achieve good performance and optimization of the machine learning algorithms, a quantum k-means (QK-means) clustering problem was deployed on the IBM quantum simulators, i.e.,the IBM QASM simulator. In the first place, the approach was theoretically studied and then implemented to analyze the experimental results. The approach was further tested using small synthetics and cardiovascular datasets on a qsam simulator to obtain the clustering solution. The future direction connecting the dots is the incremental k-means algorithm with the quantum platform, which would open hitherto unimaginable technological doors.
Quantum computing exploits superposition, entanglement, and interference to address problems beyond classical reach, yet current devices are limited by noise and scale. Hybrid quantum–classical approaches therefore play a key role in achieving near-term utility by integrating quantum subroutines into classical workflows. Within this setting, Quantum Artificial Intelligence (QAI) offers new opportunities for machine learning. This thesis focuses on unsupervised Quantum Machine Learning, motivated by the abundance of unlabeled data and the importance of tasks such as clustering, dimensionality reduction, and anomaly detection. We study how to design hardware-efficient quantum subroutines, identify unsupervised paradigms well suited to hybrid computation, and assess potential advantages over classical methods. The contributions include a critical review of existing QAI approaches, the development of shallow-depth quantum subroutines for core operations, and the proposal of hybrid algorithms evaluated on synthetic and real datasets. The results highlight when quantum components provide practical value and clarify trade-offs between performance and complexity under current hardware constraints.
Clustering remains a cornerstone of unsupervised learning, yet classical algorithms often struggle with the inherent complexities of modern datasets, such as high dimensionality, non-linear separability, and significant noise. This paper introduces the Hybrid Quantum-Classical Clustering Algorithm (HQCA), a novel framework that leverages the power of quantum computation and the robustness of classical machine learning to overcome these limitations. HQCA integrates a quantum kernel estimation phase, utilizing a parameterized quantum circuit to project data into a high-dimensional Hilbert space, thereby enhancing cluster separability where classical kernels fail. Furthermore, it employs a quantum-enhanced optimization routine, based on the Quantum Approximate Optimization Algorithm (QAOA), to determine optimal cluster centroids, thereby mitigating the common pitfall of local minima encountered by algorithms like K-Means. The algorithm also incorporates a quantum-inspired gap statistic to autonomously determine the optimal number of clusters. We rigorously evaluate HQCA against state-of-the-art classical clustering methods, including K-Means, DBSCAN, and Spectral Clustering, on multiple real-world benchmark datasets from the UCI repository, such as Iris, Wine, and a high-dimensional image dataset (Fashion-MNIST). Our results demonstrate that HQCA consistently achieves superior performance across multiple evaluation metrics, including Purity, Silhouette Score, and Adjusted Rand Index (ARI), particularly excelling in scenarios involving complex, non-linear data manifolds. The proposed hybrid paradigm not only signifies a substantial leap in clustering accuracy and robustness but also provides a scalable pathway for leveraging current Noisy Intermediate-Scale Quantum (NISQ) devices in practical data analytics workflows, marking a critical step toward potential quantum advantage in unsupervised learning. We emphasize that the demonstrated advantage is algorithmic and representational, not an asymptotic runtime advantage.
Unsupervised vision clustering, a cornerstone in computer vision, has been studied for decades, yielding signif-icant outcomes across numerous vision tasks. However, these algorithms involve substantial computational demands when confronted with vast amounts of unlabeled data. Conversely, quantum computing holds promise in expediting unsupervised algorithms when handling large-scale databases. In this study, we introduce QClusformer, a pioneering Transformer-based frame-work leveraging quantum machines to tackle unsupervised vision clustering challenges. Specifically, we design the Transformer architecture, including the self-attention module and transformer blocks, from a quantum perspective to enable execution on quan-tum hardware. In addition, we present QClusformer, a variant based on the Transformer architecture, tailored for unsupervised vision clustering tasks. By integrating these elements into an end-to-end framework, QClusformer consistently outperforms previous methods running on classical computers. Empirical evaluations across diverse benchmarks, including MS-Celeb-1M and DeepFashion, underscore the superior performance of QClusformer compared to state-of-the-art methods.
Machine learning techniques have led to broad adoption of a statistical model of computing. The statistical distributions natively available on quantum processors are a superset of those available classically. Harnessing this attribute has the potential to accelerate or otherwise improve machine learning relative to purely classical performance. A key challenge toward that goal is learning to hybridize classical computing resources and traditional learning techniques with the emerging capabilities of general purpose quantum processors. Here, we demonstrate such hybridization by training a 19-qubit gate model processor to solve a clustering problem, a foundational challenge in unsupervised learning. We use the quantum approximate optimization algorithm in conjunction with a gradient-free Bayesian optimization to train the quantum machine. This quantum/classical hybrid algorithm shows robustness to realistic noise, and we find evidence that classical optimization can be used to train around both coherent and incoherent imperfections.
Quantum machine learning has gained considerable attention as quantum technology advances, presenting a promising approach for efficiently learning complex data patterns. Despite this promise, most contemporary quantum methods require significant resources for variational parameter optimization and face issues with vanishing gradients, leading to experiments that are either limited in scale or lack potential for quantum advantage. To address this, we develop a general-purpose, gradient-free, and scalable quantum reservoir learning algorithm that harnesses the quantum dynamics of neutral-atom analog quantum computers to process data. We experimentally implement the algorithm, achieving competitive performance across various categories of machine learning tasks, including binary and multi-class classification, as well as timeseries prediction. Effective and improving learning is observed with increasing system sizes of up to 108 qubits, demonstrating the largest quantum machine learning experiment to date. We further observe comparative quantum kernel advantage in learning tasks by constructing synthetic datasets based on the geometric differences between generated quantum and classical data kernels. Our findings demonstrate the potential of utilizing classically intractable quantum correlations for effective machine learning. We expect these results to stimulate further extensions to different quantum hardware and machine learning paradigms, including early fault-tolerant hardware and generative machine learning tasks.