| 引用本文: |
|
| Citation: |
|
计量
- 文章访问数: 4390
- PDF下载量: 1136
- 被引次数: 0
物理学报. 2008, 57(1): 28-30.
doi: 10.7498/aps.57.28.
量子Generalized Reed-Solomon码
- 收稿日期: 2007-04-02
- 修回日期: 2007-04-17
- 刊出日期: 2008-01-15
摘要: 构造出了一族量子纠错码，这族码具有参数［［n，n-2k，k+1］］q，是q维量子系统上的码，q是任意素数的幂.这族码的最小距离达到了理论上限，因此，以码距来说，它是最优的.证明了当2≤n≤q或者q2-q+2≤n≤q2时，码都是存在的.
-
关键词:
- 量子Generalized Reed-Solomon码 /
- 量子MDS码 /
- 量子纠错码 /
- 量子信息
English Abstract
Quantum Generalized Reed-Solomon codes
- Received Date:
02 April 2007
- Accepted Date:
17 April 2007
- Published Online:
15 January 2008
Abstract: We construct a family of quantum error-correcting codes with parameters ［［n，n-2k，k+1］］q which are defined in q-dimensional quantum systems，where q is an arbitrary prime power. These codes are optimal in the sense that the minimum distance is maximal. It is shown that codes exist for all n satisfying 2≤n≤q or q2-q+2≤n≤q2.
下载:
