Constructing new q-ary quantum MDS codes with distances bigger than q/2 from generator matrices

2018 ◽  
Vol 18 (3&4) ◽  
pp. 223-230
Author(s):  
Xianmang He
Keyword(s):  
Information Theory ◽  
Quantum Information ◽  
Minimum Distance ◽  
Quantum Information Theory ◽  
Error Correcting Codes ◽  
Mds Codes ◽  
Quantum Error ◽  
Generator Matrices ◽  
Quantum Mds Codes

The construction of quantum error-correcting codes has been an active field of quantum information theory since the publication of \cite{Shor1995Scheme,Steane1998Enlargement,Laflamme1996Perfect}. It is becoming more and more difficult to construct some new quantum MDS codes with large minimum distance. In this paper, based on the approach developed in the paper \cite{NewHeMDS2016}, we construct several new classes of quantum MDS codes. The quantum MDS codes exhibited here have not been constructed before and the distance parameters are bigger than q/2.

scholarly journals ON OPTIMAL QUANTUM CODES

2004 ◽  
Vol 02 (01) ◽  
pp. 55-64 ◽  
Author(s):  
MARKUS GRASSL ◽  
THOMAS BETH ◽  
MARTIN RÖTTELER
Keyword(s):  
Minimum Distance ◽  
Prime Power ◽  
Quantum Systems ◽  
Error Correcting Codes ◽  
Mds Codes ◽  
Quantum Codes ◽  
Maximum Distance Separable ◽  
Shortened Codes ◽  
Quantum Error ◽  
Quantum Mds Codes

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 prime power. It is shown that codes with parameters 〚n, n - 2d + 2, d〛q exist for all 3≤n≤q and 1≤d≤n/2+1. We also present quantum MDS codes with parameters 〚q2, q2-2d+2, d〛q for 1≤d≤q which additionally give rise to shortened codes 〚q2-s, q2-2d+2-s, d〛q for some s.

New entanglement-assisted quantum MDS codes

2021 ◽  
pp. 2150016
Author(s):  
Binbin Pang ◽  
Shixin Zhu ◽  
Liqi Wang
Keyword(s):  
Coding Theory ◽  
Minimum Distance ◽  
Linear Codes ◽  
Error Correcting Codes ◽  
Mds Codes ◽  
Maximum Distance Separable ◽  
Number Formula ◽  
Minimum Distances ◽  
Quantum Error ◽  
Quantum Mds Codes

Entanglement-assisted quantum error-correcting codes (EAQECCs) can be obtained from arbitrary classical linear codes based on the entanglement-assisted stabilizer formalism, which greatly promoted the development of quantum coding theory. In this paper, we construct several families of [Formula: see text]-ary entanglement-assisted quantum maximum-distance-separable (EAQMDS) codes of lengths [Formula: see text] with flexible parameters as to the minimum distance [Formula: see text] and the number [Formula: see text] of maximally entangled states. Most of the obtained EAQMDS codes have larger minimum distances than the codes available in the literature.

scholarly journals Constructions of q-ary entanglement-assisted quantum MDS codes with minimum distance greater than q+1

2016 ◽  
Vol 16 (5&6) ◽  
pp. 423-434
Author(s):  
Jihao Fan ◽  
Hanwu Chen ◽  
Juan Xu
Keyword(s):  
Minimum Distance ◽  
Linear Codes ◽  
Error Correcting Codes ◽  
Entangled States ◽  
Mds Codes ◽  
Standard Quantum ◽  
Maximally Entangled States ◽  
Quantum Error ◽  
Quantum Mds Codes

he entanglement-assisted stabilizer formalism provides a useful framework for constructing quantum error-correcting codes (QECC), which can transform arbitrary classical linear codes into entanglement-assisted quantum error correcting codes (EAQECCs) by using pre-shared entanglement between the sender and the receiver. In this paper, we construct five classes of entanglement-assisted quantum MDS (EAQMDS) codes based on classical MDS codes by exploiting one or more pre-shared maximally entangled states. We show that these EAQMDS codes have much larger minimum distance than the standard quantum MDS (QMDS) codes of the same length, and three classes of these EAQMDS codes consume only one pair of maximally entangled states.

New constructions of entanglement-assisted quantum MDS codes from negacyclic codes

