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:2604.16877 · Chinese Physics B

PdrQC: Pauli-space Discriminative Representations based Quantum Classifier

Yuhang Tu, Jinfan Wang, Hao Huang, Le Wang, Shengmei Zhao, Anqi Zhang

quant-phSubmitted Apr 18, 2026• Announced Apr 21, 2026• 0 citations• Revised Aug 8, 2026 (v2)
v1 · Apr 18, 2026v2 · Aug 8, 2026
arXivHTMLPDF

Abstract

Quantum classification faces two key challenges. First, the difficulty of distinguishing between different classes varies: some class pairs are easy to separate, while others are more challenging. Second, practical execution is affected by noise, finite sampling, and measurement overhead. To address these issues, we propose the Pauli-Space Discriminative-Representation based Quantum Classifier (PdrQC), a framework for task-adaptive multiclass quantum classification. The method evaluates candidate upload circuits using low-weight Pauli features and formulates upload design as a structured model selection problem based on discriminative representations. By progressively selecting upload structures and compact Pauli readout features for the target multiclass task, the framework achieves a better balance between classification accuracy and resource efficiency. Numerical simulations were conducted on the MNIST and Fashion-MNIST datasets with $K\in\{2,3,5,7,10\}$. The results demonstrate that PdrQC, through its task-adaptive Pauli representation, achieves an effective balance among multiclass classification accuracy, quantum-circuit complexity, and measurement overhead, making it suitable for multiclass quantum classification under limited hardware resources.

Comments
13 pages, 6 figures, 1 table. Substantially revised version: the PAPUS framework has been reformulated as PdrQC, with extensive revisions to the classifier framework, methodology, numerical-simulation analysis, and presentation

Related papers

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

ANQOR: Anchor-based Quantum Multi-class Image Classification

A K M Muhitul Islam, Yafan Huang, Yan Yan +1 more

Quantum machine learning offers a potential pathway for addressing the computational challenges associated with high-dimensional data processing. However, existing quantum approaches to multi-class image classification often exhibit substantial performance degradation when transitioning from idealized quantum simulators to noisy intermediate-scale quantum (NISQ) hardware, limiting their practical applicability. In this work, we introduce ANQOR, an anchor-based quantum classification framework that reformulates a C-class classification problem as an ensemble of (C− 1) binary variational quantum classifiers (VQCs) defined with respect to a fixed reference class. The proposed anchor-based formulation reduces circuit depth, gate count, and measurement overhead by constraining each classifier to a shared circuit structure and limiting the growth of quantum resources with increasing class count. Extensive evaluations are conducted using the MNIST and FashionMNIST datasets. Simulator-based experiments demonstrate the impact of anchor selection and circuit depth on classification performance, while hardware-based inference on IBM NISQ hardware evaluates robustness under realistic noise conditions. Across increasing task sizes, the proposed framework exhibits a consistent and bounded discrepancy between simulator and hardware performance, indicating controlled generalization behavior as classification complexity increases. These results suggest that structuring multi-class quantum classification around anchor-based binary VQCs provides a practical design strategy for deploying quantum classifiers on NISQ devices.

IEEE Cloud Summit•Jun 1, 2026•0 citations

Scalable parameterized quantum circuits classifier

Xiaodong Ding, Zhihui Song, Jinchen Xu +3 more

As a generalized quantum machine learning model, parameterized quantum circuits (PQC) have been found to perform poorly in terms of classification accuracy and model scalability for multi-category classification tasks. To address this issue, we propose a scalable parameterized quantum circuits classifier (SPQCC), which performs per-channel PQC and combines the measurements as the output of the trainable parameters of the classifier. By minimizing the cross-entropy loss through optimizing the trainable parameters of PQC, SPQCC leads to a fast convergence of the classifier. The parallel execution of identical PQCs on different quantum machines with the same structure and scale reduces the complexity of classifier design. Classification simulations performed on the MNIST Dataset show that the accuracy of our proposed classifier far exceeds that of other quantum classification algorithms, achieving the state-of-the-art simulation result and surpassing/reaching classical classifiers with a considerable number of trainable parameters. Our classifier demonstrates excellent scalability and classification performance.

Scientific Reports•Jul 10, 2024•26 citations

QMDUC: quantum multi-channel data uploading convolution for image classification

Han Qi, Shengjun Wang, Hao Wang +2 more

