Controlled bit flips with a common target commute
ProvedQAlgorithms.Papers.Independent.Intakenext100.P52.cxWires_shared_target_commutemeasurement-based-quantum-computationquantum-circuits
Let be a finite set of qubit wires. Let , with and . Write for the controlled bit flip that replaces the target bit by and leaves every other bit unchanged. Then, as matrices on the full computational register,
The two controls may coincide. This circuit identity justifies reordering the entangling gates in the Bell-measurement decomposition of teleportation.
Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P52 noncomputable section open QAlgorithms QAlgorithms.Papers.Independent.Intakenext100.P52 set_option autoImplicit false
Formal statement
theorem QAlgorithms.Papers.Independent.Intakenext100.P52.cxWires_shared_target_commute {V : Type*} [Fintype V] [DecidableEq V]
(a b t : V) (ha : a ≠ t) (hb : b ≠ t) :
cxWires a t * cxWires b t = cxWires b t * cxWires a t := by sorrySource
R. Jozsa, An introduction to measurement based quantum computation, https://arxiv.org/abs/quant-ph/0508124v2, PDF pp.15–16, Figure 12 and its caption; general finite-wire form of the shared-target commutation identity.