Graph-state preparation of a computational-basis input ($|+⟩⟼X^s|0⟩$)

A two-vertex graph state starts with two $|+⟩$ states joined by a Controlled-Z gate. Measuring the first vertex in the $X$ basis leaves the second in $X^{s}H|+⟩=X^s|0⟩$, where $s$ is the measurement outcome. Thus a known zero input can be supplied to a measurement wire using only a graph-state resource and a known Pauli frame. This preparation link precedes the links implementing the desired logical J gate; later measurement angles and output-bit corrections absorb its byproduct.