Quantum solvability of noisy linear problems by divide-and-conquer strategy
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Song, Wooyeong | - |
dc.contributor.author | Lim, Youngrong | - |
dc.contributor.author | Jeong, Kabgyun | - |
dc.contributor.author | Ji, Yun-Seong | - |
dc.contributor.author | Lee, Jinhyoung | - |
dc.contributor.author | Kim, Jaewan | - |
dc.contributor.author | Kim, M. S. | - |
dc.contributor.author | Bang, Jeongho | - |
dc.date.accessioned | 2022-07-06T06:26:04Z | - |
dc.date.available | 2022-07-06T06:26:04Z | - |
dc.date.created | 2022-04-06 | - |
dc.date.issued | 2022-04 | - |
dc.identifier.issn | 2058-9565 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/138990 | - |
dc.description.abstract | Noisy linear problems have been studied in various science and engineering disciplines. A class of `hard' noisy linear problems can be formulated as follows: Given a matrix A and a vector b constructed using a finite set of samples, a hidden vector or structure involved in b is obtained by solving a noise-corrupted linear equation Ax approximate to b + eta, where eta is a noise vector that cannot be identified. For solving such a noisy linear problem, we consider a quantum algorithm based on a divide-and-conquer strategy, wherein a large core process is divided into smaller subprocesses. The algorithm appropriately reduces both the computational complexities and size of a quantum sample. More specifically, if a quantum computer can access a particular reduced form of the quantum samples, polynomial quantum-sample and time complexities are achieved in the main computation. The size of a quantum sample and its executing system can be reduced, e.g., from exponential to sub-exponential with respect to the problem length, which is better than other results we are aware. We analyse the noise model conditions for such a quantum advantage, and show when the divide-and-conquer strategy can be beneficial for quantum noisy linear problems. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | IOP Publishing Ltd | - |
dc.title | Quantum solvability of noisy linear problems by divide-and-conquer strategy | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, Jinhyoung | - |
dc.identifier.doi | 10.1088/2058-9565/ac51b0 | - |
dc.identifier.scopusid | 2-s2.0-85126526579 | - |
dc.identifier.wosid | 000766354800001 | - |
dc.identifier.bibliographicCitation | QUANTUM SCIENCE AND TECHNOLOGY, v.7, no.2, pp.1 - 8 | - |
dc.relation.isPartOf | QUANTUM SCIENCE AND TECHNOLOGY | - |
dc.citation.title | QUANTUM SCIENCE AND TECHNOLOGY | - |
dc.citation.volume | 7 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 1 | - |
dc.citation.endPage | 8 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Physics | - |
dc.relation.journalWebOfScienceCategory | Quantum Science & Technology | - |
dc.relation.journalWebOfScienceCategory | Physics, Multidisciplinary | - |
dc.subject.keywordPlus | COMPLEXITY | - |
dc.subject.keywordPlus | SUPREMACY | - |
dc.subject.keywordAuthor | quantum algorithm | - |
dc.subject.keywordAuthor | noisy linear problem | - |
dc.subject.keywordAuthor | quantum-sample complexity | - |
dc.identifier.url | https://iopscience.iop.org/article/10.1088/2058-9565/ac51b0 | - |
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.