相关论文: Nonbinary Quantum Stabilizer Codes

There is a connection between classical codes, highly entangled pure states (called k-uniform or absolutely maximally entangled (AME) states), and quantum error correcting codes (QECCs). This leads to a systematic method to construct…

Two observations are given on the fidelity of schemes for quantum information processing. In the first one, we show that the fidelity of a symplectic (stabilizer) code, if properly defined, exactly equals the `probability' of the…

Mapping an error syndrome to the error operator is the core of quantum decoding network and is also the key step of recovery. The definitions of the bit-flip error syndrome matrix and the phase-flip error syndrome matrix were presented, and…

We present a universal framework for quantum error-correcting codes, i.e., the one that applies for the most general quantum error-correcting codes. This framework is established on the group algebra, an algebraic notation for the nice…

The Pauli groups are ubiquitous in quantum information theory because of their usefulness in describing quantum states and operations and their readily understood symmetry properties. In addition, the most well-understood quantum error…

We introduce a class of bosonic quantum error-correcting codes, termed \emph{extended binomial codes}, which generalize the structure of one-mode binomial codes by incorporating ideas from high-rate qubit stabilizer codes. These codes are…

In this paper, we define and study \emph{quantum cyclic codes}, a generalisation of cyclic codes to the quantum setting. Previously studied examples of quantum cyclic codes were all quantum codes obtained from classical cyclic codes via the…

A new type of local-check additive quantum code is presented. Qubits are associated with edges of a 2-dimensional lattice whereas the stabilizer operators correspond to the faces and the vertices. The boundary of the lattice consists of…

We introduce a new construction for the balancing of non-binary sequences that make use of Gray codes for prefix coding. Our construction provides full encoding and decoding of sequences, including the prefix. This construction is based on…

In this work, we develop a space-time block code for noncoherent communication using techniques from the field of quantum error correction. We decompose the multiple-input multiple-output (MIMO) channel into operators from quantum…

In this paper we estimate the fidelity of stabilizer and CSS codes. First, we derive a lower bound on the fidelity of a stabilizer code via its quantum enumerator. Next, we find the average quantum enumerators of the ensembles of finite…

We introduce heterogeneous quantum error-correcting codes composed of qubit types with distinct error channels and study their performance in the code-capacity regime using maximum-likelihood tensor network decoding. In the regime where…

The relation between stabilizer codes and binary codes provided by Gottesman and Calderbank et al. is a celebrated result, as it allows the lifting of classical codes to quantum codes. An equivalent way to state this result is that the work…

We introduce a new primitive, called welding, for combining two stabilizer codes to produce a new stabilizer code. We apply welding to construct surface codes and then use the surface codes to construct solid codes, a variant of a 3-d toric…

Stabilizer codes are a simple and successful class of quantum error-correcting codes. Yet this success comes in spite of some harsh limitations on the ability of these codes to fault-tolerantly compute. Here we introduce a new metric for…

There has been a lot of effort to construct good quantum codes from the classical error correcting codes. Constructing new quantum codes, using Hermitian self-orthogonal codes, seems to be a difficult problem in general. In this paper,…

In Part II we show that there exist quantum codes whose probability of undetected error falls exponentially with the length of the code and derive bounds on this exponent.The lower (existence) bound for stabilizer codes is proved by a…

First, a canonical form for stabilizer parity check matrices of arbitrary size and rank is derived. Next, it is shown that the closely related canonical form of the Clifford group can be computed in time $O(n^3)$ for $n$ qubits, which…

We present a family of non-CSS quantum error-correcting code consisting of geometrically local stabilizer generators on a 3D lattice. We study the Hamiltonian constructed from ferromagnetic interaction of overcomplete set of local…

High-fidelity decoding of quantum error correction codes relies on an accurate experimental model of the physical errors occurring in the device. Because error probabilities can depend on the context of the applied operations, the error…