Naimark's theorem
Die Sigg es noch nit övversatz. Ehr luurt üch de änglesche Originalversion aan.
Naimark's theorem is a fundamental fact concerning measurements. It states that every general measurement can be implemented in a simple way that's reminiscent of Stinespring representations of channels:
- The system to be measured is first combined with an initialized workspace system, forming a compound system.
- A unitary operation is then performed on the compound system.
- Finally, the workspace system is measured with respect to a standard basis measurement, yielding the outcome of the original general measurement.
Theorem statement and proof
Let be a system and let be a collection of positive semidefinite matrices satisfying
which is to say that they describe a measurement of Also let be a system whose classical state set is which is the set of possible outcomes of this measurement.
Naimark's theorem states that there exists a unitary operation on the compound system so that the implementation suggested by the following figure yields measurement outcomes that agree with the given measurement meaning that the probabilities for the different possible measurement outcomes are precisely in agreement.
To be clear, the system starts out in some arbitrary state while is initialized to the state. The unitary operation is applied to and then the system is measured with a standard basis measurement, yielding some outcome
The system is pictured as part of the output of the circuit, but for now we won't concern ourselves with the state of after is performed, and can imagine that it is traced out. We'll be interested in the state of after is performed later in the lesson, though.
An implementation of a measurement in this way is clearly reminiscent of a Stinespring representation of a channel, and the mathematical underpinnings are similar as well. The difference here is that the workspace system is measured rather than being traced out like in the case of a Stinespring representation.
The fact that every measurement can be implemented in this way is pretty simple to prove, but we're going to need a fact concerning positive semidefinite matrices first.
One way to find the square root of a positive semidefinite matrix is to first compute a spectral decomposition.
Because is positive semidefinite, its eigenvalues must be nonnegative real numbers, and by replacing them with their square roots we obtain an expression for the square root of
With this concept in hand, we're ready to prove Naimark's theorem. Under the assumption that has classical states, a unitary operation on the pair can be represented by an matrix, which we can view as an block matrix whose blocks are The key to the proof is to take to be any unitary matrix that matches the following pattern.