Entanglement Of Graph State And Perfermance Of Stabilizer Code In Pauli Channel

Quantum information is a comprehensive subject which related to quantum physics, classical information processing, computer science and many other basic subjects, and it has a wide scope of knowledge.Entanglement is a resource of quantum information processing. In recent years, entanglement has aroused the concern of many scholars, and also gained many results, but only the entanglement of bipartition has been resolved, the entanglement of multi-partition has not been resolved yet. Although so far, scholars have proposed many kinds of methods to measure the entanglement of multi-partition, such as robust entanglement measurement, geometric measurement, relative entropy measurement, etc., but these methods require very complex parameters, making the entanglement very difficult to achieve. However, the invention of graph state simplifies the measurement of multi-partition, so we can determine the bound of entanglement of quantum state within a very short time.Noise exists everywhere in our daily life. People are constantly looking for an effective method to eliminate the noise, but, even now, can not completely eliminate the noise, only to try to reduce the noise impact on the system. Error correction used in practice is very complex technology, but the key idea of error correction is to protect the information in the original by adding some redundant information, so even if the original information is subject to noise pollution, we have the means to recover or decode the message, making the recovery of the original information can be achieved.This paper mainly includes two parts. First part mainly introduces the iterative method to compute the entanglement of graph states, and analyses the results using this method. Second part mainly introduces effective channel which includes encoding, noising, decoding, and exactly computes the performance of stabilizer code.