Results 11 to 20 of about 8,529,401 (324)
Partial Syndrome Measurement for Hypergraph Product Codes [PDF]
Quantum, 2023 Hypergraph product codes are a promising avenue to achieving fault-tolerant quantum computation with constant overhead. When embedding these and other constant-rate qLDPC codes into 2D, a significant number of nonlocal connections are required, posing ...
Noah Berthusen, Daniel Gottesman
doaj +5 more sources
Fast erasure decoder for hypergraph product codes [PDF]
Quantum, 2022 We propose a decoder for the correction of erasures with hypergraph product codes, which form one of the most popular families of quantum LDPC codes.
Nicholas Connolly +3 more
doaj +5 more sources
From product codes to structured generalized LDPC codes [PDF]
Proceedings of the 5th International ICST Conference on Communications and Networking in China, 2010 Product codes, due to their relatively large minimum distance, are often seen as a natural solution for applications requiring low error floors. In this paper, we show by means of an ensemble weight enumerator analysis that the minimum distance multiplicities of product codes are much higher than those obtainable by other generalized LDPC (GLDPC ...
M. Lentmaier +3 more
openaire +7 more sources
Combining hard and soft decoders for hypergraph product codes [PDF]
Quantum, 2021 Hypergraph product codes are a class of constant-rate quantum low-density parity-check (LDPC) codes equipped with a linear-time decoder called small-set-flip (SSF).
Antoine Grospellier +3 more
doaj +3 more sources
Partitioning qubits in hypergraph product codes to implement logical gates [PDF]
Quantum, 2023 The promise of high-rate low-density parity check (LDPC) codes to substantially reduce the overhead of fault-tolerant quantum computation depends on constructing efficient, fault-tolerant implementations of logical gates on such codes.
Armanda O. Quintavalle +2 more
doaj +3 more sources
Fault-Tolerant Gates on Hypergraph Product Codes [PDF]
Physical Review X, 2021 Quantum computers have the capacity to change the landscape of computing. To make these devices robust to experimental imperfections, we require some form of quantum error correction. Current approaches focus on topological codes, as they appear to be in
Anirudh Krishna, David Poulin
doaj +2 more sources
DECODING OF MATRIX-PRODUCT CODES [PDF]
Journal of Algebra and Its Applications, 2013 We propose a decoding algorithm for the (u | u + v)-construction that decodes up to half of the minimum distance of the linear code. We extend this algorithm for a class of matrix-product codes in two different ways. In some cases, one can decode beyond the error-correction capability of the code.
Hernando, Fernando, Ruano Benito, Diego
openaire +4 more sources
Distance-preserving stabilizer measurements in hypergraph product codes [PDF]
Quantum, 2023 Unlike the surface code, quantum low-density parity-check (QLDPC) codes can have a finite encoding rate, potentially lowering the error correction overhead.
Argyris Giannisis Manes, Jahan Claes
doaj +3 more sources
Single-Shot Error Correction of Three-Dimensional Homological Product Codes [PDF]
PRX Quantum, 2021 Single-shot error correction corrects data noise using only a single round of noisy measurements on the data qubits, removing the need for intensive measurement repetition.
Armanda O. Quintavalle +3 more
doaj +2 more sources
Fracton models from product codes [PDF]
Physical Review Research, 2023 We explore a deep connection between fracton order and product codes. In particular, we propose and analyze conditions on classical seed codes which lead to fracton order in the resulting quantum product codes.
Yi Tan +4 more
doaj +2 more sources