Improving Quantum Classifier Performance in NISQ Computers by Voting
Strategy from Ensemble Learning
- URL: http://arxiv.org/abs/2210.01656v3
- Date: Sat, 17 Dec 2022 21:08:42 GMT
- Title: Improving Quantum Classifier Performance in NISQ Computers by Voting
Strategy from Ensemble Learning
- Authors: Ruiyang Qin, Zhiding Liang, Jinglei Cheng, Peter Kogge, and Yiyu Shi
- Abstract summary: Large error rates occur in quantum algorithms due to quantum decoherence and imprecision of quantum gates.
In this study, we suggest that ensemble quantum classifiers be optimized with plurality voting.
- Score: 9.257859576573942
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Due to the immense potential of quantum computers and the significant
computing overhead required in machine learning applications, the variational
quantum classifier (VQC) has received a lot of interest recently for image
classification. The performance of VQC is jeopardized by the noise in Noisy
Intermediate-Scale Quantum (NISQ) computers, which is a significant hurdle. It
is crucial to remember that large error rates occur in quantum algorithms due
to quantum decoherence and imprecision of quantum gates. Previous studies have
looked towards using ensemble learning in conventional computing to reduce
quantum noise. We also point out that the simple average aggregation in
classical ensemble learning may not work well for NISQ computers due to the
unbalanced confidence distribution in VQC. Therefore, in this study, we suggest
that ensemble quantum classifiers be optimized with plurality voting. On the
MNIST dataset and IBM quantum computers, experiments are carried out. The
results show that the suggested method can outperform state-of-the-art on two-
and four-class classifications by up to 16.0% and 6.1% , respectively.
Related papers
- A Quantum-Classical Collaborative Training Architecture Based on Quantum
State Fidelity [50.387179833629254]
We introduce a collaborative classical-quantum architecture called co-TenQu.
Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting.
It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
arXiv Detail & Related papers (2024-02-23T14:09:41Z) - QUILT: Effective Multi-Class Classification on Quantum Computers Using
an Ensemble of Diverse Quantum Classifiers [11.536317744969514]
Quilt is a framework for performing multi-class classification task on error-prone quantum computers.
It demonstrates up to 85% multi-class classification accuracy with the MNIST dataset on a five-qubit system.
arXiv Detail & Related papers (2023-09-26T16:36:11Z) - Quafu-RL: The Cloud Quantum Computers based Quantum Reinforcement
Learning [0.0]
In this work, we take the first step towards executing benchmark quantum reinforcement problems on real devices equipped with at most 136 qubits on BAQIS Quafu quantum computing cloud.
The experimental results demonstrate that the Reinforcement Learning (RL) agents are capable of achieving goals that are slightly relaxed both during the training and inference stages.
arXiv Detail & Related papers (2023-05-29T09:13:50Z) - Boosted Ensembles of Qubit and Continuous Variable Quantum Support
Vector Machines for B Meson Flavour Tagging [0.7232471205719458]
We develop and apply quantum machine learning methods to B meson tagging.
We simulate boosted ensembles of quantum support vector machines based on both conventional qubit-based and continuous variable architectures.
We find evidence that continuous variable QSVMs beyond the classically simulable regime may be able to realise even higher performance.
arXiv Detail & Related papers (2023-05-04T11:04:06Z) - Quantum Imitation Learning [74.15588381240795]
We propose quantum imitation learning (QIL) with a hope to utilize quantum advantage to speed up IL.
We develop two QIL algorithms, quantum behavioural cloning (Q-BC) and quantum generative adversarial imitation learning (Q-GAIL)
Experiment results demonstrate that both Q-BC and Q-GAIL can achieve comparable performance compared to classical counterparts.
arXiv Detail & Related papers (2023-04-04T12:47:35Z) - QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional
Networks [124.7972093110732]
We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations.
To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections.
Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
arXiv Detail & Related papers (2022-11-09T21:43:16Z) - Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources.
The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
arXiv Detail & Related papers (2022-09-16T02:37:32Z) - Optimal quantum reservoir computing for the NISQ era [0.0]
In this Letter, we provide a criterion to select optimal quantum reservoirs, requiring few and simple gates.
Our findings demonstrate that they render better results than other commonly used models with significantly less gates, and also provide insight on the theoretical gap between quantum reservoir computing and the theory of quantum states complexity.
arXiv Detail & Related papers (2022-05-20T12:00:27Z) - Quantum Federated Learning with Quantum Data [87.49715898878858]
Quantum machine learning (QML) has emerged as a promising field that leans on the developments in quantum computing to explore large complex machine learning problems.
This paper proposes the first fully quantum federated learning framework that can operate over quantum data and, thus, share the learning of quantum circuit parameters in a decentralized manner.
arXiv Detail & Related papers (2021-05-30T12:19:27Z) - Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
We propose a resource and runtime efficient scheme termed quantum architecture search (QAS)
QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates.
We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
arXiv Detail & Related papers (2020-10-20T12:06:27Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.