Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/27116
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHe, X-
dc.contributor.authorDu, F-
dc.contributor.authorXue, M-
dc.contributor.authorDu, X-
dc.contributor.authorLei, T-
dc.contributor.authorNandi, AK-
dc.date.accessioned2023-09-03T10:36:11Z-
dc.date.available2023-09-03T10:36:11Z-
dc.date.issued2023-02-06-
dc.identifierORCID iD: Asoke K. Nandi https://orcid.org/0000-0001-6248-2875-
dc.identifierArticle number: 105-
dc.identifier.citationHe, X. et al. (2023) 'Quantum classifiers for domain adaptation', Quantum Information Processing, 22 (2), 105, pp. 1 - 13. doi: 10.1007/s11128-023-03846-0.en_US
dc.identifier.issn1570-0755-
dc.identifier.urihttps://bura.brunel.ac.uk/handle/2438/27116-
dc.descriptionThe file archived on this institutional repository is a preprint - arXiv:2110.02808v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2110.02808. It has not been cerified by peer review. Please consult the final, corrected version published by Springer Nature at https://doi.org/10.1007/s11128-023-03846-0.-
dc.description.abstractTransfer learning (TL), a crucial subfield of machine learning, aims to accomplish a task in the target domain with the acquired knowledge of the source domain. Specifically, effective domain adaptation (DA) facilitates the delivery of the TL task where all the data samples of the two domains are distributed in the same feature space. In this paper, two quantum implementations of the DA classifier are presented with quantum speedup compared with the classical DA classifier. One implementation, the quantum basic linear algebra subroutines-based classifier, can predict the labels of the target domain data with logarithmic resources in the number and dimension of the given data. The other implementation efficiently accomplishes the DA task through a variational hybrid quantum-classical procedure.en_US
dc.description.sponsorshipNational Key Research and Development Program of China Grant No. 2018YFA0306703, in part by the National Natural Science Foundation of China under Grant 62271296, in part by Natural Science Basic Research Program of Shaanxi (No. 2021JC-47), in part by Key Research and Development Program of Shaanxi (Program No. 2022GY-436, NO. 2021ZDLGY08-07), in part by Natural Science Basic Research Program of Shaanxi (Program No. 2022JQ-018), and in part by Shaanxi Joint Laboratory of Artificial Intelligence (No. 2020SS-03).en_US
dc.format.extent1 - 13-
dc.format.mediumPrint-Electronic-
dc.languageEnglish-
dc.language.isoen_USen_US
dc.publisherSpringer Nstureen_US
dc.rightsCopyright © 2021 The authors. This version of the article is a preprint available at: https://arxiv.org/abs/2110.02808, it is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: https://doi.org/10.1007/s11128-023-03846-0 (see: https://arxiv.org/licenses/nonexclusive-distrib/1.0/license.html)-
dc.rights.urihttps://arxiv.org/licenses/nonexclusive-distrib/1.0/license.html-
dc.subjectdomain adaptationen_US
dc.subjectquantum machine learningen_US
dc.subjecttransfer learningen_US
dc.subjectquantum algorithmen_US
dc.subjectmachine learningen_US
dc.titleQuantum classifiers for domain adaptationen_US
dc.typePreprinten_US
dc.date.dateAccepted2023-01-16-
dc.identifier.doihttps://doi.org/10.1007/s11128-023-03846-0-
dc.relation.isPartOfQuantum Information Processing-
pubs.issue2-
pubs.publication-statusPublished-
pubs.volume22-
dc.identifier.eissn1573-1332-
dcterms.dateAccepted2023-01-16-
dc.rights.holderThe authors-
Appears in Collections:Dept of Electronic and Electrical Engineering Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdfCopyright © 2021 The authors. This version of the article is a preprint available at: https://arxiv.org/abs/2110.02808, it is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: https://doi.org/10.1007/s11128-023-03846-0 (see: https://arxiv.org/licenses/nonexclusive-distrib/1.0/license.html)8.28 MBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.