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

Information

Revisiting k-Means Clustering Method for Quantum State Discrimination: Training Dataset and Assignment

Fabrizio García-Marín, José Carlos Rebón, Jimena Archundia, Diego Medina-Peláez, Francisco Delgado

Published Nov 1, 2026• 0 citations
Publisher

Abstract

Clustering algorithms have received increasing attention as methods for determining unknown quantum states and their potential application in quantum information processing. In particular, quantum k-means is a promising approach to this task; however, its implementation presents practical challenges associated with state preparation, measurement, and the statistical estimation of quantum information. In this work, we investigate the adaptation and integration of the k-means method elements for the characterisation and discrimination of single-qubit mixed states. We analyse the physical limitations of this process and consider possible alternatives, including C-SWAP and multiple-teleportation-based measurements, to estimate the number and locations of the pure-state components or clusters of them on the Bloch sphere. Classical post-processing is further explored to recover cluster information from the resulting measurement distributions as a complementary method. Additionally, the optimal parameter values for centroid assignment are analysed and discussed. In fact, the assignment of incoming states is formulated as a quantum-state discrimination problem for which the square-root measurement provides a suitable strategy. Although simple, this strategy is useful in a limited number of clusters or pure states.The results highlight the physical and statistical limitations of applying k-means to quantum state determination, support hybrid quantum–classical approaches and suggest the potential for experimental implementation of the proposed framework.

DOI
10.3390/info17111086

Related papers

Quantum-data-adaptive clustering algorithm

Meng-Ting Yang, Yu Huang, Lu Yan +1 more

Abstract Quantum state clustering provides a powerful tool for quantum information processing. This paper focuses on the classification of single-qubit pure and mixed states via clustering algorithms, and discovers that the classical K -means algorithm has two limitations in clustering quantum states: the Euclidean distance cannot accurately reflect the similarity between quantum states, and the centroid update based on the arithmetic mean frequently fails to yield valid quantum states. To address these issues, we propose two distance metrics for quantum states: the dynamic distance and the Bloch distance, and adopt the K -medoids method to update the centroid, ensuring that the cluster center always remains a valid quantum state, thereby designing a quantum-data-adaptive clustering algorithm. Experimental results show that the dynamic distance achieves a clustering accuracy as high as 91.4 % , but at the cost of higher computational complexity. In contrast, the Bloch distance significantly reduces computational complexity while maintaining clustering performance comparable to that of the dynamic distance, achieving a clustering accuracy of 87.4 % . This paper provides a practical method for achieving efficient and reliable clustering of single-qubit quantum states.

Laser Physics Letters•Jul 1, 2026•0 citations

Improvement of K-means Clustering Algorithm Based on Quantum State Similarity Measurement

Hongfei Zhang, Mingwei Li

The classical K-means clustering algorithm is widely used in various fields due to its simple implementation and efficient computation, but the classical K-means clustering algorithm relies on the random selection of the initial center of mass, which is prone to fall into the deadlock of local optimality. In order to break through this limitation, the quantum K-means clustering algorithm is introduced, which is able to explore multiple potential clustering center combinations at the same time through the parallelism of quantum computation, so as to have a greater probability of converging to the globally optimal solution. Quantum K-means clustering algorithms typically employ fidelity as a similarity measure between quantum states, and similarity is assessed by calculating the probability of overlap between quantum states. However, the fidelity only quantizes the pure state information of the quantum states and ignores the classical statistical features of the data itself, which may lead to unreasonable clustering boundaries in mixed state or noise interference scenarios. In response to the above problems, this paper proposes an improved quantum-classical hybrid similarity metric, whose core idea is to incorporate the dual constraints of quantum information and classical features.

Advances in Computer Signals and Systems•Jan 1, 2025•0 citations

Quantum clustering with k-Means: A hybrid approach

Alessandro Poggiali, Alessandro Berti, Anna Bernasconi +2 more

