Lean, informalized

Nielsen & Chuang · Chapter 12, Quantum information theory · p. 598

Exercise 12.35 - The projectors onto the coset states of a binary code, signed by the cosets of its dual, add up to the identity

Phase coset states of a code resolve the identity.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Exercise

Take a register of nn qubits and a binary linear code C2C_2 of length nn, a subspace of the bit vectors ℤ2n\mathbb{Z}_2^n. Its dual C2⟂C_2^\perp is the code of the bit vectors zz with z⋅y=0z \cdot y = 0 for every codeword y∈C2y \in C_2, where z⋅yz \cdot y counts, mod 2, the positions at which both carry a one.✦

A coset a+C2a + C_2 of the code gives the equal superposition of the computational basis states |a+y⟩|a + y\rangle over the codewords yy, and a bit vector zz puts the sign (−1)z⋅y(-1)^{z \cdot y} on each term. With one such state for each coset of C2C_2 and each coset of C2⟂C_2^\perp, the exercise asks to show that these states resolve the identity on the register.

A Register of Qubits

A quantum system SS is a physical system whose state space is a finite dimensional complex Hilbert space.✦ A pure state ψ\psi of SS is a vector of unit norm in the state space of SS, ‖ψ‖=1\lVert \psi \rVert = 1, determined physically up to a global phase.✦

For a finite group GG, the group system ℂ[G]\mathbb{C}[G] is the quantum system whose state space is the space of complex functions on GG.✦ The bit register of nn qubits, one for each of the nn positions of a bit vector, is the group system ℂ[ℤ2n]\mathbb{C}[\mathbb{Z}_2^n] of the bit vectors under addition mod 2.✦ The computational basis {|w⟩}\{|w\rangle\} of the bit register ℂ[ℤ2n]\mathbb{C}[\mathbb{Z}_2^n] is the orthonormal basis of its state space with one vector |w⟩|w\rangle for each bit vector ww, the function equal to 11 at ww and to 00 elsewhere.✦

Coset States

For bit vectors uu, vv and xx, the twisted coset state |x+C2⟩u,v|x + C_2\rangle_{u,v} of C2C_2 is the pure state of the register |x+C2⟩u,v=1|C2|∑y∈C2(−1)u⋅y|x+y+v⟩.|x + C_2\rangle_{u,v} = \frac{1}{\sqrt{|C_2|}} \sum_{y \in C_2} (-1)^{u \cdot y}\, |x + y + v\rangle .(1)✦

The phase coset state |ξz,a⟩|\xi_{z,a}\rangle of C2C_2, for bit vectors zz and aa, is the twisted coset state of aa with its signs set by zz and no shift: |ξz,a⟩=|a+C2⟩z,0=1|C2|∑y∈C2(−1)z⋅y|a+y⟩.|\xi_{z,a}\rangle = |a + C_2\rangle_{z,0} = \frac{1}{\sqrt{|C_2|}} \sum_{y \in C_2} (-1)^{z \cdot y}\, |a + y\rangle .(2)✦

The coset index set ℐ\mathcal{I} of C2C_2 is the set of pairs of a coset of C2C_2 and a coset of C2⟂C_2^\perp in ℤ2n\mathbb{Z}_2^n: ℐ=ℤ2n/C2×ℤ2n/C2⟂.\mathcal{I} = \mathbb{Z}_2^n / C_2 \times \mathbb{Z}_2^n / C_2^\perp .(3)✦

The phase coset family of C2C_2 assigns to each index p=(a+C2,z+C2⟂)p = (a + C_2,\, z + C_2^\perp) the phase coset state built from a fixed representative aa of the first coset and a fixed representative zz of the second: |ξp⟩=|ξz,a⟩.|\xi_p\rangle = |\xi_{z,a}\rangle .(4)✦

The Claim

Theorem 1. Let C2C_2 be a binary linear code of length nn with dual C2⟂C_2^\perp. The projectors onto the phase coset states |ξp⟩|\xi_p\rangle, one for each pair pp of a coset of C2C_2 and a coset of C2⟂C_2^\perp, sum to the identity on the state space of the register of nn qubits: ∑p∈ℐ|ξp⟩⟨ξp|=I.\sum_{p \in \mathcal{I}} |\xi_p\rangle\langle \xi_p| = I .(5)✦

What Is Checked

The claim is stated over the phase coset family (4) on the index set (3), as vectors in the state space of the bit register.

About these constructions the library proves that each twisted coset state (1) has unit norm.