Wilmott

Density Matrix Classifier

Oleksiy Kondratyev

Published Apr 8, 2025• 0 citations

Abstract

The authors introduce a new type of quantum machine learning classifier based on the estimation of the Frobenius distance between density matrices. The central idea is to encode all samples in the dataset belonging to a particular class into a corresponding density matrix using the quantum feature map methodology. The same quantum feature map is used to encode every new test sample into its own corresponding density matrix. The Frobenius distances between the sample density matrix and the density matrices encoding all classes present in the training dataset are calculated. The class label is assigned by selecting the class with minimum distance. The density matrix classifier uses parameterized quantum circuits. On the Glass Identification dataset, it performed on par with, or sometimes exceeded, performance of standard classical classifiers including multi-layer perceptron, random forest, support vector machine, and logistic regression. The model is resistant to certain types of noise and is suitable for execution on NISQ computers.

DOI: 10.54946/wilm.12138

Related papers

A Classifiers Experimentation with Quantum Machine Learning

Chaiyaporn Khemapatapan, Thammanoon Thepsena, Aomduan Jeamaon

Quantum Computing is a new way to create a different type of computer system from Quantum Mechanics. Quantum machine learning is one of the applications took the benefit from qauntum computers. In this experiment, we use the IBM Qiskit library to study how well a quantum machine learning classifier works. We made two different colored dots to represent the two-class dataset. The quantum circuit can be collected from the Qiskit library. The 1stand 2ndorder feature map schemes operated by oracle quantum oracle functions are applied before making a classification. Finally, we can call the quantum support vector machine or QSVM function to classify data. Kernel matrix from the studied qauntum model shows that quantum computing can be used to clearly classify classes of the dataset with 100 percent accuracy.

International Electrical Engineering Congress (iEECON)Mar 8, 20232 citations

Variational quantum one-class classifier

Gunhee Park, Joonsuk Huh, Daniel K. Park

Abstract One-class classification (OCC) is a fundamental problem in pattern recognition with a wide range of applications. This work presents a semi-supervised quantum machine learning algorithm for such a problem, which we call a variational quantum one-class classifier (VQOCC). The algorithm is suitable for noisy intermediate-scale quantum computing because the VQOCC trains a fully-parameterized quantum autoencoder with a normal dataset and does not require decoding. The performance of the VQOCC is compared with that of the one-class support vector machine (OC-SVM), the kernel principal component analysis (PCA), and the deep convolutional autoencoder (DCAE) using handwritten digit and Fashion-MNIST datasets. The numerical experiment examined various structures of VQOCC by varying data encoding, the number of parameterized quantum circuit layers, and the size of the latent feature space. The benchmark shows that the classification performance of VQOCC is comparable to that of OC-SVM and PCA, although the number of model parameters grows only logarithmically with the data size. The quantum algorithm outperformed DCAE in most cases under similar training conditions. Therefore, our algorithm constitutes an extremely compact and effective machine learning model for OCC.

arXiv:2210.02674Machine Learning Science and TechnologyJan 3, 202326 citations

Investigation of Quantum Support Vector Machine for Classification in NISQ era

Anekait Kariya, Bikash K. Behera

Quantum machine learning is at the crossroads of two of the most exciting current areas of research; quantum computing and classical machine learning. It explores the interaction between quantum computing and machine learning, investigating how results and techniques from one field can be used to solve the problems of the other. Here, we investigate quantum support vector machine (QSVM) algorithm and its circuit version on present quantum computers. We propose a general encoding procedure extending QSVM algorithm, which would allow one to feed vectors with higher dimension in the training-data oracle of QSVM. We compute the efficiency of the QSVM circuit implementation method by encoding training and testing data sample in quantum circuits and running them on quantum simulator and real chip for two datasets; 6/9 and banknote. We highlight the technical difficulties one would face while applying the QSVM algorithm on current NISQ era devices. Then we propose a new method to classify these datasets with enhanced efficiencies for the above datasets both on simulator and real chips.

arXiv:2112.06912Dec 13, 202122 citations

Invited: Trainable Discrete Feature Embeddings for Quantum Machine Learning

Napat Thumwanit, Chayaphol Lortaraprasert, Rudy Raymond

