Scribd
Upload
3 views2 pages

Assignment

The document outlines a homework assignment for an advanced quantum course focusing on error correction using plaquette models and generator matrices. It includes tasks for constructing message and code words, developing error correcting codes, and analyzing generator matrices to derive codewords and parity check matrices. The assignment emphasizes practical applications of classical error correction techniques in quantum information theory.

Uploaded by

Robert Cullen
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views2 pages

Assignment

The document outlines a homework assignment for an advanced quantum course focusing on error correction using plaquette models and generator matrices. It includes tasks for constructing message and code words, developing error correcting codes, and analyzing generator matrices to derive codewords and parity check matrices. The assignment emphasizes practical applications of classical error correction techniques in quantum information theory.

Uploaded by

Robert Cullen
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Advanced Quantum HW 2: Plaquette model

Information & Computation/ SV & Hamming codes PH601, January 17, 2025

1: Classical Error Correction “by hand”: Playing with Simple Plaquettes

1. Code space for plaquette model: Construct message words and code words with square plaquette for the
error models BR (BL ) in which the right (left) half of the bits in the square are flipped as discussed in the
class. Determine the action of logical operations in each case.
2. For the hexagonal plaquette, suppose we define the message bits as symbols {0, 1, 2} distributed in a
hexagon shown in figure (1). Construct an error correcting code (by distributing the symbols {0, 1, 2} in
different sectors of hexagon) which is resilient to an error model in which all the symbols in the left half
are set to 0. Also find out the action of logical operations on code words.

Figure 1: Hexagonal plaquette

3. Consider the error model which resets all left sided or right sided (with respect to the vertical line
bisecting the hexagon) from any symbolic value to zero. Construct an encoding and error correcting
scheme that does as well as you can.

2: Generator matrices

4. Consider the following generator matrices:


 
1 0 1 0
G1 = 0 1 0 1 (1a)
0 0 1 1
 
1 1 0 0 0 0
G2 = 0 0 1 1 0 0 (1b)
0 0 0 0 1 1
 
1 0 0 0 0 1
G3 = 0 0 1 1 0 0 (1c)
0 1 0 0 1 0

1
Advanced Quantum HW 2: Plaquette model
Information & Computation/ SV & Hamming codes PH601, January 17, 2025

 
1 1 0 0 0 0
G4 = 1 0 1 0 0 0 (2a)
1 1 1 1 1 1
 
1 1 0 0 1 1 0
1 0 1 0 1 0 1
 
1
G5 =  0 0 1 1 1 0 (2b)
1 0 1 0 1 1 0
1 0 0 1 0 1 1
 
1 0 1 0 1 0 1 0
0 1 0 1 0 1 0 1
G6 = 
0
 (2c)
0 1 1 0 0 1 1
0 0 0 0 1 1 1 1

For the generator matrices G1 , · · · , G6 ,


(a) Construct the elements of message space and code space.
(b) What are the error correction codes that the generator matrices G1 , · · · , G6 give rise to.

5. Construct the codewords and parity check matrix for the codes corresponding to generator matrices
{G1 , · · · , G6 }.
Definition: The parity-check matrix H of a linear code is a matrix that defines the constraints on the
codewords such that every valid codeword c satisfies the condition,

HcT = 0. (3)

(a) For each of the generator matrices {G1 , · · · , G6 }, verify that the parity check matrix H is related to
the generator matrix G by the orthogonality condition,

HGT = 0. (4)

(b) If G is in systematic form, show that H is given by [P T | In−k ], where P is derived from G = [Ik | P ].

You might also like