A Leverrier, G Zémor - 2022 IEEE 63rd Annual Symposium on …, 2022 - ieeexplore.ieee.org
Tanner codes are long error correcting codes obtained from short codes and a graph, with bits on the edges and parity-check constraints from the short codes enforced at the vertices …
Quantum error correction is an indispensable ingredient for scalable quantum computing. In this Perspective we discuss a particular class of quantum codes called “quantum low-density …
This work provides the first explicit and non-random family of [[N, K, D]] LDPC quantum codes which encode K∈ Θ (N 4/5) logical qubits with distance D∈ Ω (N 3/5). The family is …
I Dinur, MH Hsieh, TC Lin, T Vidick - … of the 55th annual ACM symposium …, 2023 - dl.acm.org
We construct a new explicit family of good quantum low-density parity-check codes which additionally have linear time decoders. Our codes are based on a three-term chain (2 m× m) …
P Panteleev, G Kalachev - IEEE Transactions on Information …, 2021 - ieeexplore.ieee.org
We give a construction of quantum LDPC codes of dimension and distance as the code length. Using a product of chain complexes this construction also provides a family of …
P Panteleev, G Kalachev - Quantum, 2021 - quantum-journal.org
We study the performance of medium-length quantum LDPC (QLDPC) codes in the depolarizing channel. Only degenerate codes with the maximal stabilizer weight much …
Vast numbers of qubits will be needed for large-scale quantum computing because of the overheads associated with error correction. We present a scheme for low-overhead fault …
The scaling barriers currently faced by both quantum networking and quantum computing technologies ultimately amount to the same core challenge of distributing high-quality …
Recent developments have shown the existence of quantum low-density parity check (qLDPC) codes with constant rate and linear distance. A natural question concerns the …