Degenerate Quantum LDPC Codes With Good Finite Length Performance

Panteleev, P.; Kalachev, G.

Авторы: Pavel Panteleev, Gleb Kalachev
Журнал: arXiv [quant-ph]
Год издания: 2019
Аннотация: We study the performance of small and medium length quantum LDPC (QLDPC) codes in the depolarizing channel. Only degenerate codes with the maximal stabilizer weight much smaller than their minimum distance are considered. It is shown that with the help of an OSD-like post-processing the performance of the standard belief propagation (BP) decoder on many QLDPC codes can be improved by several orders of magnitude. Using this new BP-OSD decoder we study the performance of several known classes of degenerate QLDPC codes including the hypergraph product codes, the hyperbicycle codes, the homological product codes, and the Haah's cubic codes. We also construct several interesting examples of short generalized bicycle codes. Some of them have an additional property that their syndromes are protected by small BCH codes, which may be useful for the fault-tolerant syndrome measurement. We also propose a new large family of QLDPC codes that contains the class of hypergraph product codes, where one of the used parity-check matrices is square. It is shown that in some cases such codes have better performance than the hypergraph product codes. Finally, we demonstrate that the performance of the proposed BP-OSD decoder for some of the constructed codes is better than for a relatively large surface code decoded by a near-optimal decoder.
Добавил в систему: Калачев Глеб Вячеславович

	ИСТИНА	Войти в систему Регистрация
	Интеллектуальная Система Тематического Исследования НАукометрических данных
	Главная Поиск Статистика О проекте Помощь

ИСТИНА

Интеллектуальная Система Тематического Исследования НАукометрических данных

Degenerate Quantum LDPC Codes With Good Finite Length Performanceстатья Исследовательская статья Электронная публикация

Прикрепленные файлы