Quantum Convolutional Codes Derived From Reed-Solomon and Reed-Muller Codes

Salah A. Aly, Andreas Klappenecker, Pradeep Kiran Sarvepalli

备注：: 5 pages; updated parameters of classical (whence quantum) RM convolutional codes

英文摘要：

Convolutional stabilizer codes promise to make quantum communication more reliable with attractive online encoding and decoding algorithms. This paper introduces a new approach to convolutional stabilizer codes based on direct limit constructions. Two families of quantum convolutional codes are derived from generalized Reed-Solomon codes and from Reed- Muller codes. A Singleton bound for pure convolutional stabilizer codes is given.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Determining when a truncated generalised Reed-Solomon code is Hermitian self-orthogonal

We prove that there is a Hermitian self-orthogonal $k$-dimensional truncated generalised Reed-Solomon code of length $n \leqslant q^2$ over ${\mathbb F}_{q^2}$ if and only if there is a polynomial $g \in {\mathbb F}_{q^2}$ of degree at most $(q-k)q-1$ such that $g+g^q$ has $q^2-n$ distinct zeros. This allows us to determine the smallest $n$ for which there is a Hermitian self-orthogonal $k$-dimensional truncated generalised Reed-Solomon code of length $n$ over ${\mathbb F}_{q^2}$, verifying a conjecture of Grassl and Rötteler. We also provide examples of Hermitian self-orthogonal $k$-dimension…

2021-12-23cs.ITmath.COmath.IT

Quantum Reed-Muller Codes

This paper presents a set of quantum Reed-Muller codes which are typically 100 times more effective than existing quantum Reed-Muller codes.

1997-03-24quant-ph

One way quantum repeaters with quantum Reed-Solomon codes

We show that quantum Reed-Solomon codes constructed from classical Reed-Solomon codes can approach the capacity on the quantum erasure channel of $d$-level systems for large dimension $d$. We study the performance of one-way quantum repeaters with these codes and obtain a significant improvement in key generation rate compared to previously investigated encoding schemes with quantum parity codes and quantum polynomial codes. We also compare the three generation of quantum repeaters using quantum Reed-Solomon codes and identify parameter regimes where each generation performs the best.

2018-05-15quant-ph

Representation of Boolean Quantum Circuits as Reed-Muller Expansions

In this paper we show that there is a direct correspondence between quantum Boolean operations and certain forms of classical (non-quantum) logic known as Reed-Muller expansions. This allows us to readily convert Boolean circuits into their quantum equivalents. A direct result of this is that the problem of synthesis and optimization of quantum Boolean logic can be tackled within the field of Reed-Muller logic.

2003-05-22quant-ph

Quantum Reed-Muller Codes

A set of quantum error correcting codes based on classical Reed-Muller codes is described. The codes have parameters [[n,k,d]] = [[2^r, 2^r - C(r,t) - 2 sum_{i=0}^{t-1} C(r,i), 2^t + 2^{t-1} ]].

1996-08-22quant-ph

Nonbinary Quantum Reed-Muller Codes

We construct nonbinary quantum codes from classical generalized Reed-Muller codes and derive the conditions under which these quantum codes can be punctured. We provide a partial answer to a question raised by Grassl, Beth and Roetteler on the existence of q-ary quantum MDS codes of length n with q\le n\le q^2-1.

2005-01-31quant-ph

更多相关论文收起更多论文

从Reed-Muller码展开中本地蒸馏

Local distillation from Reed Muller codes unfolding

Alice & Bob

本文通过揭示展开所基于的代数结构，推广了Ruiz等人提出的Reed-Muller蒸馏厂展开方法，展示了距离4的Reed-Muller蒸馏厂的2D本地布局及距离4和7的3D本地布局，实现了高保真度的CCZ态和T态制备。

2026-05-07quant-ph

Fault-tolerant conversion between the Steane and Reed-Muller quantum codes

Steane's 7-qubit quantum error-correcting code admits a set of fault-tolerant gates that generate the Clifford group, which in itself is not universal for quantum computation. The 15-qubit Reed-Muller code also does not admit a universal fault-tolerant gate set but possesses fault-tolerant T and control-control-Z gates. Combined with the Clifford group, either of these two gates generate a universal set. Here, we combine these two features by demonstrating how to fault-tolerantly convert between these two codes, providing a new method to realize universal fault-tolerant quantum computation. On…

2014-03-11quant-ph