Quantum computing, based on quantum theory, holds great promise as an advanced computational paradigm for achieving fast computations. Quantum algorithms are expected to surpass their classical counterparts in terms of computational complexity for certain tasks, including machine learning. In this paper, we design, implement, and evaluate three hybrid quantum k-Means algorithms, exploiting different degrees of parallelism. Indeed, each algorithm incrementally leverages quantum parallelism to reduce the complexity of the cluster assignment step up to a constant cost. In particular, we exploit quantum phenomena to speed up the computation of distances. The core idea is that the computation of distances between records and centroids can be executed simultaneously, thus saving time, especially for big datasets. We show that our hybrid quantum k-Means algorithms are theoretically faster than the classical algorithm, while experiments suggest that it is possible to obtain comparable clustering results.

arXiv:2212.06691•Theoretical Computer Science•Feb 21, 2024•76 citations

Hamiltonian formulations of centroid-based clustering

Myeonghwan Seong, Daniel K. Park

Clustering is a fundamental task in data science that aims to group data based on their similarities. However, defining similarity is often ambiguous, making it challenging to determine the most appropriate objective function for a given dataset. Traditional clustering methods, such as the k -means algorithm and weighted maximum k -cut, focus on specific objectives—typically relying on average or pairwise characteristics of the data—leading to performance that is highly data-dependent. Moreover, incorporating practical constraints into clustering objectives is not straightforward, and these problems are known to be NP-hard. In this study, we formulate the clustering problem as a search for the ground state of a Hamiltonian, providing greater flexibility in defining clustering objectives and incorporating constraints. This approach enables the application of various quantum simulation techniques, including both circuit-based quantum computation and quantum annealing, thereby opening a path toward quantum advantage in solving clustering problems. We propose various Hamiltonians to accommodate different clustering objectives, including the ability to combine multiple objectives and incorporate constraints. We evaluate the clustering performance through numerical simulations and implementations on the D-Wave quantum annealer. The results demonstrate the broad applicability of our approach to a variety of clustering problems on current quantum devices. Furthermore, we find that Hamiltonians designed for specific clustering objectives and constraints impose different requirements for qubit connectivity, indicating that certain clustering tasks are better suited to specific quantum hardware. Our experimental results highlight this by identifying the Hamiltonian that optimally utilizes the physical qubits available in the D-Wave System.

arXiv:2502.06542•Frontiers in Physics•Apr 22, 2025•3 citations

Structure of minimum-error quantum state discrimination

Joonwoo Bae

Distinguishing different quantum states is a fundamental task having practical applications in information processing. Despite the effort devoted so far, however, strategies for optimal discrimination are known only for specific examples. In this paper we consider the problem of minimum-error quantum state discrimination where one attempts to minimize the average error. We show the general structure of minimum-error state discrimination as well as useful properties to derive analytic solutions. Based on the general structure, we present a geometric formulation of the problem, which can be applied to cases where quantum state geometry is clear. We also introduce equivalent classes of sets of quantum states in terms of minimum-error discrimination: sets of quantum states in an equivalent class that share the same guessing probability. In particular, for qubit states where the state geometry is found with the Bloch sphere, we illustrate that for an arbitrary set of qubit states, the minimum-error state discrimination with equal prior probabilities can be analytically solved, that is, optimal measurement and the guessing probability are explicitly obtained.

arXiv:1210.2845•New Journal of Physics•Jul 18, 2013•89 citations

Quantum-machine-learning channel discrimination

Andrey Kardashin, A. V. Vlasova, Anastasiia A. Pervishko +2 more

