arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1302.3247quant-ph
收藏

置换不变量子码

Permutation-invariant quantum codes

Yingkai Ouyang

摘要:

量子码是物理系统的希尔伯特空间的子空间,其被选择为针对给定类别的错误是可校正的,其中信息可以被编码。理想情况下,量子代码位于物理系统的基础空间内。当物理模型为海森堡铁磁体且没有外部磁场时,相应的地空间包含所有排列不变态。我们使用组合学和算子理论的技术来构造置换不变量子码族。这些码的长度与$t^2$成比例;一个码族完美地校正任意权重的$t$误差,而另一个码族近似地校正$t$自发衰减误差。我们的代码的性能的分析,相对于自发衰变错误利用初等矩阵分析,在那里我们重新审视和扩展的量子纠错标准的Knill和Laflamme,梁,庄,尼尔森和山本。

英文摘要:

A quantum code is a subspace of a Hilbert space of a physical system chosen to be correctable against a given class of errors, where information can be encoded. Ideally, the quantum code lies within the ground space of the physical system. When the physical model is the Heisenberg ferromagnet in the absence of an external magnetic field, the corresponding ground-space contains all permutation-invariant states. We use techniques from combinatorics and operator theory to construct families of permutation-invariant quantum codes. These codes have length proportional to $t^2$; one family of codes perfectly corrects arbitrary weight $t$ errors, while the other family of codes approximately correct $t$ spontaneous decay errors. The analysis of our codes' performance with respect to spontaneous decay errors utilizes elementary matrix analysis, where we revisit and extend the quantum error correction criterion of Knill and Laflamme, and Leung, Chuang, Nielsen and Yamamoto.

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

↑