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

arXiv:2406.04944

Quantum Classification through Tournament Voting for Robust Single-Shot Inference

Nathaniel Helgesen, Jan-Åke Larsson, Michael Felsberg

Published Jun 7, 2024• 0 citations
arXivHTMLPDF

Abstract

Quantum machine learning (QML) promises powerful classification capabilities, but suffers from fragile output encodings and high sampling demands -- especially in multiclass settings. Traditional schemes such as one-hot and binary encoding either produce interpretable outputs too rarely or require many shots to achieve reliable predictions. We propose a decision aggregation framework for quantum multiclass classification based on round-robin tournament scoring. Each output qubit represents a binary comparison between class pairs, and the final prediction is determined by majority wins. This structure improves both the resolvability and accuracy of single-shot predictions, outperforming standard encodings under fixed shot-count conditions. Our method retains global entanglement while localizing decision tasks, enabling interpretable inference that remains reliable under intrinsic quantum randomness, without sacrificing expressivity. Empirical results show that this approach achieves high accuracy and interpretability under fixed shot-count measurements, suggesting a promising direction for future quantum classifiers.

DOI
10.48550/arxiv.2406.04944

Related papers

Exploring Bagging Ensemble of Variational Quantum Classifiers with Out of Bag Weighting for Breast Cancer Diagnosis

Abhikarsha Sil, Barkha Soni, Nilay Khare

In recent years, quantum machine learning (QML) has emerged as a promising approach for medical decision-making, with representative methods such as Quantum Support Vector Machines (QSVMs), Quantum Neural Networks (QNNs), and Variational Quantum Circuits (VQCs). Among these, VQCs are distinguished by their expressive capability; however, their training on small biomedical datasets often results in instability and high variance. To address this issue, we propose a heterogeneous ensemble of six shallow VQCs evaluated on the Wisconsin Breast Cancer Diagnostic (WBCD) dataset, which contains 569 diagnostic samples characterized by 30 cytological features and binary class labels differentiating benign and malignant cases. The ensemble introduces diversity through distinct feature maps, circuit architectures, and optimization strategies, using rotation gates (RX, RY, RZ) combined with entangling layers (CNOT, CZ). Model reliability is estimated from out-of-bag errors, with normalized weights calculated as the inverse of the mean squared error, and final decisions obtained via weighted soft voting. The preprocessing pipeline involves median imputation and standardization, followed by principal component analysis (PCA) to compress the 30-dimensional space into three to four principal components for quantum encoding. In our experiments, individual VQCs trained on the full dataset exhibited unstable accuracies ranging from 80% to 96% across three–four qubits, whereas the proposed ensemble achieved consistent performance of 95.71% (3 qubits) and 96.43% (4 qubits), reducing variance and matching strong classical baselines such as SVM and Random Forest. All models were implemented in PennyLane, utilizing the Lightning.qubit simulator for shot-free optimization and the default.mixed device for noise-aware evaluation, demonstrating the potential of weighted quantum ensembles for reliable biomedical classification.

Procedia Computer Science•Jan 1, 2026•0 citations

Empirical Study of Observable Sets in Multiclass Quantum Classification

Paul San Sebastian, Mikel Cañizo, Roman Orus

Variational quantum algorithms have gained attention as early applications of quantum computers for learning tasks. In the context of supervised learning, most of the works that tackle classification problems with parameterized quantum circuits constrain their scope to the setting of binary classification or perform multiclass classification via ensembles of binary classifiers (strategies such as one versus rest). Those few works that propose native multiclass models, however, do not justify the choice of observables that perform the classification. This work studies two main classification criteria in multiclass quantum machine learning: maximizing the expected value of an observable representing a class or maximizing the fidelity of the encoded quantum state with a reference state representing a class. To compare both approaches, sets of Pauli strings and sets of projectors into the computational basis are chosen as observables in the quantum machine learning models. Observing the empirical behavior of each model type, the effect of different observable set choices on the performance of quantum machine learning models is analyzed in the context of Barren Plateaus and Neural Collapse. The results provide insights that may guide the design of future multiclass quantum machine learning models.

quant-pharXiv:2602.08485•Feb 10, 2026•0 citations

Towards Quantum Machine Learning for Malicious Code Analysis

Jesus Lopez, Saeefa Rubaiyet Nowmi, Viviana Cadena +1 more