Quantum classifiers provide sophisticated embeddings of input data in Hilbert space promising quantum advantage. The advantage stems from quantum feature maps encoding the inputs into quantum states with variational quantum circuits. A recent work shows how to map discrete features with fewer quantum bits using Quantum Random Access Coding (QRAC) to encode binary strings into quantum states. We propose a new method to embed discrete features with trainable quantum circuits by combining QRAC and a recently proposed strategy for training quantum feature map called quantum metric learning. The proposed trainable embedding requires not only as few qubits as QRAC but also overcomes the limitations of QRAC to classify inputs whose classes are based on hard Boolean functions. We numerically demonstrate its use in variational quantum classifiers to achieve better performances to classify real-world datasets, and thus its possibility to use near-term quantum computers for machine learning.

ACM/IEEE Design Automation Conference (DAC)Nov 8, 202111 citations

Quantum Minimum Distance Classifier

Enrica Santucci

We propose a quantum version of the well known minimum distance classification model called Nearest Mean Classifier (NMC). In this regard, we presented our first results in two previous works. First, a quantum counterpart of the NMC for two-dimensional problems was introduced, named Quantum Nearest Mean Classifier (QNMC), together with a possible generalization to any number of dimensions. Secondly, we studied the n-dimensional problem into detail and we showed a new encoding for arbitrary n-feature vectors into density operators. In the present paper, another promising encoding is considered, suggested by recent debates on quantum machine learning. Further, we observe a significant property concerning the non-invariance by feature rescaling of our quantum classifier. This fact, which represents a meaningful difference between the NMC and the respective quantum version, allows us to introduce a free parameter whose variation provides, in some cases, better classification results for the QNMC. The experimental section is devoted: (i) to compare the NMC and QNMC performance on different datasets; and (ii) to study the effects of the non-invariance under uniform rescaling for the QNMC.

EntropyDec 1, 201710 citations

ANHQ-IDS: A Minimax-Based Adaptive Noise-Aware Hybrid Quantum Framework with Resource Constrained Feature Selection for Network Intrusion Detection

K. Maharajan, Assoc. Prof. Abudhahir Buhari, Assoc. Prof. Ts. Dr. Tadiwa Elisha Nyamasvisva +2 more

Network intrusion detection systems (NIDS) must classify high-dimensional, heavily imbalanced traffic flows under tight operational constraints, and the flow features produced by modern capture tools routinely exceed the qubit budgets available on today’s noisy intermediate-scale quantum (NISQ) hardware. Existing quantum machine-learning (QML) detectors typically either assume that every extracted feature can be encoded on a dedicated qubit or apply generic dimensionality reduction that is blind to the downstream quantum encoder; in both cases the qubit budget — the binding constraint on real devices — never drives which features are encoded, and evaluation is frequently confined to ideal statevector simulation that omits shot noise, depolarizing error, and readout confusion. This paper presents ANHQ-IDS, an adaptive, noise aware hybrid quantum intrusion-detection framework that makes the qubit budget a first-class design constraint. A resource-constrained feature-selection stage scores candidate features through a composite objective jointly balancing mutual-information relevance, inter-feature redundancy, cross-split stability, and an explicit quantum-encoding cost, and greedily selects a subset sized to a target qubit budget rather than fixed a priori. The retained features are embedded through parameterized angle and second-order (ZZ) feature maps and classified by a hardware-efficient variational quantum classifier (VQC) trained with gradient-free optimizers (COBYLA and SPSA) under finite-shot sampling. To characterize behaviour under realistic hardware conditions, the classifier is evaluated on a statevector reference and under synthetic depolarizing and readout-error models, and benchmarked on CIC-IDS2017 against classical baselines (logistic regression, random forest, support vector machine) using a leakage-resistant train/validation/test protocol. On a class-balanced CIC-IDS2017 benchmark, the ZZ-encoded VQC attains macro-F1 0.766 and ROC-AUC 0.853 under exact simulation — exceeding logistic regression (0.502) and approaching a support-vector baseline, while a random forest remains strongest (0.964); performance degrades gracefully under depolarizing and readout noise, consistent with the predicted (1−p) contraction. All preprocessing, feature-selection, and quantum-training components are released as a reproducible Qiskit package with fixed seeds and recorded circuit-resource metadata (qubits, depth, gate and parameter counts).

Minimax Theory and its ApplicationsSep 10, 20260 citations