Tradeoffs for reliable quantum information storage in 2D systems

Sergey Bravyi, David Poulin, Barbara Terhal · 2009 · Phys. Rev. Lett. 104, 050503 (2010)

| 编号 QE113 | 主题 qLDPC 码 | 链接 arXiv:0909.5200 |

摘要

摘要保留原文（英文）

摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。

We ask whether there are fundamental limits on storing quantum information reliably in a bounded volume of space. To investigate this question, we study quantum error correcting codes specified by geometrically local commuting constraints on a 2D lattice of finite-dimensional quantum particles. For these 2D systems, we derive a tradeoff between the number of encoded qubits k, the distance of the code d, and the number of particles n. It is shown that kd^2=O(n) where the coefficient in O(n) depends only on the locality of the constraints and dimension of the Hilbert spaces describing individual particles. We show that the analogous tradeoff for the classical information storage is k\sqrt{d} =

本站词条在引用该文献时，会以 wikilink（sources/QE113）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。