English
Related papers

Related papers: Constructions of entanglement-assisted quantum MDS…

200 papers

Let $\mathbb{F}_q$ be a finite field with $q=p^{e}$ elements, where $p$ is a prime number and $e \geq 1$ is an integer. In this paper, by means of generalized Reed-Solomon (GRS) codes, we construct two new classes of quantum…

Information Theory · Computer Science 2020-02-17 Hualu Liu , Xiusheng Liu

Quantum convolutional codes can be used to protect a sequence of qubits of arbitrary length against decoherence. In this paper, we give two new constructions of quantum MDS convolutional codes derived from generalized Reed-Solomon codes and…

Information Theory · Computer Science 2015-11-06 Baokun Ding , Tao Zhang , Gennian Ge

In this paper, we study the Hermitian hulls of generalized Reed-Solomon (GRS) codes over finite fields. For a given class of GRS codes, by extending the length, increasing the dimension, and extending the length and increasing the dimension…

Information Theory · Computer Science 2024-11-07 Ruhao Wan , Shixin Zhu

One of the central tasks in quantum error-correction is to construct quantum codes that have good parameters. In this paper, we construct three new classes of quantum MDS codes from classical Hermitian self-orthogonal generalized…

Information Theory · Computer Science 2015-08-06 Tao Zhang , Gennian Ge

Though the entanglement-assisted formalism provides a universal connection between a classical linear code and an entanglement-assisted quantum error-correcting code (EAQECC), the issue of maintaining large amount of pure maximally…

Quantum Physics · Physics 2011-03-30 Min-Hsiu Hsieh , Wen-Tai Yen , Li-Yi Hsu

In this paper, we study Euclidean and Hermitian hulls of generalized Reed-Solomon codes and twisted generalized Reed-Solomon codes, as well as the Hermitian hulls of Roth-Lempel typed codes. We present explicit constructions of MDS and AMDS…

Information Theory · Computer Science 2022-07-19 Lin Sok

In the previous research by Grassl, Huber and Winter, they proved a theorem which can make entanglement-assisted quantum error-correcting codes (EAQECC) from general quantum error-correcting codes (QECC). In this paper, we prove that the…

Quantum Physics · Physics 2022-05-30 Daiki Ueno , Ryutaroh Matsumoto

In this paper, we provide a framework for constructing entanglement-assisted quantum error-correcting codes (EAQECCs) from classical additive codes over a finite commutative local Frobenius ring $\mathcal{R}$. At the heart of the framework,…

Information Theory · Computer Science 2023-01-10 Tania Sidana , Navin Kashyap

Galois hulls of linear codes have important applications in quantum coding theory. In this paper, we construct some new classes of (extended) generalized Reed-Solomon (GRS) codes with Galois hulls of arbitrary dimensions. We also propose a…

Information Theory · Computer Science 2021-08-03 Xiaolei Fang , Renjie Jin , Jinquan Luo , Wen Ma

Quantum maximum-distance-separable (MDS for short) codes are an important class of quantum codes. In this paper, by using Hermitian self-orthogonal generalized Reed-Solomon (GRS for short) codes, we construct five new classes of $q$-ary…

Information Theory · Computer Science 2023-07-11 Ruhao Wan , Shixin Zhu

In the setting of entanglement-assisted quantum error-correcting codes (EAQECCs), the sender and the receiver have access to pre-shared entanglement. Such codes promise better information rates or improved error handling properties.…

Quantum Physics · Physics 2024-02-02 Gaojun Luo , Martianus Frederic Ezerman , Markus Grassl , San Ling

We show how entanglement-assisted codes can be constructed from arbitrary quantum codes by associating them with quantum codes for erasure channels. If a subset of physical qubits is correctable for an erasure error, then it naturally forms…

Quantum Physics · Physics 2026-03-04 Jaszmine DeFranco , Andrew Nemec

Absolutely maximally entangled (AME) states are pure multi-partite generalizations of the bipartite maximally entangled states with the property that all reduced states of at most half the system size are in the maximally mixed state. AME…

Quantum Physics · Physics 2018-02-14 Zahra Raissi , Christian Gogolin , Arnau Riera , Antonio Acín

We extend the relation between absolutely maximally entangled (AME) states and quantum maximum distance separable (QMDS) codes by constructing whole families of QMDS codes from their parent AME states. We introduce a reduction-friendly form…

Quantum Physics · Physics 2021-02-10 Daniel Alsina , Mohsen Razavi

Contrary to the assumption that most quantum error-correcting codes (QECC) make, it is expected that phase errors are much more likely than bit errors in physical devices. By employing the entanglement-assisted stabilizer formalism, we…

Quantum Physics · Physics 2011-04-27 Yuichiro Fujiwara , Min-Hsiu Hsieh

This paper develops a general method for constructing entanglement-assisted quantum low-density parity-check (LDPC) codes, which is based on combinatorial design theory. Explicit constructions are given for entanglement-assisted quantum…

Information Theory · Computer Science 2012-08-28 Yuichiro Fujiwara , David Clark , Peter Vandendriessche , Maarten De Boeck , Vladimir D. Tonchev

Let $p$ be a prime and let $q$ be a power of $p$. In this paper, by using generalized Reed-Solomon (GRS for short) codes and extended GRS codes, we construct two new classes of quantum maximum-distance- separable (MDS) codes with parameters…

Information Theory · Computer Science 2018-07-17 Weijun Fang , Fang-Wei Fu

In this paper, we present three new classes of $q$-ary quantum MDS codes utilizing generalized Reed-Solomon codes satisfying Hermitian self-orthogonal property. Among our constructions, the minimum distance of some $q$-ary quantum MDS codes…

Information Theory · Computer Science 2019-09-18 Xiaolei Fang , Jinquan Luo

Let $p$ be an odd prime and $r,s,m$ be positive integers. In this study, we initiate our exploration by delving into the intricate structure of all repeated-root cyclic codes and their duals with a length of $2^rp^s$ over the finite field…

Information Theory · Computer Science 2024-06-21 Lanqiang Li , Ziwen Cao , Tingting Wu , Li Liu

Maximum distance separable (MDS) codes are optimal where the minimum distance cannot be improved for a given length and code size. Twisted Reed-Solomon codes over finite fields were introduced in 2017, which are generalization of…

Information Theory · Computer Science 2020-08-11 Hongwei Liu , Shengwei Liu