In the problem of quantum channel discrimination, one distinguishes between a given number of quantum channels, which is done by sending an input state through a channel and measuring the output state. This work studies applications of variational quantum circuits and machine-learning techniques for discriminating such channels. In particular, we explore (i) the practical implementation of embedding this task into the framework of variational quantum computing, (ii) training a quantum classifier based on variational quantum circuits, and (iii) applying the quantum kernel estimation technique. For testing these three channel discrimination approaches, we considered a pair of entanglement-breaking channels and the depolarizing channel with two different depolarization factors. For the approach (i), we address solving the quantum channel discrimination problem using widely discussed parallel and sequential strategies. We show the advantage of the latter in terms of better convergence with less quantum resources. Quantum channel discrimination with a variational quantum classifier (ii) allows one to operate even with random and mixed input states and simple variational circuits. The kernel-based classification approach (iii) is also found effective as it allows one to discriminate depolarizing channels associated not with just fixed values of the depolarization factor, but with ranges of it. Additionally, we discovered that a simple modification of one of the commonly used kernels significantly increases the efficiency of this approach. Finally, our numerical findings reveal that the performance of variational methods of channel discrimination depends on the trace of the product of the output states. These findings demonstrate that quantum machine learning can be used to discriminate channels, such as those representing physical noise processes.