2019 ◽  
Vol 17 (03) ◽  
pp. 1950022 ◽  
Author(s):  
Ruihu Li ◽  
Guanmin Guo ◽  
Hao Song ◽  
Yang Liu
Keyword(s):  
Minimum Distance ◽  
Linear Codes ◽  
Error Correcting Codes ◽  
Optimal Number ◽  
Mds Codes ◽  
Quantum Codes ◽  
General Statement ◽  
Negacyclic Codes ◽  
Maximum Distance Separable ◽  
Quantum Error

When constructing quantum codes under the entanglement-assisted (EA) stabilizer formalism, one can ignore the limitation of dual-containing condition. This allows us to construct EA quantum error-correcting codes (QECCs) from any classical linear codes. The main contribution of this manuscript is to make a general statement for determining the optimal number of pre-shared qubits instead of presenting only specific cases. Let [Formula: see text] and [Formula: see text], where [Formula: see text] is an odd prime power, [Formula: see text] and [Formula: see text]. By deeply investigating the decomposition of the defining set of negacyclic codes, we generalize the number of pre-shared entanglement pairs of Construction (1) in Lu et al. [Quantom Inf. Process. 17 (2018) 69] from [Formula: see text] to arbitrary even numbers less than or equal to [Formula: see text]. Consequently, a series of EA quantum maximum distance separable (EAQMDS) codes can be produced. The absolute majority of them are new and the minimum distance can be up to [Formula: see text]. Moreover, this method can be applied to construct many other families of EAQECCs with good parameters, especially large minimum distance.

QALO-MOR: Improved antlion optimizer based on quantum information theory for model order reduction

2021 ◽  
pp. 1-11
Author(s):  
Rosy Pradhan ◽  
Mohammad Rafique Khan ◽  
Prabir Kumar Sethy ◽  
Santosh Kumar Majhi
Keyword(s):  
Information Theory ◽  
Quantum Information ◽  
Real World ◽  
Model Order Reduction ◽  
Order Reduction ◽  
Quantum Information Theory ◽  
Hunting Behavior ◽  
Model Order ◽  
Ant Lion Optimization ◽  
Real World Problems

The field of optimization science is proliferating that has made complex real-world problems easy to solve. Metaheuristics based algorithms inspired by nature or physical phenomena based methods have made its way in providing near-ideal (optimal) solutions to several complex real-world problems. Ant lion Optimization (ALO) has inspired by the hunting behavior of antlions for searching for food. Even with a unique idea, it has some limitations like a slower rate of convergence and sometimes confines itself into local solutions (optima). Therefore, to enhance its performance of classical ALO, quantum information theory is hybridized with classical ALO and named as QALO or quantum theory based ALO. It can escape from the limitations of basic ALO and also produces stability between processes of explorations followed by exploitation. CEC2017 benchmark set is adopted to estimate the performance of QALO compared with state-of-the-art algorithms. Experimental and statistical results demonstrate that the proposed method is superior to the original ALO. The proposed QALO extends further to solve the model order reduction (MOR) problem. The QALO based MOR method performs preferably better than other compared techniques. The results from the simulation study illustrate that the proposed method effectively utilized for global optimization and model order reduction.

scholarly journals Entanglement and Disordered-Enhanced Topological Phase in the Kitaev Chain

Universe ◽  
2019 ◽  
Vol 5 (1) ◽  
pp. 33 ◽  
Author(s):  
Liron Levy ◽  
Moshe Goldstein
Keyword(s):  
Phase Diagram ◽  
Information Theory ◽  
Quantum Information ◽  
Critical Point ◽  
Entanglement Entropy ◽  
Quantum Information Theory ◽  
Topological Phase ◽  
Many Body ◽  
Zero Modes ◽  
Many Body Systems

In recent years, tools from quantum information theory have become indispensable in characterizing many-body systems. In this work, we employ measures of entanglement to study the interplay between disorder and the topological phase in 1D systems of the Kitaev type, which can host Majorana end modes at their edges. We find that the entanglement entropy may actually increase as a result of disorder, and identify the origin of this behavior in the appearance of an infinite-disorder critical point. We also employ the entanglement spectrum to accurately determine the phase diagram of the system, and find that disorder may enhance the topological phase, and lead to the appearance of Majorana zero modes in systems whose clean version is trivial.

Sign in / Sign up

Export Citation Format

Share Document