Research indexJournal article
量子稳定子码的码字纠缠
Chen
Zhongguo kexue. Wulixue Lixue Tianwenxue1 Feb 2015
NobleIDark:/48914/w1/20260522/AB1E8595DOI10.1360/sspma2014-00327
量子稳定子码的码字纠缠
Chen · Zhongguo kexue. Wulixue Lixue Tianwenxue · 2015 · Subscription
NobleIDark:/48914/w1/20260522/AB1E8595DOI10.1360/sspma2014-00327
The full text is at the publisher
You can read the abstract here, or open it at the publisher.
Abstract
Quantum communication and quantum computation are two important parts of quantum information science. Quantum algorithm usually uses real equally weighted states, among them are graph states, whose entanglement is well studied. Quantum communication is inevitably connected with quantum error correcting codes (QECC). The most important and frequently used QECCs are quantum stabilizer codes, which can be seen as the combination of graph states with classical error correcting codes. We argue that the complexity of quantum coding is closely related to the entanglement of the code. We prove that entanglement measured by the geometric measure, the robustness and the relative entropy of entanglement are equal for a stabilizer quantum codeword. The entanglement upper and lower bounds are determined from the generators of a quantum code. CSS codes are quantum codes derived from classical codes. We prove that the entanglement of CSS code equals its number of classical generators when the CSS code is dual-containing. We give the entanglement of codewords for Gottesman codes and related codes. An iterative algorithm is developed to calculate the entanglement numerically.