ToddBrun 量子通信、量子纠错、LDPC、Altera FPGA时序分析教程文件.ppt

General Entanglement-Assisted Quantum Error-Correcting Codes Todd A. Brun, Igor Devetak and Min-Hsiu Hsieh Communication Sciences Institute QEC07 [[n,k]] quantum error correcting code measure + correct Pauli unitaries Z X Pauli group Discretization of errors Shor ’95; Steane ‘96; Gottesman ’96; Calderbank, Rains, Shor, Sloane ‘96 An [[n,k]] quantum error correcting code is described by a (n-k) ￡ 2n parity check matrix H. Its rowspace B(H) is an isotropic subspace of commuting stabilizer generators dual containing code and commute n=5, k=1 The symplectic product is defined by and commute (anti-commute) iff Classical symplectic codes The correctable error set E is defined by: degenerate code The code space is defined as the simultaneous +1 eigenspace of the stabilizer operators Correction involves measuring the “error syndrome” (i.e. the simultaneous eigenvector of the stabilizer generators) , distinct error syndromes Y error on 4th q-bit Quantum stabilizer codes If E1 and E2 are in E, then at least one of the two conditions hold: Properties of Stabilizer Codes We can see that stabilizer codes have the following properties: The code corresponds to an isotropic (that is, dual-containing) classical code over a symplectic space. The error correcting conditions are almost the same as classical (except for the existence of degenerate quantum codes, in which distinct errors share the same error syndrome). Correction consists of measuring an error syndrome and performing an appropriate correcting action (a unitary). An [[n,k;c]] EA quantum error correcting code is described by a (n-k) ￡ 2n parity check matrix H. B = rowspace(H). Again, Take a general symplectic matrix H. Its rowspace B can be written as Canonical example symplecti