Let . The joint state after the environment interaction is . Taking its partial trace over the environment gives the exact reduced density operator
The conjugate in the upper off-diagonal entry follows from tracing . Normalization of the environment states and the Cauchy-Schwarz inequality imply .
For comparison, a phase-flip channel sends to , multiplying its off-diagonal entries by the real number . Consequently the claimed representation is valid, for a general input, provided the environment overlap is real, with
This is a genuine probability between zero and one. The environment maps printed in the question do not themselves imply that is real. For example, choose , so , and take . The qubit becomes , whose imaginary off-diagonal entries cannot come from any probabilistic mixture of and . These environment maps are a valid isometry and can be extended to a unitary interaction, so this is an actual counterexample to the unrestricted premise.
The general complex environment overlap in qubit dephasing has an exact corrected description. Write , , and let . Then
At , choose any phase. The dephasing channel includes both random phase errors and, when the overlap is complex, a coherent diagonal rotation. The subsequent probability formulas use the intended real-overlap phase-flip model.
Subtract the two density operators. The difference is Hermitian with zero diagonal and off-diagonal entry . A matrix has eigenvalues , because its square is . Its two singular values are therefore both . By the definition of the trace norm,
For the intended real-overlap phase-flip channel, , giving
This vanishes for a computational basis state, since a phase flip then changes only an unobservable global phase. Its largest value at fixed is , attained when . The general formula remains correct even when the probabilistic premise of part 1 fails.
Assume the three physical phase-flip channels act independently, with the same probability on each qubit, and encoding, recovery and decoding are ideal. Zero or one physical error is corrected. Hence
The probability of an uncorrectable two- or three-site error is .
One must also choose the logical convention consistently with the output phase error specified here. The usual phase-flip repetition code with codewords and has residual operator after two or three physical errors: their error syndrome equals that of the complementary zero- or one-error pattern. This operator exchanges those codewords, so plain inverse encoding would give logical , not .
To obtain the stated logical phase-flip convention, use the logical Hadamard convention for a phase-flip repetition code. Put a logical Hadamard gate before that encoding and after its decoding. The encoded state is
where the plus and minus states in these codewords are the real Hadamard basis states. The uncorrectable exchange is now conjugated to . With that convention the decoded density operator and its trace distance are exactly
For , , so coding reduces the trace distance. The displayed recovery probability means success of correction as a quantum operation on an arbitrary unknown input. If the particular input is a eigenstate, even the logical phase-error branch represents the same physical state, and the probability of recovering that particular state is one.
Independence is an extra noise assumption needed for the numerical probability. If all three physical qubits flip together with probability , each marginal still has the given phase-flip channel, but the logical failure probability is , not . More generally, for a classical joint phase-error distribution with a random number of flips, and ; the same decoded mixture holds in the stated logical convention. Thus marginal error probabilities alone do not determine the requested recovery probability. A complex environment overlap likewise requires the coherent rotation to be retained or separately compensated before this stochastic phase-error analysis applies.

Articles by others on the same topic (0)

There are currently no matching articles.