Tangible reduction in learning sample complexity with large classical samples and small quantum system
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Song, Wooyeong | - |
dc.contributor.author | Wiesniak, Marcin | - |
dc.contributor.author | Liu, Nana | - |
dc.contributor.author | Pawlowski, Marcin | - |
dc.contributor.author | Lee, Jinhyoung | - |
dc.contributor.author | Kim, Jaewan | - |
dc.contributor.author | Bang, Jeongho | - |
dc.date.accessioned | 2022-07-06T15:58:04Z | - |
dc.date.available | 2022-07-06T15:58:04Z | - |
dc.date.created | 2021-11-22 | - |
dc.date.issued | 2021-08 | - |
dc.identifier.issn | 1570-0755 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/141329 | - |
dc.description.abstract | Quantum computation requires large classical datasets to be embedded into quantum states in order to exploit quantum parallelism. However, this embedding requires considerable resources in general. It would therefore be desirable to avoid it, if possible, for noisy intermediate-scale quantum (NISQ) implementation. Accordingly, we consider a classical-quantum hybrid architecture, which allows large classical input data, with a relatively small-scale quantum system. This hybrid architecture is used to implement a sampling oracle. It is shown that in the presence of noise in the hybrid oracle, the effects of internal noise can cancel each other out and thereby improve the query success rate. It is also shown that such an immunity of the hybrid oracle to noise directly and tangibly reduces the sample complexity in the framework of computational learning theory. This NISQ-compatible learning advantage is attributed to the oracle's ability to handle large input features. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | SPRINGER | - |
dc.title | Tangible reduction in learning sample complexity with large classical samples and small quantum system | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, Jinhyoung | - |
dc.identifier.doi | 10.1007/s11128-021-03217-7 | - |
dc.identifier.scopusid | 2-s2.0-85113711806 | - |
dc.identifier.wosid | 000687675900001 | - |
dc.identifier.bibliographicCitation | QUANTUM INFORMATION PROCESSING, v.20, no.8, pp.1 - 18 | - |
dc.relation.isPartOf | QUANTUM INFORMATION PROCESSING | - |
dc.citation.title | QUANTUM INFORMATION PROCESSING | - |
dc.citation.volume | 20 | - |
dc.citation.number | 8 | - |
dc.citation.startPage | 1 | - |
dc.citation.endPage | 18 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | Y | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Physics | - |
dc.relation.journalWebOfScienceCategory | Quantum Science & Technology | - |
dc.relation.journalWebOfScienceCategory | Physics, Multidisciplinary | - |
dc.relation.journalWebOfScienceCategory | Physics, Mathematical | - |
dc.subject.keywordPlus | DNF | - |
dc.subject.keywordAuthor | Quantum machine learning | - |
dc.subject.keywordAuthor | Probably Approximately Correct (PAC) learning | - |
dc.subject.keywordAuthor | Classical-quantum hybrid query | - |
dc.subject.keywordAuthor | Sample complexity | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.