Classical machine learning (CML) has been extensively studied for malware classification. With the emergence of quantum computing, quantum machine learning (QML) presents a paradigm-shifting opportunity to improve malware detection, though its application in this domain remains largely unexplored. In this study, we investigate two hybrid quantumclassical models - a Quantum Multilayer Perceptron (QMLP) and a Quantum Convolutional Neural Network (QCNN), for malware classification. Both models utilize angle embedding to encode malware features into quantum states. QMLP captures complex patterns through full qubit measurement and data reuploading, while QCNN achieves faster training via quantum convolution and pooling layers that reduce active qubits. We evaluate both models on five widely used malware datasets -API-Graph, EMBER-Domain, EMBER-Class, AZ-Domain, and AZ-Class, across binary and multiclass classification tasks. Our results show high accuracy for binary classification$\mathbf{9 5 - 9 6 \%}$on API-Graph, 91-92% on AZ-Domain, and$\mathbf{7 7 \%}$on EMBER-Domain. In multiclass settings, accuracy ranges from 91.6-95.7% on API-Graph, 41.7-93.6% on AZ-Class, and 60.7-88.1% on EMBER-Class. Overall, QMLP outperforms QCNN in complex multiclass tasks, while QCNN offers improved training efficiency at the cost of reduced accuracy.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•2 citations

Single-shot quantum machine learning

Erik Recio-Armengol, Jens Eisert, Johannes Jakob Meyer

Quantum machine learning aims to improve learning methods through the use of quantum computers. If it is to ever realize its potential, many obstacles need to be overcome. A particularly pressing one arises at the prediction stage because the outputs of quantum learning models are inherently random. This creates an often considerable overhead, as many executions of a quantum learning model have to be aggregated to obtain an actual prediction. In this work, we analyze when quantum learning models can evade this issue and produce predictions in a near-deterministic way—paving the way to single-shot quantum machine learning. We give a rigorous definition of single shotness in quantum classifiers and show that the degree to which a quantum learning model is near deterministic is constrained by the distinguishability of the embedded quantum states used in the model. Opening the black box of the embedding, we show that if the embedding is realized by quantum circuits, a certain depth is necessary for single shotness to be even possible. We conclude by showing that quantum learning models cannot be single shot in a generic way and trainable at the same time.

arXiv:2406.13812•Physical Review A•Apr 15, 2025•12 citations

Quantum Machine Learning for Image Classification: A Controlled Benchmark

Kuan Huang, Meng Xu, Yingfeng Wang

Image-based quantum machine learning usually follows a hybrid pipeline: a classical encoder compresses an image, and a quantum circuit then acts as a kernel, feature map, trainable classifier, or measurement-based readout. Yet it remains unclear which of these roles contributes useful predictive structure because prior studies often change the input representation, classical baseline, and measurement budget simultaneously. We present a controlled benchmark spanning five roles: quantum-kernel geometry, fixed product and entangled features, trainable data-reuploading representations, shot-aware probability readout, and task-adaptive Pauli measurement. Six quantum-derived methods, six matched classical controls, and two unmatched neural references are evaluated on MNIST, Fashion-MNIST, CIFAR-10, and BreastMNIST using a shared frozen ResNet-18 and train-only PCA interface. We assess exact and finite-shot inference, predictive performance, calibration, selective risk, resource requirements, and statistical reliability. PdrQC-Matched was the strongest quantum-derived method on all four datasets. C-RBF was better on Fashion-MNIST and CIFAR-10 by 2.19 and 3.50 accuracy points, while BreastMNIST showed no detectable difference. Despite lower exact accuracy, PdrQC-Matched achieved significantly lower Brier score and AURC than C-RBF on Fashion-MNIST and CIFAR-10. Finite-shot results showed no automatic benefit from entanglement or shot-aware training. Overall, image-QML conclusions depend on quantum role, measurement budget, classical control, and evaluation metric.

Proceedings of the AAAI Symposium Series•Nov 6, 2026•0 citations

Development of hybrid quantum classifiers for realistic classification tasks

Sara Aminpour, Safura Sharifi, Yaser Mike Banad

