2.4.2 Composing quantum operations
We can always compose two given qubit operations and to obtain a new qubit operation. Indeed, if is the input state and we first apply , we get . If we then apply , resulting state is . We will denote this composite operation by , so that
Be careful not to confuse the order of the two operations. If the composite operation is , this means that is applied first and is applied second! This is because stands next to , so it must be the first one to act on the state.
Exercise 2.4 (Linearity of a composed operation (optional)).
Verify that is again linear.
Hint: Use Eq. 2.20.
Solution.
Take an arbitrary state , first use the linearity of and then the linearity of : In the last step, we used Eq. 2.20.We can similarly compose three and more qubit operations. We will write and so on. In particular, we may obtain new qubit operations by composing rotations and reflections. We will discuss this in Section 2.4.3 below.
It is interesting to observe that all qubit operations that we discussed so far are invertible. This means that for any operation there exists another operation, which we write as , such that when we first apply and then (or the other way around) the state of the qubit is unchanged. 1111 11 This notation and Eq. 2.31 will remind you of the following: If is a nonzero number then is its inverse, which means that . In formulas, we can write
where is the identity operation which has the “trivial” property
(We could have also defined as , the rotation by an angle of zero.) Therefore holds for any state when extended by linearity.
As an example, let’s look at the operation . It is geometrically clear that if we first rotate by and then by then the quantum bit is unchanged. To see this more formally, we only need to use Eq. 2.29 twice:
and similarly if we first rotate by and then by . This means that the inverse operation is simply :
Similarly, since the operation amounts to a reflection, it is clear that applying it twice leaves the qubit state invariant. Indeed, from Eq. 1.17
By linearity, this means that for any state , so is not only invertible but its own inverse, i.e., .
Exercise 2.5 (Inverse of a composed operation).
Show that if and are invertible then so is . Express the inverse of the composed operation in terms of the individual inverses and .
Solution.
We have , since for any we haveIn fact, one can show that any linear operation that sends the qubit state space to itself is necessarily invertible. Indeed, this is the case for rotations and will also be the case for reflections that we will discuss next. This is in contrast to operations on probabilistic bits where, for example, the probabilistic flip operation maps any state to the uniform distribution (see 1.6) and hence is not invertible.