arXiv:2206.09933•Physical Review A•Sep 7, 2022•16 citations
Clustering algorithms have received increasing attention as methods for determining unknown quantum states and their potential application in quantum information processing. In particular, quantum k-means is a promising approach to this task; however, its implementation presents practical challenges associated with state preparation, measurement, and the statistical estimation of quantum information. In this work, we investigate the adaptation and integration of the k-means method elements for the characterisation and discrimination of single-qubit mixed states. We analyse the physical limitations of this process and consider possible alternatives, including C-SWAP and multiple-teleportation-based measurements, to estimate the number and locations of the pure-state components or clusters of them on the Bloch sphere. Classical post-processing is further explored to recover cluster information from the resulting measurement distributions as a complementary method. Additionally, the optimal parameter values for centroid assignment are analysed and discussed. In fact, the assignment of incoming states is formulated as a quantum-state discrimination problem for which the square-root measurement provides a suitable strategy. Although simple, this strategy is useful in a limited number of clusters or pure states.The results highlight the physical and statistical limitations of applying k-means to quantum state determination, support hybrid quantum–classical approaches and suggest the potential for experimental implementation of the proposed framework.
Abstract Quantum state clustering provides a powerful tool for quantum information processing. This paper focuses on the classification of single-qubit pure and mixed states via clustering algorithms, and discovers that the classical K -means algorithm has two limitations in clustering quantum states: the Euclidean distance cannot accurately reflect the similarity between quantum states, and the centroid update based on the arithmetic mean frequently fails to yield valid quantum states. To address these issues, we propose two distance metrics for quantum states: the dynamic distance and the Bloch distance, and adopt the K -medoids method to update the centroid, ensuring that the cluster center always remains a valid quantum state, thereby designing a quantum-data-adaptive clustering algorithm. Experimental results show that the dynamic distance achieves a clustering accuracy as high as 91.4 % , but at the cost of higher computational complexity. In contrast, the Bloch distance significantly reduces computational complexity while maintaining clustering performance comparable to that of the dynamic distance, achieving a clustering accuracy of 87.4 % . This paper provides a practical method for achieving efficient and reliable clustering of single-qubit quantum states.
The classical K-means clustering algorithm is widely used in various fields due to its simple implementation and efficient computation, but the classical K-means clustering algorithm relies on the random selection of the initial center of mass, which is prone to fall into the deadlock of local optimality. In order to break through this limitation, the quantum K-means clustering algorithm is introduced, which is able to explore multiple potential clustering center combinations at the same time through the parallelism of quantum computation, so as to have a greater probability of converging to the globally optimal solution. Quantum K-means clustering algorithms typically employ fidelity as a similarity measure between quantum states, and similarity is assessed by calculating the probability of overlap between quantum states. However, the fidelity only quantizes the pure state information of the quantum states and ignores the classical statistical features of the data itself, which may lead to unreasonable clustering boundaries in mixed state or noise interference scenarios. In response to the above problems, this paper proposes an improved quantum-classical hybrid similarity metric, whose core idea is to incorporate the dual constraints of quantum information and classical features.
Quantum computing, based on quantum theory, holds great promise as an advanced computational paradigm for achieving fast computations. Quantum algorithms are expected to surpass their classical counterparts in terms of computational complexity for certain tasks, including machine learning. In this paper, we design, implement, and evaluate three hybrid quantum k-Means algorithms, exploiting different degrees of parallelism. Indeed, each algorithm incrementally leverages quantum parallelism to reduce the complexity of the cluster assignment step up to a constant cost. In particular, we exploit quantum phenomena to speed up the computation of distances. The core idea is that the computation of distances between records and centroids can be executed simultaneously, thus saving time, especially for big datasets. We show that our hybrid quantum k-Means algorithms are theoretically faster than the classical algorithm, while experiments suggest that it is possible to obtain comparable clustering results.
Clustering is a fundamental task in data science that aims to group data based on their similarities. However, defining similarity is often ambiguous, making it challenging to determine the most appropriate objective function for a given dataset. Traditional clustering methods, such as the k -means algorithm and weighted maximum k -cut, focus on specific objectives—typically relying on average or pairwise characteristics of the data—leading to performance that is highly data-dependent. Moreover, incorporating practical constraints into clustering objectives is not straightforward, and these problems are known to be NP-hard. In this study, we formulate the clustering problem as a search for the ground state of a Hamiltonian, providing greater flexibility in defining clustering objectives and incorporating constraints. This approach enables the application of various quantum simulation techniques, including both circuit-based quantum computation and quantum annealing, thereby opening a path toward quantum advantage in solving clustering problems. We propose various Hamiltonians to accommodate different clustering objectives, including the ability to combine multiple objectives and incorporate constraints. We evaluate the clustering performance through numerical simulations and implementations on the D-Wave quantum annealer. The results demonstrate the broad applicability of our approach to a variety of clustering problems on current quantum devices. Furthermore, we find that Hamiltonians designed for specific clustering objectives and constraints impose different requirements for qubit connectivity, indicating that certain clustering tasks are better suited to specific quantum hardware. Our experimental results highlight this by identifying the Hamiltonian that optimally utilizes the physical qubits available in the D-Wave System.
Distinguishing different quantum states is a fundamental task having practical applications in information processing. Despite the effort devoted so far, however, strategies for optimal discrimination are known only for specific examples. In this paper we consider the problem of minimum-error quantum state discrimination where one attempts to minimize the average error. We show the general structure of minimum-error state discrimination as well as useful properties to derive analytic solutions. Based on the general structure, we present a geometric formulation of the problem, which can be applied to cases where quantum state geometry is clear. We also introduce equivalent classes of sets of quantum states in terms of minimum-error discrimination: sets of quantum states in an equivalent class that share the same guessing probability. In particular, for qubit states where the state geometry is found with the Bloch sphere, we illustrate that for an arbitrary set of qubit states, the minimum-error state discrimination with equal prior probabilities can be analytically solved, that is, optimal measurement and the guessing probability are explicitly obtained.
In the problem of quantum channel discrimination, one distinguishes between a given number of quantum channels, which is done by sending an input state through a channel and measuring the output state. This work studies applications of variational quantum circuits and machine-learning techniques for discriminating such channels. In particular, we explore (i) the practical implementation of embedding this task into the framework of variational quantum computing, (ii) training a quantum classifier based on variational quantum circuits, and (iii) applying the quantum kernel estimation technique. For testing these three channel discrimination approaches, we considered a pair of entanglement-breaking channels and the depolarizing channel with two different depolarization factors. For the approach (i), we address solving the quantum channel discrimination problem using widely discussed parallel and sequential strategies. We show the advantage of the latter in terms of better convergence with less quantum resources. Quantum channel discrimination with a variational quantum classifier (ii) allows one to operate even with random and mixed input states and simple variational circuits. The kernel-based classification approach (iii) is also found effective as it allows one to discriminate depolarizing channels associated not with just fixed values of the depolarization factor, but with ranges of it. Additionally, we discovered that a simple modification of one of the commonly used kernels significantly increases the efficiency of this approach. Finally, our numerical findings reveal that the performance of variational methods of channel discrimination depends on the trace of the product of the output states. These findings demonstrate that quantum machine learning can be used to discriminate channels, such as those representing physical noise processes.