Related papers: New entanglement-assisted MDS quantum codes from c…
Quantum computers can solve specific complex tasks for which no reasonable-time classical algorithm is known. Quantum computers do however also offer inherent security of data, as measurements destroy quantum states. Using shared entangled…
We will construct an MDS(= the most distance separable) code $C$ which admits a decomposition such that every factor is still MDS. An effective way of decoding will be also discussed.
Subspace codes and particularly constant dimension codes have attracted much attention in recent years due to their applications in random network coding. As a particular subclass of subspace codes, cyclic subspace codes have additional…
We construct new families of multi-error-correcting quantum codes for the amplitude damping channel. Our key observation is that, with proper encoding, two uses of the amplitude damping channel simulate a quantum erasure channel. This…
In this paper, we study quantum dense coding between two arbitrarily fixed particles in a (N+2)-particle maximally-entangled states through introducing an auxiliary qubit and carrying out local measurements. It is shown that the transmitted…
Entanglement-assisted quantum error correcting codes (EAQECCs) constructed from Reed-Solomon codes and BCH codes are considered in this work. It is provided a complete and explicit formula for the parameters of EAQECCs coming from any…
Convolutional codes are constructed, designed and analysed using row and/or block structures of unit algebraic schemes. Infinite series of such codes and of codes with specific properties are derived. Properties are shown algebraically and…
In this paper, a criterion of MDS Euclidean self-orthogonal codes is presented. New MDS Euclidean self-dual codes and self-orthogonal codes are constructed via this criterion. In particular, among our constructions, for large square $q$,…
New families of maximum distance separable (MDS) codes are constructed from elliptic curves by exploiting their group structures. In contrast to classical constructions based on divisors supported at a single rational point, the proposed…
A hybrid code can simultaneously encode classical and quantum information into quantum digits such that the information is protected against errors when transmitted through a quantum channel. It is shown that a hybrid code has the…
It is reasonable to expect the theory of quantum codes to be simplified in the case of codes of minimum distance 2; thus, it makes sense to examine such codes in the hopes that techniques that prove effective there will generalize. With…
It is known that maximum distance separable and maximum distance profile convolutional codes exist over large enough finite fields of any characteristic for all parameters $(n,k,\delta)$. It has been conjectured that the same is true for…
Quasi-twisted (QT) codes are a generalization of quasi-cyclic (QC) codes. Based on consta-cyclic simplex codes, a new explicit construction of a family of 2-generator quasi-twisted (QT) two-weight codes is presented. It is also shown that…
We address the problems of constructing quantum convolutional codes (QCCs) and of encoding them. The first construction is a CSS-type construction which allows us to find QCCs of rate 2/4. The second construction yields a quantum…
In this work, we study linear codes with the folded Hamming distance, or equivalently, codes with the classical Hamming distance that are linear over a subfield. This includes additive codes. We study MDS codes in this setting and define…
Modern quantum technologies in the fields of quantum computing, quantum simulation and quantum metrology require the creation and control of large ensembles of entangled particles. In ultracold ensembles of neutral atoms, highly entangled…
We provide a class of positive and trace-preserving maps based on symmetric measurements. From these positive maps we present separability criteria, entanglement witnesses, as well as the lower bounds of concurrence. We show by detailed…
We provide a constructive algorithm to find the best separable approximation to an arbitrary density matrix of a composite quantum system of finite dimensions. The method leads to a condition of separability and to a measure of…
It is conjectured that quantum computers are able to solve certain problems more quickly than any deterministic or probabilistic computer. A quantum computer exploits the rules of quantum mechanics to speed up computations. However, it is a…
For $(n,d)= (66,17),(78,19)$ and $(94,21)$, we construct quantum $[[n,0,d]]$ codes which improve the previously known lower bounds on the largest minimum weights among quantum codes with these parameters. These codes are constructed from…