§7: Bell measurement from CX and local X/Z measurements
ProvedQAlgorithms.Papers.Independent.Intakenext100.P52.bell_measurement_from_local_measurementsUse and . Then
Consequently destructive Bell measurement, even with an arbitrary reference system, is exactly followed by measurement with outcome labels . For Figure 12 start from , apply and , then measure . The two entangling gates commute, and for every normalized input its output branch is , with probability . Source correction: the displayed intermediate labels on p.15 are interchanged relative to the p.2 Bell definition.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P52
noncomputable section
open scoped Matrix ComplexConjugate
namespace QAlgorithms.Papers.Independent.Intakenext100.P52
open QAlgorithms.Papers.Independent.Information100.P21 (Vec)
open QAlgorithms.Papers.Independent.Gap20.P01 (applyRect)
/-- Bell measurement decomposition, PDF pp.15–16. Printed CX B_ij label map
is interchanged; changed to CX B_cd=|(-1)^c> |d>, consistent with p.2.
The bra identity holds with any reference, hence gives the full destructive
measurement instrument. Fig.12's two CXs share a target and commute. -/
theorem bell_measurement_from_local_measurements :
(∀ c d : Bool, act cnot (sourceBellBasis c d) =
tensorVec (equatorial 0 c) (ket d)) ∧
(∀ (R : Type) [Fintype R] [DecidableEq R] (psi : Vec (QubitPair × R)) (c d : Bool),
pairBra (sourceBellBasis c d) psi = localBellAnalysis c d psi) ∧
cxWires (0 : Fin 3) 1 * cxWires (2 : Fin 3) 1 =
cxWires (2 : Fin 3) 1 * cxWires (0 : Fin 3) 1 ∧
(∀ (psi : Vec Bool), IsState psi → ∀ c d : Bool,
figure12Branch c d psi =
teleportContraction psi (finiteMaxEntangled Bool) (sourceBellBasis c d) ∧
figure12Branch c d psi = (1 / 2 : ℂ) • act (pauliByproduct d c) psi ∧
‖figure12Branch c d psi‖ ^ 2 = (1 / 4 : ℝ)) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P52
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Identify bits with , let , , and let . Define , , and . The theorem asserts all of the following jointly: for every pair of bits , ; for every finite type with decidable equality, every complex vector indexed by , and every , the vectors indexed by satisfy
the three-bit permutation matrices and , which exclusive-or their control bit into bit , commute; and, for every with and every , putting and gives
The vector in the second assertion need not be normalized, and is allowed to be empty.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.