相关论文: Nonbinary stabilizer codes over finite fields
We introduce new yet easily accessible codes for elements of $GL_r(A)$ with $A$ the adelic ring of a (dimension one) function field over a finite field. They are linear codes, and coincide with classical algebraic geometry codes when $r=1$.…
Sensitivity to noise makes most of the current quantum computing schemes prone to error and nonscalable, allowing only for small proof-of-principle devices. Topologically-protected quantum computing aims at solving this problem by encoding…
Quantum computation holds the promise of solving certain complex problems exponentially faster than classical computers. However, the high prevalent noise in current quantum devices impedes the accurate execution of even basic algorithms.…
Quantum stabilizer codes often struggle with syndrome errors due to measurement imperfections. Typically, multiple rounds of syndrome extraction are employed to ensure reliable error information. In this paper, we consider phenomenological…
Cyclic codes and their various generalizations, such as quasi-twisted (QT) codes, have a special place in algebraic coding theory. Among other things, many of the best-known or optimal codes have been obtained from these classes. In this…
Quantum computers are a revolutionary class of computational platforms with applications in combinatorial and global optimization, machine learning, and other domains involving computationally hard problems. While these machines typically…
With the advent of physical qubits exhibiting strong noise bias, it becomes increasingly relevant to identify which quantum gates can be efficiently implemented on error-correcting codes designed to address a single dominant error type.…
This paper proposes a new coded modulation scheme for reliable transmission of short data packets at very low signal-to-noise ratio, combining cyclic code shift keying modulation and non-binary polar coding. We consider non-binary polar…
Quantum stabilizer codes constructed from sparse matrices have good performance and can be efficiently decoded by belief propagation (BP). A conventional BP decoding algorithm treats binary stabilizer codes as additive codes over GF(4).…
A generalization of the stabilizer code construction presented by Gottesman is described, which allows for the construction of quantum error-correcting codes for continuous-variable systems. This formalism describes all continuous-variable…
Stabilizer codes are the most widely studied class of quantum error-correcting codes and form the basis of most proposals for a fault-tolerant quantum computer. A stabilizer code is defined by a set of parity-check operators, which are…
We study how the resilience of the surface code is affected by the coupling to a non-Markovian environment at zero temperature. The qubits in the surface code experience an effective dynamics due to the coupling to the environment that…
Calderbank, Rains, Shor and Sloane (see \cite{Sloane}) showed that error-correction is possible in the context of quantum computations. Quantum stabilizer codes are a class of additive quaternary codes in binary projective spaces, which are…
Quantum synchronizable error-correcting codes are special quantum error-correcting codes that are designed to correct both the effect of quantum noise on qubits and misalignment in block synchronization. It is known that in principle such a…
Bell measurements (BMs) are ubiquitous in quantum information and technology. They are basic elements for quantum commmunication, computation, and error correction. In particular, when performed on logical qubits encoded in physical…
Quantum low-density parity-check (qLDPC) codes can be implemented by measuring only low-weight checks, making them compatible with noisy quantum hardware and central to the quest to build noise-resilient quantum computers. A fundamental…
As a special class of linear codes, minimal linear codes have important applications in secret sharing and secure two-party computation. Constructing minimal linear codes with new and desirable parameters has been an interesting research…
In practical communication and computation systems, errors occur predominantly in adjacent positions rather than in a random manner. In this paper, we develop a stabilizer formalism for quantum burst error correction codes (QBECC) to combat…
In [Phys. Rev. A 58, 1833 (1998)] a family of polynomial invariants which separate the orbits of multi-qubit density operators $\rho$ under the action of the local unitary group was presented. We consider this family of invariants for the…
The five-qubit quantum error correcting code encodes one logical qubit to five physical qubits, and protects the code from a single error. It was one of the first quantum codes to be invented, and various encoding circuits have been…