Polynomial T-depth quantum solvability of noisy binary linear problem: from quantum-sample preparation to main computation
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Song, Wooyeong | - |
dc.contributor.author | Lim, Youngrong | - |
dc.contributor.author | Jeong, Kabgyun | - |
dc.contributor.author | Lee, Jinhyoung | - |
dc.contributor.author | Park, Jung Jun | - |
dc.contributor.author | Kim, M. S. | - |
dc.contributor.author | Bang, Jeongho | - |
dc.date.accessioned | 2022-12-20T06:16:36Z | - |
dc.date.available | 2022-12-20T06:16:36Z | - |
dc.date.created | 2022-11-02 | - |
dc.date.issued | 2022-10 | - |
dc.identifier.issn | 1367-2630 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/173003 | - |
dc.description.abstract | The noisy binary linear problem (NBLP) is known as a computationally hard problem, and therefore, it offers primitives for post-quantum cryptography. An efficient quantum NBLP algorithm that exhibits a polynomial quantum sample and time complexities has recently been proposed. However, the algorithm requires a large number of samples to be loaded in a highly entangled state and it is unclear whether such a precondition on the quantum speedup can be obtained efficiently. Here, we present a complete analysis of the quantum solvability of the NBLP by considering the entire algorithm process, namely from the preparation of the quantum sample to the main computation. By assuming that the algorithm runs on 'fault-tolerant' quantum circuitry, we introduce a reasonable measure of the computational time cost. The measure is defined in terms of the overall number of T gate layers, referred to as T-depth complexity. We show that the cost of solving the NBLP can be polynomial in the problem size, at the expense of an exponentially increasing logical qubits. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | IOP Publishing Ltd | - |
dc.title | Polynomial T-depth quantum solvability of noisy binary linear problem: from quantum-sample preparation to main computation | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, Jinhyoung | - |
dc.identifier.doi | 10.1088/1367-2630/ac94ef | - |
dc.identifier.scopusid | 2-s2.0-85140063182 | - |
dc.identifier.wosid | 000867378600001 | - |
dc.identifier.bibliographicCitation | NEW JOURNAL OF PHYSICS, v.24, no.10 | - |
dc.relation.isPartOf | NEW JOURNAL OF PHYSICS | - |
dc.citation.title | NEW JOURNAL OF PHYSICS | - |
dc.citation.volume | 24 | - |
dc.citation.number | 10 | - |
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 | Physics, Multidisciplinary | - |
dc.subject.keywordPlus | Computational complexity | - |
dc.subject.keywordPlus | Fault tolerance | - |
dc.subject.keywordPlus | Quantum computers | - |
dc.subject.keywordPlus | Quantum cryptography | - |
dc.subject.keywordPlus | Quantum efficiency | - |
dc.subject.keywordPlus | Quantum entanglement | - |
dc.subject.keywordPlus | Depth complexity | - |
dc.subject.keywordPlus | Fault-tolerant quantum computation | - |
dc.subject.keywordPlus | Hard problems | - |
dc.subject.keywordPlus | Linear problems | - |
dc.subject.keywordPlus | Noisy binary linear problem | - |
dc.subject.keywordPlus | Post quantum cryptography | - |
dc.subject.keywordPlus | Problem algorithms | - |
dc.subject.keywordPlus | Quantum algorithms | - |
dc.subject.keywordPlus | Sample preparation | - |
dc.subject.keywordPlus | T-depth complexity | - |
dc.subject.keywordPlus | Depth complexity | - |
dc.subject.keywordPlus | Fault-tolerant quantum computation | - |
dc.subject.keywordPlus | Hard problems | - |
dc.subject.keywordPlus | Linear problems | - |
dc.subject.keywordPlus | Noisy binary linear problem | - |
dc.subject.keywordPlus | Post quantum cryptography | - |
dc.subject.keywordPlus | Problem algorithms | - |
dc.subject.keywordPlus | Quantum algorithms | - |
dc.subject.keywordPlus | Sample preparation | - |
dc.subject.keywordPlus | T-depth complexity | - |
dc.subject.keywordAuthor | quantum algorithm | - |
dc.subject.keywordAuthor | noisy binary linear problem | - |
dc.subject.keywordAuthor | post-quantum cryptography | - |
dc.subject.keywordAuthor | fault-tolerant quantum computation | - |
dc.subject.keywordAuthor | T-depth 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.