Abstract Hybrid Quantum-Classical Convolutional Neural Networks (HQCNNs) show significant potential for image classification by embedding quantum circuits as convolutional kernels within classical CNNs, leveraging quantum computing to enhance feature extraction. While this approach provides a feasible pathway toward achieving quantum advantage under current Noisy Intermediate-Scale Quantum (NISQ) hardware constraints, existing HQCNNs face critical challenges, including limited classification accuracy and excessive quantum resource consumption when processing multi-channel data. To address these issues, this paper proposes the Quantum Multi-channel Data Uploading Convolution (QMDUC) method, which employs data re-uploading techniques to optimize quantum data encoding strategies, significantly reducing qubit requirements while maintaining complex data processing capabilities. QMDUC supports two encoding modes: Channel-Priority QMDUC (CP-QMDUC) and Data-Priority QMDUC (DP-QMDUC), enabling flexible trade-offs between qubit count and circuit depth, thereby providing adaptive solutions tailored to different quantum hardware constraints. Experimental validation on the CIFAR-10 three-channel color image dataset and Fashion-MNIST single-channel grayscale image dataset demonstrates that QMDUC significantly outperforms existing HQCNN methods in both classification accuracy and quantum resource efficiency. Specifically, under low-resource configurations, the proposed method achieves an approximate reduction in qubit requirements of 75%–95% while maintaining comparable or superior accuracy; under higher-resource configurations, it achieves approximately 10% improvement in peak accuracy with comparable qubit consumption to existing methods, providing an effective technical pathway for practical applications of quantum machine learning in computer vision.

Physica Scripta•Mar 20, 2026•1 citation

Designing quantum multi-category classifier from the perspective of brain processing information

Xiaodong Ding, Jinchen Xu, Zhihui Song +2 more

Abstract In the field of machine learning, the multi-category classification problem plays a crucial role. Solving the problem has a profound impact on driving the innovation and development of machine learning techniques and addressing complex problems in the real world. In recent years, researchers have begun to focus on utilizing quantum computing to solve the multi-category classification problem. Some studies have shown that the process of processing information in the brain may be related to quantum phenomena, with different brain regions having neurons with different structures. Inspired by this, we design a quantum multi-category classifier model from this perspective for the first time. The model employs a heterogeneous population of quantum neural networks (QNNs) to simulate the cooperative work of multiple different brain regions. When processing information, these heterogeneous clusters of QNNs allow for simultaneous execution on different quantum computers, thus simulating the brain’s ability to utilize multiple brain regions working in concert to maintain the robustness of the model. By setting the number of heterogeneous QNN clusters and parameterizing the number of stacks of unit layers in the quantum circuit, the model demonstrates excellent scalability in dealing with different types of data and different numbers of classes in the classification problem. Based on the attention mechanism of the brain, we integrate the processing results of heterogeneous QNN clusters to achieve high accuracy in classification. Finally, we conducted classification simulation experiments on different datasets. The results show that our method exhibits strong robustness and scalability. Among them, on different subsets of the MNIST dataset, its classification accuracy improves by up to about 5% compared to other quantum multiclassification algorithms. This result becomes the state-of-the-art simulation result for quantum classification models and exceeds the performance of classical classifiers with a considerable number of trainable parameters on some subsets of the MNIST dataset.

