Finite gate loops are checked by applying the gate twice and comparing the exact output state with the starting state. Exact arithmetic here means exact results for the stated model inputs; measured inputs still carry uncertainty and significant-figure limits.
highlighted = computed this step
The first gate can move the amplitudes away
Start from amplitudes 3/5 and 4/5. One X gate swaps the two slots, so a closed-loop audit must check the second gate too.
X[5354]=[5453]
The second gate closes the loop
The rendered row is the second X. It takes the swapped state and returns the original amplitudes, so the two-gate sequence acts like the identity on this state.
X[5453]=[5354]
Several finite gate loops return to their starts
The audit table is not a new gate rule. It checks three finite closed loops: two X-X basis rows and one Z-Z signed-amplitude row.
A reversible-looking box still needs a checked output
For this book, a gate box is honest only because the output state is computed and compared. The scan makes the closed-loop claim a row-by-row arithmetic statement.