The Exercise
A quantum system in a mixed state passes through a noisy process , a channel or a memory that acts on alone. The process is known to be good on pure states, though only on those in the support of : each such comes out as a state whose overlap with is at least . The problem asks what this guarantees for itself, entanglement with other systems included: a lower bound on the entanglement fidelity of under in terms of .
A State and an Operation
The state space of is a finite-dimensional complex Hilbert space . The state of is a density operator on given by an orthonormal basis of and probabilities with : (1) The support of is the subspace of spanned by the with .
A trace-preserving quantum operation on is given by a finite set of operation elements , linear operators on that satisfy the completeness relation; it takes an operator on to (2)
The entanglement fidelity of under is the number that measures how well the entanglement between and a reference system purifying survives when acts on .
The Claim
Theorem 1. Let be a state of as in (1), let be a trace-preserving quantum operation on with operation elements as in (2), and let be a real number. Suppose that every pure state in the support of satisfies (3) Then the entanglement fidelity of under satisfies (4)✦
What Is Checked
The claim is stated over every state of a finite-dimensional system written in an orthonormal basis as in (1), every trace-preserving operation given by finitely many operation elements as in (2), and every real number . About these constructions the library proves Theorem 1.