IQGO: Iterative Quantum Gate Optimiser for Quantum Data Embedding
Quantum kernel methods and Variational Quantum Classifiers (VQCs) have recently gained significant interest in the field of Machine Learning (ML). They have the potential to achieve superior generalisation whilst using smaller datasets and fewer parameters compared to their classical counterparts. H...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2024-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10807205/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850037717607383040 |
|---|---|
| author | Tautvydas Lisas Ruairi de Frein |
| author_facet | Tautvydas Lisas Ruairi de Frein |
| author_sort | Tautvydas Lisas |
| collection | DOAJ |
| description | Quantum kernel methods and Variational Quantum Classifiers (VQCs) have recently gained significant interest in the field of Machine Learning (ML). They have the potential to achieve superior generalisation whilst using smaller datasets and fewer parameters compared to their classical counterparts. However, kernel methods which leverage feature map embedding, often struggle with overfitting, which compromises their generalisation performance on unseen data. VQCs which utilise Parameterised Quantum Circuits (PQCs) to model the relationship between input data and the output, are susceptible to the Barren Plateau (BP) problem. To address these challenges, we introduce an adaptive quantum embedding optimisation algorithm, namely the Iterative Quantum Gate Optimiser (IQGO), which is suited to the task of tabular data classification. IQGO employs a Greedy Search algorithm to optimise the quantum embedding. Empirical evidence on noiseless simulations show that it addresses both the overfitting and the BP problem. We demonstrate the efficacy of IQGO on simulations of 21 qubits for the quantum kernel and 4 qubits for the VQC. Using small tabular datasets, we benchmark our approach against contemporary state-of-the-art classical algorithms. These promising results suggest that quantum algorithms may perform well at data classification problems. We test 5 binary classification problems and show that in 3 of them the IQGO algorithm admits competitive or better performance in terms of generalisation than existing state-of-the-art algorithms. |
| format | Article |
| id | doaj-art-0dd1d2ca644e45eca8c778e3cd318f17 |
| institution | DOAJ |
| issn | 2169-3536 |
| language | English |
| publishDate | 2024-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj-art-0dd1d2ca644e45eca8c778e3cd318f172025-08-20T02:56:47ZengIEEEIEEE Access2169-35362024-01-011219470019471010.1109/ACCESS.2024.352049110807205IQGO: Iterative Quantum Gate Optimiser for Quantum Data EmbeddingTautvydas Lisas0https://orcid.org/0000-0003-0730-9257Ruairi de Frein1https://orcid.org/0000-0002-3912-1470School of Electrical and Electronic Engineering, Technological University Dublin, Dublin 7, IrelandSchool of Electrical and Electronic Engineering, Technological University Dublin, Dublin 7, IrelandQuantum kernel methods and Variational Quantum Classifiers (VQCs) have recently gained significant interest in the field of Machine Learning (ML). They have the potential to achieve superior generalisation whilst using smaller datasets and fewer parameters compared to their classical counterparts. However, kernel methods which leverage feature map embedding, often struggle with overfitting, which compromises their generalisation performance on unseen data. VQCs which utilise Parameterised Quantum Circuits (PQCs) to model the relationship between input data and the output, are susceptible to the Barren Plateau (BP) problem. To address these challenges, we introduce an adaptive quantum embedding optimisation algorithm, namely the Iterative Quantum Gate Optimiser (IQGO), which is suited to the task of tabular data classification. IQGO employs a Greedy Search algorithm to optimise the quantum embedding. Empirical evidence on noiseless simulations show that it addresses both the overfitting and the BP problem. We demonstrate the efficacy of IQGO on simulations of 21 qubits for the quantum kernel and 4 qubits for the VQC. Using small tabular datasets, we benchmark our approach against contemporary state-of-the-art classical algorithms. These promising results suggest that quantum algorithms may perform well at data classification problems. We test 5 binary classification problems and show that in 3 of them the IQGO algorithm admits competitive or better performance in terms of generalisation than existing state-of-the-art algorithms.https://ieeexplore.ieee.org/document/10807205/Quantum embeddingquantum kernel methodsvariational quantum classifiersoverfittingbarren plateau |
| spellingShingle | Tautvydas Lisas Ruairi de Frein IQGO: Iterative Quantum Gate Optimiser for Quantum Data Embedding IEEE Access Quantum embedding quantum kernel methods variational quantum classifiers overfitting barren plateau |
| title | IQGO: Iterative Quantum Gate Optimiser for Quantum Data Embedding |
| title_full | IQGO: Iterative Quantum Gate Optimiser for Quantum Data Embedding |
| title_fullStr | IQGO: Iterative Quantum Gate Optimiser for Quantum Data Embedding |
| title_full_unstemmed | IQGO: Iterative Quantum Gate Optimiser for Quantum Data Embedding |
| title_short | IQGO: Iterative Quantum Gate Optimiser for Quantum Data Embedding |
| title_sort | iqgo iterative quantum gate optimiser for quantum data embedding |
| topic | Quantum embedding quantum kernel methods variational quantum classifiers overfitting barren plateau |
| url | https://ieeexplore.ieee.org/document/10807205/ |
| work_keys_str_mv | AT tautvydaslisas iqgoiterativequantumgateoptimiserforquantumdataembedding AT ruairidefrein iqgoiterativequantumgateoptimiserforquantumdataembedding |