Depolarizing noise weight above one 2026-10-14
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.
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 47 3 Solution Created 2026-10-03 Updated 2026-10-14
Use the Hilbert-Schmidt inner product normalized by the dimension: . The identity and the three Pauli matrices are Hermitian, each has square , and each nonidentity Pauli matrix has zero trace. For distinct nonidentity indices, the Pauli matrix multiplication law gives , which is traceless. ThereforeThere are four such orthonormal operators, and the complex vector space of two-by-two matrices has dimension four. Hence they form an orthonormal basis. Taking the inner product of any with each basis element proves, for arbitrary complex and not just Hermitian ones,For example, if , its four coefficients are , , , and , respectively.
For the joint error, regard the two prescribed basis outputs as the columns of an environment-valued linear map. Its coefficient array in the usual output-row, input-column convention isThe source's other array is arranged as a column of the images of basis kets; it must not be mistaken for this coefficient array acting on an amplitude column. Applying the just-proved Pauli matrix expansion componentwise in any environment orthonormal basis gives the Pauli decomposition of a qubit-environment isometry:To check the potentially delicate sign of the Pauli Y gate coefficient, use and . The four terms then giveLinearity proves the expansion for every input pure state. The environment coefficient vectors need not be normalized or mutually orthogonal. Consequently this expansion includes coherent combinations of Pauli errors, rather than asserting that every quantum channel is a probabilistic Pauli channel.
For the recovery probability, use the usual independent-use interpretation of the given phase-flip channel: each of the three transmitted qubits has a Pauli Z gate error independently with probability . The phase-flip repetition code uses logical codewords and . The decoding Hadamard gates convert physical phase flips to bit flips because . We can then analyze the two decoding controlled-NOT gates and the final Toffoli gate directly, rather than assuming a recovery rule.
Let be the error bits after this basis conversion. For a logical basis input , the three data bits before inverse encoding are . The two controlled-NOT gates produceThe Toffoli gate flips the first wire when both of the last two bits are one. Its residual error isThe last two wires carry an error syndrome independent of . Thus this transformation preserves the amplitudes of an arbitrary superposition: zero or one phase error returns the original unknown qubit, while two or three phase errors leave the logical Pauli X gate applied to it. The probability of universally successful recovery is thereforeEquivalently, the decoded quantum channel is , with logical failure of the three-qubit phase-flip repetition code . For , the failure probability is below , since . A special input that is a Pauli X eigenstate is unchanged even by the residual logical error; this does not make the code correct that error on an unknown input. Its squared quantum fidelity with a particular pure input is . If the errors on different channel uses are correlated, the marginal probability alone is insufficient: the general universal success probability is the probability of at most one error.
Past exam of the mathematics course of the University of Cambridge 2005 iii Paper 37 4 b Solution Created 2026-10-03 Updated 2026-10-14
There is a normalization error in the original PDF: the first term contains rather than . For a normalized qubit density operator, that printed expression has trace , so it is not a quantum channel except at . The intended depolarizing channel is the Pauli channel that leaves the input unchanged with probability and applies each nonidentity Pauli matrix with probability , for . Its Kraus operators areand , proving that it is trace-preserving and a completely positive map.
Write the input in its Bloch vector representation,Conjugation by a Pauli matrix keeps its own Bloch vector component and reverses the other two. More explicitly, for and for . HenceThe corrected quantum channel therefore givesThus its action isThe Bloch sphere is sent to a sphere of radius about the origin of the Bloch ball. At the action is the identity. For the Bloch vector shrinks without changing direction. At every input becomes the maximally mixed density operator . For , the Bloch vector reverses direction and shrinks, reaching factor at . The reversal is compatible with complete positivity because this remains a probabilistic mixture of Pauli matrices. The parameter here is the total nonidentity-error probability, not the retention parameter used in some definitions of the quantum depolarizing channel.
For completeness, retain the PDF literally and call its output . The same calculation givesThis has no normalized-output Bloch ball interpretation as printed. If it is manually normalized, thenThat different transformation sends to , rather than to the input, and agrees with the intended answer only at . The literal and corrected conventions therefore cannot be silently identified.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 34 3 a Solution Created 2026-10-03 Updated 2026-10-14
The PDF's first Pauli term contains an undefined . For the stated depolarizing channel, use , consistently with the other two terms. This is the minimal typographical correction needed to define the intended Pauli channel.
Write using its Bloch vector. The Pauli matrices satisfy for and for . Thus conjugating by each nonidentity Pauli matrix leaves one Bloch component unchanged and reverses the other two. Summing the three conjugates givesSubstitution yieldsso the Pauli-mixture parametrization of qubit depolarization, with here the total error probability, givesThere is also a genuine range error in the printed claim. For its full assumption, , and holds exactly when . For example gives ; on the output is , with negative Bloch component. No could produce this output from that input, since its component would be .
The corrected channel is still completely positive in the larger range: its original Pauli probabilities are . This is depolarizing noise weight above one; the formula with is not a convex mixture with weights , but it has a valid random unitary channel representation. The subsequent parts can therefore be solved both in the printed regime and in the actual parameter range.
The four index pairs giveThe last global phase cancels under conjugation. Hence the Pauli channel probabilities are
Every linear map from a qubit into the tensor product of that qubit and an environment can be expanded in the Pauli matrix orthonormal basis of operators. If and , then the four coefficient vectors areThese environment vectors need not be orthogonal, so this is an operator expansion rather than a claim that the quantum channel is a classical Pauli channel. Physical isometries additionally preserve the inner products of the two input basis states.
Pauli expansion of a quantum error 2026-10-14
The tensor products of single-qubit Pauli matrices form an orthogonal basis of the operator space on qubits, so every linear error operator has a Pauli expansion. Using , with scalar phases absorbed into the coefficients, its computational basis action is , with binary arithmetic. This describes coherent errors as well as individual Pauli errors; it does not assume that the noise is a probabilistic Pauli channel. A physical noise map has Kraus operators of this form when the usual quantum channel description applies, for instance when the initial system and environment are uncorrelated.