English
Related papers

Related papers: Quantum Reed-Muller Codes

200 papers

In this paper, we show that the projective Reed-Muller~(PRM) codes form a family of locally correctable codes~(LCC) in the regime of low query complexities. A PRM code is specified by the alphabet size $q$, the number of variables $m$, and…

Information Theory · Computer Science 2017-02-10 Sian-Jheng Lin

This article is focused on some variations of Reed-Muller codes that yield improvements to the rate for a prescribed decoding performance under the Berlekamp-Massey-Sakata algorithm with majority voting. Explicit formulas for the…

Information Theory · Computer Science 2007-07-16 Maria Bras-Amorós , Michael E. O'Sullivan

A general framework describing the statistical discrimination of an ensemble of quantum channels is given by the name of quantum reading. Several tools can be applied in quantum reading to reduce the error probability in distinguishing the…

Quantum Physics · Physics 2022-06-09 Francisco Revson Fernandes Pereira , Stefano Mancini

We present a unifying approach to quantum error correcting code design that encompasses additive (stabilizer) codes, as well as all known examples of nonadditive codes with good parameters. We use this framework to generate new codes with…

Quantum Physics · Physics 2009-02-19 Andrew Cross , Graeme Smith , John A. Smolin , Bei Zeng

Recursive decoding techniques are considered for Reed-Muller (RM) codes of growing length $n$ and fixed order $r.$ An algorithm is designed that has complexity of order $n\log n$ and corrects most error patterns of weight up to…

Information Theory · Computer Science 2017-03-17 Ilya Dumer

We introduce the notion of fault-tolerant quantum metrology to overcome noise beyond our control -- associated with sensing the parameter, by reducing the noise in operations under our control -- associated with preparing and measuring…

Quantum Physics · Physics 2019-08-29 Theodoros Kapourniotis , Animesh Datta

Based on the group structure of a unitary Lie algebra, a scheme is provided to systematically and exhaustively generate quantum error correction codes, including the additive and nonadditive codes. The syndromes in the process of…

Quantum Physics · Physics 2013-11-01 Ming-Chung Tsai , Po-Chung Chen , Kuan-Peng Chen , Zheng-Yao Su

Recently, operator quantum error-correcting codes have been proposed to unify and generalize decoherence free subspaces, noiseless subsystems, and quantum error-correcting codes. This note introduces a natural construction of such codes in…

Quantum Physics · Physics 2007-07-13 Andreas Klappenecker , Pradeep Kiran Sarvepalli

Qudits naturally correspond to multi-level quantum systems, which offer an efficient route towards quantum information processing, but their reliability is contingent upon quantum error correction capabilities. In this paper, we present a…

Quantum Physics · Physics 2024-10-04 Robert Frederik Uy , Dorian A. Gangloff

Quantum codes are subspaces of the state space of a quantum system that are used to protect quantum information. Some common classes of quantum codes are stabilizer (or additive) codes, non-stabilizer (or non-additive) codes obtained from…

Quantum Physics · Physics 2012-08-27 Hari Dilip Kumar

The essential insight of quantum error correction was that quantum information can be protected by suitably encoding this quantum information across multiple independently erred quantum systems. Recently it was realized that, since the most…

Quantum Physics · Physics 2007-05-23 Dave Bacon , Andrea Casaccino

We show how good quantum error-correcting codes can be constructed using generalized concatenation. The inner codes are quantum codes, the outer codes can be linear or nonlinear classical codes. Many new good codes are found, including both…

Quantum Physics · Physics 2010-06-01 Markus Grassl , Peter W. Shor , Bei Zeng

Block codes are considered for improving the reliability of messages stored in a computer memory with both stuck-at defects and random errors. It is assumed that the side information about the state of the defects is available to the…

Information Theory · Computer Science 2026-05-22 Ivana Djurdjevic , Robert Mateescu , Cyril Guyot

Reed-Muller codes are among the most important classes of locally correctable codes. Currently local decoding of Reed-Muller codes is based on decoding on lines or quadratic curves to recover one single coordinate. To recover multiple…

Information Theory · Computer Science 2019-05-13 Ronald Cramer , Chaoping Xing , Chen Yuan

A group theoretic framework is introduced that simplifies the description of known quantum error-correcting codes and greatly facilitates the construction of new examples. Codes are given which map 3 qubits to 8 qubits correcting 1 error, 4…

Quantum Physics · Physics 2009-01-23 A. R. Calderbank , E. M Rains , P. W. Shor , N. J. A. Sloane

A novel permutation decoding method for Reed-Muller codes is presented. The complexity and the error correction performance of the suggested permutation decoding approach are similar to that of the recursive lists decoder. It is…

Information Theory · Computer Science 2019-10-28 Mikhail Kamenev , Yulia Kameneva , Oleg Kurmaev , Alexey Maevskiy

We present two methods for the construction of quantum circuits for quantum error-correcting codes (QECC). The underlying quantum systems are tensor products of subsystems (qudits) of equal dimension which is a prime power. For a QECC…

Quantum Physics · Physics 2023-11-27 Markus Grassl , Martin Roetteler , Thomas Beth

I give an overview of the basic concepts behind quantum error correction and quantum fault tolerance. This includes the quantum error correction conditions, stabilizer codes, CSS codes, transversal gates, fault-tolerant error correction,…

Quantum Physics · Physics 2007-11-16 Daniel Gottesman

We present families of quantum error-correcting codes which are optimal in the sense that the minimum distance is maximal. These maximum distance separable (MDS) codes are defined over q-dimensional quantum systems, where q is an arbitrary…

Quantum Physics · Physics 2023-11-27 Markus Grassl , Thomas Beth , Martin Roetteler

Reed-Muller (RM) codes have undergone significant analytical advancements over the past decade, particularly for binary memoryless symmetric (BMS) channels. We extend the scope of RM codes development and analysis to multiple-access…

Information Theory · Computer Science 2025-06-11 Dina Abdelhadi , Colin Sandon , Emmanuel Abbe , Ruediger Urbanke