Variational Quantum AdaBoost with Supervised Learning Guarantee
- URL: http://arxiv.org/abs/2402.02376v1
- Date: Sun, 4 Feb 2024 07:18:44 GMT
- Title: Variational Quantum AdaBoost with Supervised Learning Guarantee
- Authors: Yabo Wang, Xin Wang, Bo Qi and Daoyi Dong
- Abstract summary: We show that variational quantum AdaBoost can achieve much higher accuracy in prediction, but also help mitigate the impact of noise.
Our work indicates that in the current NISQ era, introducing appropriate ensemble methods is particularly valuable in improving the performance of quantum machine learning algorithms.
- Score: 8.163913266445304
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Although variational quantum algorithms based on parameterized quantum
circuits promise to achieve quantum advantages, in the noisy intermediate-scale
quantum (NISQ) era, their capabilities are greatly constrained due to limited
number of qubits and depth of quantum circuits. Therefore, we may view these
variational quantum algorithms as weak learners in supervised learning.
Ensemble methods are a general technique in machine learning for combining weak
learners to construct a more accurate one. In this paper, we theoretically
prove and numerically verify a learning guarantee for variational quantum
adaptive boosting (AdaBoost). To be specific, we theoretically depict how the
prediction error of variational quantum AdaBoost on binary classification
decreases with the increase of the number of boosting rounds and sample size.
By employing quantum convolutional neural networks, we further demonstrate that
variational quantum AdaBoost can not only achieve much higher accuracy in
prediction, but also help mitigate the impact of noise. Our work indicates that
in the current NISQ era, introducing appropriate ensemble methods is
particularly valuable in improving the performance of quantum machine learning
algorithms.
Related papers
- Dissipative variational quantum algorithms for Gibbs state preparation [0.0]
We introduce dissipative variational quantum algorithms (D-VQAs) by incorporating dissipative operations, such as qubit RESET and gates, as an intrinsic part of a variational quantum circuit.
We demonstrate how such algorithms can prepare Gibbs states over a wide range of quantum many-body Hamiltonians and temperatures, while significantly reducing errors due to both coherent and non-coherent noise.
arXiv Detail & Related papers (2024-07-12T18:48:46Z) - Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
Quantum computing sets the foundation for new ways of designing algorithms.
New challenges arise concerning which field quantum speedup can be achieved.
Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
arXiv Detail & Related papers (2024-02-26T09:32:07Z) - Power Characterization of Noisy Quantum Kernels [52.47151453259434]
We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small.
We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
arXiv Detail & Related papers (2024-01-31T01:02:16Z) - Near-Term Distributed Quantum Computation using Mean-Field Corrections
and Auxiliary Qubits [77.04894470683776]
We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production.
We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
arXiv Detail & Related papers (2023-09-11T18:00:00Z) - 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) - Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state.
In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
arXiv Detail & Related papers (2021-12-27T21:15:35Z) - Recent advances for quantum classifiers [2.459525036555352]
We will review a number of quantum classification algorithms, including quantum support vector machine, quantum kernel methods, quantum decision tree, and quantum nearest neighbor algorithm.
We will then introduce the variational quantum classifiers, which are essentially variational quantum circuits for classifications.
arXiv Detail & Related papers (2021-08-30T18:00:00Z) - VSQL: Variational Shadow Quantum Learning for Classification [6.90132007891849]
We propose a new hybrid quantum-classical framework for supervised quantum learning, which we call Variational Shadow Quantum Learning.
We first use variational shadow quantum circuits to extract classical features in a convolution way and then utilize a fully-connected neural network to complete the classification task.
We show that this method could sharply reduce the number of parameters and thus better facilitate quantum circuit training.
arXiv Detail & Related papers (2020-12-15T13:51:01Z) - 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) - Reinforcement Learning with Quantum Variational Circuits [0.0]
This work explores the potential for quantum computing to facilitate reinforcement learning problems.
Specifically, we investigate the use of quantum variational circuits, a form of quantum machine learning.
Results indicate both hybrid and pure quantum variational circuit have the ability to solve reinforcement learning tasks with a smaller parameter space.
arXiv Detail & Related papers (2020-08-15T00:13:01Z) - Policy Gradient based Quantum Approximate Optimization Algorithm [2.5614220901453333]
We show that policy-gradient-based reinforcement learning algorithms are well suited for optimizing the variational parameters of QAOA in a noise-robust fashion.
We analyze the performance of the algorithm for quantum state transfer problems in single- and multi-qubit systems.
arXiv Detail & Related papers (2020-02-04T00:46:51Z)
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.