Abstract Hybrid quantum machine learning combines classical minimization with parameterized quantum circuits, enabling powerful learning models even on near-term quantum hardware. This work presents an evaluation of hybrid quantum machine learning classifiers using the data re-uploading framework across nine binary and multi-class classification tasks with varying geometric complexity. We compare three quantum circuit architectures, single-qubit, two-qubit, and two-qubit entangled, trained with three classical minimizers: COBYLA, Nelder-Mead, and SLSQP. Our experiments span training sizes from 1 to 200 samples and reveal that two-qubit classifiers, when paired with the SLSQP minimizer, achieve the highest overall test accuracy of 99.775% on structured tasks and strong performance (up to 89.78%) on complex multi-class pattern. Among minimizers, SLSQP consistently provides the best generalization, while entanglement improves accuracy in non-linear and fragmented tasks. By analyzing accuracy trends, generalization gaps, and confusion matrices, this study offers practical guidance for designing quantum classifiers that scale effectively and generalize well, providing a foundation for real-world Hybrid quantum machine learning applications.

Journal of Physics Communications•Feb 1, 2026•1 citation
Quantum machine learning (QML) promises powerful classification capabilities, but suffers from fragile output encodings and high sampling demands -- especially in multiclass settings. Traditional schemes such as one-hot and binary encoding either produce interpretable outputs too rarely or require many shots to achieve reliable predictions. We propose a decision aggregation framework for quantum multiclass classification based on round-robin tournament scoring. Each output qubit represents a binary comparison between class pairs, and the final prediction is determined by majority wins. This structure improves both the resolvability and accuracy of single-shot predictions, outperforming standard encodings under fixed shot-count conditions. Our method retains global entanglement while localizing decision tasks, enabling interpretable inference that remains reliable under intrinsic quantum randomness, without sacrificing expressivity. Empirical results show that this approach achieves high accuracy and interpretability under fixed shot-count measurements, suggesting a promising direction for future quantum classifiers.
In recent years, quantum machine learning (QML) has emerged as a promising approach for medical decision-making, with representative methods such as Quantum Support Vector Machines (QSVMs), Quantum Neural Networks (QNNs), and Variational Quantum Circuits (VQCs). Among these, VQCs are distinguished by their expressive capability; however, their training on small biomedical datasets often results in instability and high variance. To address this issue, we propose a heterogeneous ensemble of six shallow VQCs evaluated on the Wisconsin Breast Cancer Diagnostic (WBCD) dataset, which contains 569 diagnostic samples characterized by 30 cytological features and binary class labels differentiating benign and malignant cases. The ensemble introduces diversity through distinct feature maps, circuit architectures, and optimization strategies, using rotation gates (RX, RY, RZ) combined with entangling layers (CNOT, CZ). Model reliability is estimated from out-of-bag errors, with normalized weights calculated as the inverse of the mean squared error, and final decisions obtained via weighted soft voting. The preprocessing pipeline involves median imputation and standardization, followed by principal component analysis (PCA) to compress the 30-dimensional space into three to four principal components for quantum encoding. In our experiments, individual VQCs trained on the full dataset exhibited unstable accuracies ranging from 80% to 96% across three–four qubits, whereas the proposed ensemble achieved consistent performance of 95.71% (3 qubits) and 96.43% (4 qubits), reducing variance and matching strong classical baselines such as SVM and Random Forest. All models were implemented in PennyLane, utilizing the Lightning.qubit simulator for shot-free optimization and the default.mixed device for noise-aware evaluation, demonstrating the potential of weighted quantum ensembles for reliable biomedical classification.
Variational quantum algorithms have gained attention as early applications of quantum computers for learning tasks. In the context of supervised learning, most of the works that tackle classification problems with parameterized quantum circuits constrain their scope to the setting of binary classification or perform multiclass classification via ensembles of binary classifiers (strategies such as one versus rest). Those few works that propose native multiclass models, however, do not justify the choice of observables that perform the classification. This work studies two main classification criteria in multiclass quantum machine learning: maximizing the expected value of an observable representing a class or maximizing the fidelity of the encoded quantum state with a reference state representing a class. To compare both approaches, sets of Pauli strings and sets of projectors into the computational basis are chosen as observables in the quantum machine learning models. Observing the empirical behavior of each model type, the effect of different observable set choices on the performance of quantum machine learning models is analyzed in the context of Barren Plateaus and Neural Collapse. The results provide insights that may guide the design of future multiclass quantum machine learning models.
Classical machine learning (CML) has been extensively studied for malware classification. With the emergence of quantum computing, quantum machine learning (QML) presents a paradigm-shifting opportunity to improve malware detection, though its application in this domain remains largely unexplored. In this study, we investigate two hybrid quantumclassical models - a Quantum Multilayer Perceptron (QMLP) and a Quantum Convolutional Neural Network (QCNN), for malware classification. Both models utilize angle embedding to encode malware features into quantum states. QMLP captures complex patterns through full qubit measurement and data reuploading, while QCNN achieves faster training via quantum convolution and pooling layers that reduce active qubits. We evaluate both models on five widely used malware datasets -API-Graph, EMBER-Domain, EMBER-Class, AZ-Domain, and AZ-Class, across binary and multiclass classification tasks. Our results show high accuracy for binary classification95−96%\mathbf{9 5 - 9 6 \%}95−96%on API-Graph, 91-92% on AZ-Domain, and77%\mathbf{7 7 \%}77%on EMBER-Domain. In multiclass settings, accuracy ranges from 91.6-95.7% on API-Graph, 41.7-93.6% on AZ-Class, and 60.7-88.1% on EMBER-Class. Overall, QMLP outperforms QCNN in complex multiclass tasks, while QCNN offers improved training efficiency at the cost of reduced accuracy.
Quantum machine learning aims to improve learning methods through the use of quantum computers. If it is to ever realize its potential, many obstacles need to be overcome. A particularly pressing one arises at the prediction stage because the outputs of quantum learning models are inherently random. This creates an often considerable overhead, as many executions of a quantum learning model have to be aggregated to obtain an actual prediction. In this work, we analyze when quantum learning models can evade this issue and produce predictions in a near-deterministic way—paving the way to single-shot quantum machine learning. We give a rigorous definition of single shotness in quantum classifiers and show that the degree to which a quantum learning model is near deterministic is constrained by the distinguishability of the embedded quantum states used in the model. Opening the black box of the embedding, we show that if the embedding is realized by quantum circuits, a certain depth is necessary for single shotness to be even possible. We conclude by showing that quantum learning models cannot be single shot in a generic way and trainable at the same time.
Image-based quantum machine learning usually follows a hybrid pipeline: a classical encoder compresses an image, and a quantum circuit then acts as a kernel, feature map, trainable classifier, or measurement-based readout. Yet it remains unclear which of these roles contributes useful predictive structure because prior studies often change the input representation, classical baseline, and measurement budget simultaneously. We present a controlled benchmark spanning five roles: quantum-kernel geometry, fixed product and entangled features, trainable data-reuploading representations, shot-aware probability readout, and task-adaptive Pauli measurement. Six quantum-derived methods, six matched classical controls, and two unmatched neural references are evaluated on MNIST, Fashion-MNIST, CIFAR-10, and BreastMNIST using a shared frozen ResNet-18 and train-only PCA interface. We assess exact and finite-shot inference, predictive performance, calibration, selective risk, resource requirements, and statistical reliability. PdrQC-Matched was the strongest quantum-derived method on all four datasets. C-RBF was better on Fashion-MNIST and CIFAR-10 by 2.19 and 3.50 accuracy points, while BreastMNIST showed no detectable difference. Despite lower exact accuracy, PdrQC-Matched achieved significantly lower Brier score and AURC than C-RBF on Fashion-MNIST and CIFAR-10. Finite-shot results showed no automatic benefit from entanglement or shot-aware training. Overall, image-QML conclusions depend on quantum role, measurement budget, classical control, and evaluation metric.
Abstract Hybrid quantum machine learning combines classical minimization with parameterized quantum circuits, enabling powerful learning models even on near-term quantum hardware. This work presents an evaluation of hybrid quantum machine learning classifiers using the data re-uploading framework across nine binary and multi-class classification tasks with varying geometric complexity. We compare three quantum circuit architectures, single-qubit, two-qubit, and two-qubit entangled, trained with three classical minimizers: COBYLA, Nelder-Mead, and SLSQP. Our experiments span training sizes from 1 to 200 samples and reveal that two-qubit classifiers, when paired with the SLSQP minimizer, achieve the highest overall test accuracy of 99.775% on structured tasks and strong performance (up to 89.78%) on complex multi-class pattern. Among minimizers, SLSQP consistently provides the best generalization, while entanglement improves accuracy in non-linear and fragmented tasks. By analyzing accuracy trends, generalization gaps, and confusion matrices, this study offers practical guidance for designing quantum classifiers that scale effectively and generalize well, providing a foundation for real-world Hybrid quantum machine learning applications.