Recorded binary Clifford circuits and exact decoding #
Each recorded outcome specifies precisely the CNOTs and correction used by one learning round. Lists are chronological: the head is performed first. The inverse acts on the final computational basis vector to reconstruct the original amplitude, with its physically irrelevant global phase explicit.
The simultaneous CNOT operation, with its explicit inverse permutation.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The correction is H for bit zero and HS for bit one.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The pivot-coordinate vanishes in the CNOT target vector.
The physical Clifford operation determined by the sampled difference and the correction coin. A zero difference records the identity operation.
Equations
- One or more equations did not get rendered due to their size.
Instances For
A recorded outcome is sufficient to specify all gates in a round.
Equations
Instances For
Circuit composition in chronological order.
Equations
- LeanPool.SingleCopyStabilizer.Circuit.circuitEquiv [] = LinearEquiv.refl ℂ (LeanPool.SingleCopyStabilizer.Measurement.Amplitude ι)
- LeanPool.SingleCopyStabilizer.Circuit.circuitEquiv (op :: ops) = LeanPool.SingleCopyStabilizer.Circuit.roundEquiv op.1 op.2 ≪≫ₗ LeanPool.SingleCopyStabilizer.Circuit.circuitEquiv ops
Instances For
Computational basis amplitudes, with value one at the chosen string.
Equations
Instances For
Classical description of the learned state: undo the recorded circuit on the final measured basis string.
Equations
Instances For
Inverting the recorded circuit recovers the original amplitude with the same global phase as its final computational basis amplitude.
Version matching StabilizerState.full_diagonal_basis_amplitude.
If the input is normalized, the scalar occurring at a basis-vector endpoint must have unit modulus.
The circuit endpoint condition and exact recovery up to a specified global phase are equivalent.