دسته بندی:
محاسبات کوانتومی - Quantum-Computing
سال انتشار:
2022
عنوان انگلیسی مقاله:
Toward a Union-Find Decoder for Quantum LDPC Codes
ترجمه فارسی عنوان مقاله:
به سمت رمزگشای Union-Find برای کدهای LDPC کوانتومی
منبع:
ieee - ieee Transactions on Information Theory;2022;68;5;10:1109/TIT:2022:3143452
نویسنده:
Nicolas Delfosse; Vivien Londe; Michael E. Beverland
چکیده انگلیسی:
Quantum LDPC codes are a promising direction
for low overhead quantum computing. In this paper, we propose
a generalization of the Union-Find decoder as a decoder for
quantum LDPC codes. We prove that this decoder corrects all
errors with weight up to Anα for some A, α > 0, where
n is the code length, for different classes of quantum LDPC
codes such as toric codes and hyperbolic codes in any dimension
D ≥ 3 and quantum expander codes. To prove this result,
we introduce a notion of covering radius which measures the
spread of an error from its syndrome. We believe this notion
could find application beyond the decoding problem. We also
perform numerical simulations, which show that our Union-Find
decoder outperforms the belief propagation decoder in the low
error rate regime in the case of a quantum LDPC code with
length 3600.
keywords: Quantum computing | error correction | decoding.
قیمت: رایگان
توضیحات اضافی:
تعداد نظرات : 0