This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: May 5, 2005 Physics 681481; CS 483: Discussion of #7 1. (a) If only onequbit bitflip errors are allowed, then the general corruption of an nqubit code word  Ψ i is of the form (  d i 1 + n X i =1  a i i X i )  Ψ i . (1) We need 2( n +1) dimensions to accomodate each of the n +1 terms in (1) in orthogonal two dimensional subspaces, and an nqubit code word provides 2 n dimensions. We therefore require 2 n ≥ 2 n + 2 . (2) The smallest n satisfying this condition is n = 3, for which it holds as an equality. (b) Take the two threequbit codewords to be  i =  000 i ,  1 i =  111 i . (3) The two operators Z 1 Z 2 and Z 2 Z 3 (4) commute with each other and act as the identity on both code words (3). X 1 commutes with the second and anticommutes with the first; X 3 commutes with the first and anticommutes with the second; and X 2 anticommutes with both. So measuring both of the operators (4) projects the corrupted state (1) onto one of the four terms with a pattern of eigenvalues...
View
Full Document
 Spring '05
 ANON
 Physics, Cryptography, Binary numeral system, Code word, Konrad Zuse, nqubit code word

Click to edit the document details