ETRI-Knowledge Sharing Plaform



논문 검색
구분 SCI
연도 ~ 키워드


학술지 Polynomial T-depth quantum solvability of noisy binary linear problem: from quantum-sample preparation to main computation
Cited 2 time in scopus Download 60 time Share share facebook twitter linkedin kakaostory
송우영, 임영롱, 정갑균, 이진형, 박정준, 김명식, 방정호
New Journal of Physics, v.24 no.10, pp.1-11
Institute of Physics (IOP)
22JB1500, 양자데이터 최적화 중심 양자 알고리즘 개발 및 활용 연구, 방정호
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 ?쁣ault-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.
KSP 제안 키워드
Computational time, Depth complexity, Entangled state, Hard problem, Post-Quantum Cryptography, Sample Preparation, T-depth, linear problem, time cost
본 저작물은 크리에이티브 커먼즈 저작자 표시 (CC BY) 조건에 따라 이용할 수 있습니다.
저작자 표시 (CC BY)