{"title":"无监督域自适应的量子核子空间对准","authors":"Xi He, Feiyu Du","doi":"10.1145/3590003.3590054","DOIUrl":null,"url":null,"abstract":"Domain adaptation (DA), the sub-realm of the transfer learning, attempts to deal with machine learning tasks on an unprocessed data domain with the different, but related labeled source domain. However, the classical DA can not efficiently deal with the cross-domain tasks in quantum mechanical scenarios. In this paper, the quantum kernel subspace alignment algorithm is proposed to achieve the procedure of DA by extracting the non-linear features with the quantum kernel method and aligning the two domains with the unitary evolution. The method presented in our work can be implemented on the universal quantum computer with the quantum basic linear algebra subroutines. Based on the algorithmic complexity analysis, the procedure of the QKSA can be implemented with at least quadratic quantum speedup compared with the classical DA algorithms.","PeriodicalId":340225,"journal":{"name":"Proceedings of the 2023 2nd Asia Conference on Algorithms, Computing and Machine Learning","volume":"73 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Quantum kernel subspace alignment for unsupervised domain adaptation\",\"authors\":\"Xi He, Feiyu Du\",\"doi\":\"10.1145/3590003.3590054\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Domain adaptation (DA), the sub-realm of the transfer learning, attempts to deal with machine learning tasks on an unprocessed data domain with the different, but related labeled source domain. However, the classical DA can not efficiently deal with the cross-domain tasks in quantum mechanical scenarios. In this paper, the quantum kernel subspace alignment algorithm is proposed to achieve the procedure of DA by extracting the non-linear features with the quantum kernel method and aligning the two domains with the unitary evolution. The method presented in our work can be implemented on the universal quantum computer with the quantum basic linear algebra subroutines. Based on the algorithmic complexity analysis, the procedure of the QKSA can be implemented with at least quadratic quantum speedup compared with the classical DA algorithms.\",\"PeriodicalId\":340225,\"journal\":{\"name\":\"Proceedings of the 2023 2nd Asia Conference on Algorithms, Computing and Machine Learning\",\"volume\":\"73 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-03-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2023 2nd Asia Conference on Algorithms, Computing and Machine Learning\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3590003.3590054\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2023 2nd Asia Conference on Algorithms, Computing and Machine Learning","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3590003.3590054","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Quantum kernel subspace alignment for unsupervised domain adaptation
Domain adaptation (DA), the sub-realm of the transfer learning, attempts to deal with machine learning tasks on an unprocessed data domain with the different, but related labeled source domain. However, the classical DA can not efficiently deal with the cross-domain tasks in quantum mechanical scenarios. In this paper, the quantum kernel subspace alignment algorithm is proposed to achieve the procedure of DA by extracting the non-linear features with the quantum kernel method and aligning the two domains with the unitary evolution. The method presented in our work can be implemented on the universal quantum computer with the quantum basic linear algebra subroutines. Based on the algorithmic complexity analysis, the procedure of the QKSA can be implemented with at least quadratic quantum speedup compared with the classical DA algorithms.