Work

Asymptotically Good Quantum and Locally Testable Classical LDPC Codes

Year: 2021

Type: preprint

Abstract: We study classical and quantum LDPC codes of constant rate obtained by the lifted product construction over non-abelian groups. We show that the obtained families of quantum LDPC codes are asymptotically good, which proves the qLDPC conjecture. Moreover, we show that the produced classical LDPC codes are also asymptotically good and locally testable with constant query and soundness parameters, which proves a well-known conjecture in the field of locally testable codes.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2111.03654

Authors: Panteleev, Pavel, Kalachev, Gleb

Institution: Lomonosov Moscow State University

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Ministry of Science and Higher Education of the Russian Federation

Awards: G1717111205, G3553338279, G6444257319

OpenAlex ID: W4225906929

Cites: 14

Cited by: 126

Related to: 10