A random unitary channel has . Its Choi matrix is a convex combination of maximally entangled pure states.
On a -dimensional Hilbert space, let and . The unitaries form an orthogonal operator basis under the Hilbert-Schmidt inner product.
Averaging conjugation by all Heisenberg-Weyl operators completely depolarizes a system:Summing over phases kills off-diagonal matrix elements, and averaging shifts makes all diagonal elements equal. Acting on subsystem of a bipartite operator gives . This identity turns joint convexity of quantum relative entropy into monotonicity under partial trace.
For any qubit operator ,Expand in the Pauli operator basis. The identity term is fixed, while every nonidentity coefficient has two positive and two negative contributions and cancels. Thus forgetting a uniformly random Pauli key sends every density operator to the maximally mixed state. This is the dimension-two Heisenberg-Weyl twirling channel, since replacing by changes only an irrelevant phase in the conjugation.
A one-qubit Pauli channel applies with probabilities . It maps a Bloch vector diagonally by independently contracting or reversing its three components.
A bit-flip channel applies the Pauli X gate with probability and does nothing otherwise. If the classical error outcome is not recorded, its output is the convex mixture , not a coherent superposition of the two alternatives.
// Target: quantum-information-theory.bigb
For pure input , squared quantum fidelity after the bit-flip channel is . The last factor is the square of the input's Bloch component. Rotational symmetry of the uniform pure-qubit average gives , because . Hence the average squared fidelity is . Averaging an unsquared fidelity or over a different ensemble gives a different quantity.
// Target: quantum-mechanics.bigb
A qubit depolarizing channel shrinks every Bloch vector by the same factor: . In this retention-parameter convention it is completely positive for ; the usual mixture of unchanged and fully randomized states uses .
For the quantum depolarizing channel applying the identity with probability and each nonidentity Pauli operator with probability , the entanglement-assisted classical capacity is the displayed number of bits per use. Here is Shannon entropy of the four listed probabilities. Its unassisted product-state capacity is . Both vanish at . If instead denotes replacement by , then and complete depolarization is at . The original entanglement-assisted capacity paper gives the depolarizing-channel formula.
With Bloch vector retention , the unassisted product-state capacity of a quantum depolarizing channel is . Its entanglement-assisted capacity is , obtained by expanding Shannon entropy around the uniform four-outcome distribution. Consequently their limiting ratio is three, independent of the linear noise-parameter convention.
The displayed qubit quantum channel is completely positive for . Indeed its Pauli channel probabilities are for the identity and for each nonidentity Pauli operator. In the range the coefficient is negative, so the displayed expression is not a convex mixture of the unchanged and maximally mixed states, even though the Pauli representation is a valid random unitary channel. Its Bloch vector is contracted and reversed by the factor . The Holevo capacity of a qubit depolarizing channel remains throughout this interval.
If the identity is applied with probability and the three nonidentity Pauli operators each with probability , the Bloch vector retention factor is . Thus complete depolarization occurs at , not at zero. The Holevo capacity of a qubit depolarizing channel becomes in this identity-probability parametrization.
For the retention parameter , the Holevo capacity isEvery output has Von Neumann entropy at least the value on a pure input, . Two equiprobable orthogonal pure inputs attain this minimum entropy individually and have maximally mixed average output, attaining the bound. Additivity of Holevo capacity makes the unassisted classical capacity of a quantum channel equal to this value. King's depolarizing-channel capacity paper proves additivity with an arbitrary other channel.
For , every output qubit has Von Neumann entropy at least . A product input therefore has output entropy at least . The average output has entropy at most , so its Holevo quantity is bounded by the displayed expression. This allows correlated classical message labels and joint output measurements, but requires product quantum inputs. The Holevo bound and Fano's inequality turn it into the corresponding asymptotic rate bound.
The phase-flip channel is . It multiplies the and components of the Bloch vector by and leaves the component fixed.
Independent successive applications of the phase-flip channel preserve diagonal entries and multiply off-diagonal entries by . Hence with the displayed parameter, for nonnegative integers . If , the limit is the completely dephasing channel, equivalently a nonselective projective measurement in the computational basis. A time-interval law can be iterated this way only under the memoryless composition assumption.
A dephasing channel suppresses off-diagonal entries of a density matrix in a preferred basis while preserving quantum state populations. Complete dephasing is identical to a projective measurement in that basis with its outcome discarded.
For the Bell correlations versus a classical mixture example, completely dephasing Alice's qubit in the computational basis maps to . It preserves their perfect agreement and each reduced density matrix, yet destroys the correlation. This is why testing only populations can miss damage to a quantum memory: the stored quantum coherence may have disappeared while every preferred-basis measurement still looks correct. The joint Von Neumann entropy rises from zero to one bit, although each local entropy stays fixed.
Correlated dephasing caused by the same fluctuating rotation on all qubits. Averaging over the unknown angle suppresses quantum coherence between sectors with different total eigenvalues. Within one eigenspace, however, every state acquires the same global phase, so its density matrix is preserved. Such an eigenspace is a decoherence-free subspace for this noise model. The assumption concerns the shared rotation; independent local phase noise generally destroys this protection.
For a qubit, computational basis dephasing with complex overlap maps to and preserves the diagonal entries. Conjugation by the phase gate maps the same entry to . Since these scalar factors commute, their quantum channels commute on every density matrix. More directly, an interaction and a diagonal phase gate give the same joint quantum state in either order on the specified initial environment state. This need not hold for an interaction that changes the quantum state populations.
Different ensemble members accumulating different deterministic phases can shorten their averaged Bloch vector even when each member remains in a pure state. Averaging static frequency offsets gives an effective dephasing channel. It need not represent irreversible phase loss in each individual system; an appropriate refocusing pulse can reverse static offsets. Changing offsets during the sequence requires a temporal noise model.
An environment interaction preserving the computational populations multiplies a qubit's upper off-diagonal density entry by . A real phase-flip channel representation exists for every input precisely when is real, with probability . For , the channel is a phase-flip channel of probability followed by the diagonal unitary operator . The coherent phase cannot be discarded just because the populations are unchanged.
In a Hadamard gate, phase gate, Hadamard gate sequence starting from , let a population-preserving interaction correlate with a normalized environment state between the two Hadamard gates. Use and . The environment-valued output-zero coefficient is , whose squared norm is the displayed probability. The modulus controls contrast, while shifts the quantum interference fringe. For there is no mixing; a deterministic relative quantum phase accounts for the shift.
Articles by others on the same topic
There are currently no matching articles.