Nielsen & Chuang · Chapter 8, Quantum noise and quantum operations · p. 381
Exercise8.22 - The matrix of a qubit operator after the amplitude damping channel, in the computational basis
Amplitude damping of a qubit, entry by entry.
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
A qubit that loses energy to its environment, such as an atom decaying from its excited state to its ground state , undergoes amplitude damping. The channel that describes it has one parameter between and , the probability that an excited qubit decays. The exercise is to write the qubit’s state as a matrix in the computational basis and to compute, entry by entry, the matrix of its image under .
Amplitude Damping
Let be the state space of a qubit and , its computational basis. For in , the projector onto is the operator on .✦The lowering operator on is the operator , which takes to and to zero.✦
The operation elements and of amplitude damping with parameter are the operators on (1)The amplitude damping channel with parameter is the map that takes an operator on to (2)✦
The Claim
For an operator on , write for its entries in the computational basis. The claim is made for every operator of unit trace, , a density matrix among them.
Theorem 1. Let , and let be an operator on of unit trace. Then the matrix of in the computational basis is (3)✦
What Is Checked
The claim is stated over the amplitude damping channel of (2), its operation elements and of (1), made of the projectors, and the lowering operator, and the entries of an operator in the computational basis.