Machine Learning Science and Technology•Aug 29, 2024•3 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 classification faces two key challenges. First, the difficulty of distinguishing between different classes varies: some class pairs are easy to separate, while others are more challenging. Second, practical execution is affected by noise, finite sampling, and measurement overhead. To address these issues, we propose the Pauli-Space Discriminative-Representation based Quantum Classifier (PdrQC), a framework for task-adaptive multiclass quantum classification. The method evaluates candidate upload circuits using low-weight Pauli features and formulates upload design as a structured model selection problem based on discriminative representations. By progressively selecting upload structures and compact Pauli readout features for the target multiclass task, the framework achieves a better balance between classification accuracy and resource efficiency. Numerical simulations were conducted on the MNIST and Fashion-MNIST datasets with K∈{2,3,5,7,10}K\in\{2,3,5,7,10\}K∈{2,3,5,7,10}. The results demonstrate that PdrQC, through its task-adaptive Pauli representation, achieves an effective balance among multiclass classification accuracy, quantum-circuit complexity, and measurement overhead, making it suitable for multiclass quantum classification under limited hardware resources.
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.
Quantum machine learning offers a potential pathway for addressing the computational challenges associated with high-dimensional data processing. However, existing quantum approaches to multi-class image classification often exhibit substantial performance degradation when transitioning from idealized quantum simulators to noisy intermediate-scale quantum (NISQ) hardware, limiting their practical applicability. In this work, we introduce ANQOR, an anchor-based quantum classification framework that reformulates a C-class classification problem as an ensemble of (C− 1) binary variational quantum classifiers (VQCs) defined with respect to a fixed reference class. The proposed anchor-based formulation reduces circuit depth, gate count, and measurement overhead by constraining each classifier to a shared circuit structure and limiting the growth of quantum resources with increasing class count. Extensive evaluations are conducted using the MNIST and FashionMNIST datasets. Simulator-based experiments demonstrate the impact of anchor selection and circuit depth on classification performance, while hardware-based inference on IBM NISQ hardware evaluates robustness under realistic noise conditions. Across increasing task sizes, the proposed framework exhibits a consistent and bounded discrepancy between simulator and hardware performance, indicating controlled generalization behavior as classification complexity increases. These results suggest that structuring multi-class quantum classification around anchor-based binary VQCs provides a practical design strategy for deploying quantum classifiers on NISQ devices.
As a generalized quantum machine learning model, parameterized quantum circuits (PQC) have been found to perform poorly in terms of classification accuracy and model scalability for multi-category classification tasks. To address this issue, we propose a scalable parameterized quantum circuits classifier (SPQCC), which performs per-channel PQC and combines the measurements as the output of the trainable parameters of the classifier. By minimizing the cross-entropy loss through optimizing the trainable parameters of PQC, SPQCC leads to a fast convergence of the classifier. The parallel execution of identical PQCs on different quantum machines with the same structure and scale reduces the complexity of classifier design. Classification simulations performed on the MNIST Dataset show that the accuracy of our proposed classifier far exceeds that of other quantum classification algorithms, achieving the state-of-the-art simulation result and surpassing/reaching classical classifiers with a considerable number of trainable parameters. Our classifier demonstrates excellent scalability and classification performance.
Abstract Hybrid Quantum-Classical Convolutional Neural Networks (HQCNNs) show significant potential for image classification by embedding quantum circuits as convolutional kernels within classical CNNs, leveraging quantum computing to enhance feature extraction. While this approach provides a feasible pathway toward achieving quantum advantage under current Noisy Intermediate-Scale Quantum (NISQ) hardware constraints, existing HQCNNs face critical challenges, including limited classification accuracy and excessive quantum resource consumption when processing multi-channel data. To address these issues, this paper proposes the Quantum Multi-channel Data Uploading Convolution (QMDUC) method, which employs data re-uploading techniques to optimize quantum data encoding strategies, significantly reducing qubit requirements while maintaining complex data processing capabilities. QMDUC supports two encoding modes: Channel-Priority QMDUC (CP-QMDUC) and Data-Priority QMDUC (DP-QMDUC), enabling flexible trade-offs between qubit count and circuit depth, thereby providing adaptive solutions tailored to different quantum hardware constraints. Experimental validation on the CIFAR-10 three-channel color image dataset and Fashion-MNIST single-channel grayscale image dataset demonstrates that QMDUC significantly outperforms existing HQCNN methods in both classification accuracy and quantum resource efficiency. Specifically, under low-resource configurations, the proposed method achieves an approximate reduction in qubit requirements of 75%–95% while maintaining comparable or superior accuracy; under higher-resource configurations, it achieves approximately 10% improvement in peak accuracy with comparable qubit consumption to existing methods, providing an effective technical pathway for practical applications of quantum machine learning in computer vision.
Abstract In the field of machine learning, the multi-category classification problem plays a crucial role. Solving the problem has a profound impact on driving the innovation and development of machine learning techniques and addressing complex problems in the real world. In recent years, researchers have begun to focus on utilizing quantum computing to solve the multi-category classification problem. Some studies have shown that the process of processing information in the brain may be related to quantum phenomena, with different brain regions having neurons with different structures. Inspired by this, we design a quantum multi-category classifier model from this perspective for the first time. The model employs a heterogeneous population of quantum neural networks (QNNs) to simulate the cooperative work of multiple different brain regions. When processing information, these heterogeneous clusters of QNNs allow for simultaneous execution on different quantum computers, thus simulating the brain’s ability to utilize multiple brain regions working in concert to maintain the robustness of the model. By setting the number of heterogeneous QNN clusters and parameterizing the number of stacks of unit layers in the quantum circuit, the model demonstrates excellent scalability in dealing with different types of data and different numbers of classes in the classification problem. Based on the attention mechanism of the brain, we integrate the processing results of heterogeneous QNN clusters to achieve high accuracy in classification. Finally, we conducted classification simulation experiments on different datasets. The results show that our method exhibits strong robustness and scalability. Among them, on different subsets of the MNIST dataset, its classification accuracy improves by up to about 5% compared to other quantum multiclassification algorithms. This result becomes the state-of-the-art simulation result for quantum classification models and exceeds the performance of classical classifiers with a considerable number of trainable parameters on some subsets of the MNIST dataset.
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.