For , adding exchanges the two outcomes of the same projective measurement. At an angle , the choices and therefore specify the same unordered pair of projectors: their labels differ by . An adaptive choice between these signs can be replaced by a fixed measurement and a classical label exchange. Together with Pauli-frame propagation along a measurement wire, this permits simultaneous measurements when all adaptive sign changes occur at these Clifford gate angles.
Using the printed measurement-vector convention, the unitary operator is
Thus it is a phase gate followed by a Hadamard gate, with angle sign opposite to the parameter in the catalogued J gate. Its rows are the conjugate transposes of the orthonormal measurement vectors, so it is unitary. Right multiplication by the Pauli Z gate changes the sign of the second column, which is exactly the effect of left multiplication by the Pauli X gate, exchanging the two rows. Explicitly,
Similarly, right multiplication by the Pauli X gate exchanges columns, giving
Therefore the exact identities, retaining the global phase in the second one, are
These supply Pauli-frame propagation along a measurement wire.
Label the chain cluster state from top to bottom by , and let be the phase-measurement outcomes on the first three vertices, with raw computational basis outcome on vertex four. Repeated one-bit teleportation leaves the last qubit, up to global phase, in
This sequential description applies even though the whole graph state is prepared first: a later Controlled-Z gate acts only on unmeasured qubits and commutes with earlier single-qubit measurement operators. It can therefore be moved past those measurements for the purpose of calculating each conditional branch.
Take and , so . After the second measurement the logical state is
For binary , the identities proved above imply the Pauli-frame propagation along a measurement wire rule
where means equality up to global phase. Choose the third angle adaptively as . Then , and
Reading the target circuit in temporal order gives its premeasurement state
Consequently
The Pauli Z gate changes only phases in the computational basis, while the Pauli X gate exchanges its two measurement outcomes. Thus the explicit choices are
Indeed, for every earlier outcome branch,
Hence averaging over the earlier random outcomes leaves exactly the target probability distribution. This implements the desired measurement-based quantum computation without physically removing the final Pauli frame.