Polynomial T-depth quantum solvability of noisy binary linear problem: from quantum-sample preparation to main computation

Polynomial T-depth quantum solvability of noisy binary linear problem: from quantum-sample preparation to main computation

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...

Full description

Bibliographic Details
Main Authors: Wooyeong Song, Youngrong Lim, Kabgyun Jeong, Jinhyoung Lee, Jung Jun Park, M S Kim, Jeongho Bang
Format: Article
Language:English
Published: IOP Publishing 2022-01-01
Series:New Journal of Physics
Subjects:
quantum algorithm
noisy binary linear problem
post-quantum cryptography
fault-tolerant quantum computation
T-depth complexity
Online Access:https://doi.org/10.1088/1367-2630/ac94ef

Internet

https://doi.org/10.1088/1367-2630/ac94ef

Similar Items