相关论文: On Subsystem Codes Beating the Hamming or Singleto…

One hurdle to performing reliable quantum computations is overcoming noise. One possibility is to reduce the number of particles needing to be protected from noise and instead use systems with more states, so called qudit quantum computers.…

We study subsystem codes whose gauge group has local generators in the 2D geometry. It is shown that there exists a family of such codes defined on lattices of size LxL with the number of logical qubits k and the minimum distance d both…

The surface code is one of the most promising candidates for combating errors in large scale fault-tolerant quantum computation. A fault-tolerant decoder is a vital part of the error correction process---it is the algorithm which computes…

We show that within any quantum stabilizer code there lurks a classical binary linear code with similar error-correcting capabilities, thereby demonstrating new connections between quantum codes and classical codes. Using this result --…

We study how much noise can be tolerated by a universal gate set before it loses its quantum-computational power. Specifically we look at circuits with perfect stabilizer operations in addition to imperfect non-stabilizer gates. We prove…

A variety of past research on superconducting qubits shows that these devices exhibit considerable variation and thus cannot be accurately depicted by a uniform noise model. To combat this often unrealistic picture of homogeneous noise in…

Fault-tolerant capacities quantify the ability of a quantum channel to reliably transmit information when every component of the encoding and decoding procedure is noisy. Earlier work analyzed achievable communication rates under such noise…

The homogeneous metric can be viewed as a natural extension of the Hamming metric to finite chain rings. It distinguishes between three types of elements: zero, non-zero elements in the socle, and elements outside the socle. Since the…

We give results on the question of code optimality for linear codes over finite Frobenius rings for the homogeneous weight. This article improves on the existing Plotkin bound derived in an earlier paper, and suggests a version of a…

We introduce a family of 2D topological subsystem quantum error-correcting codes. The gauge group is generated by 2-local Pauli operators, so that 2-local measurements are enough to recover the error syndrome. We study the computational…

Noiseless subsystems offer a general and efficient method for protecting quantum information in the presence of noise that has symmetry properties. A paradigmatic class of error models displaying non-trivial symmetries emerges under…

A crucial insight for practical quantum error correction is that different types of errors, such as single-qubit Pauli operators, typically occur with different probabilities. Finding an optimal quantum code under such biased noise is a…

In this paper we consider stabilizer codes over local Frobenius rings. First, we study the relative minimum distances of a stabilizer code and its reduction onto the residue field. We show that for various scenarios, a free stabilizer code…

In this paper, we derive a Singleton bound for lattice schemes and obtain Singleton bounds known for binary codes and subspace codes as special cases. It is shown that the modular structure affects the strength of the Singleton bound. We…

The surface code is one the most promising alternatives for implementing fault-tolerant, large-scale quantum information processing. Its high threshold for single-qubit errors under stochastic noise is one of its most attrative features. We…

Recent work on approximate quantum error correction (QEC) has opened up the possibility of constructing subspace codes that protect information with high fidelity in scenarios where perfect error correction is impossible. Motivated by this,…

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…

Codes in the sum-rank metric have received many attentions in recent years, since they have wide applications in the multishot network coding, the space-time coding and the distributed storage. Fundamental bounds, some explicit or…

Coherent network error correction is the error-control problem in network coding with the knowledge of the network codes at the source and sink nodes. With respect to a given set of local encoding kernels defining a linear network code, we…

In this paper, we give a notation on the Singleton bounds for linear codes over a finite commutative quasi-Frobenius ring in the work of Shiromoto [5]. We show that there exists a class of finite commutative quasi-Frobenius rings. The…