§2: one-qubit gate teleportation
ProvedQAlgorithms.Papers.Independent.Intakenext100.P52.one_qubit_gate_teleportationprove2quantum
Let be any one-qubit unitary, and write for bits , where . The four kets are orthonormal. For every normalized input , measuring registers against one of these kets, with resource , gives
Thus is the conditional output. The choice includes ordinary teleportation with the same labels.
Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P52
Formal statement
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)
/-- Rotated Bell gate teleportation, PDF pp.2–4, including U=I as Fig.1.
All four measured kets are orthonormal; branches retain their coefficient 1/2. -/
theorem one_qubit_gate_teleportation (U : Matrix Bool Bool ℂ)
(hU : U ∈ Matrix.unitaryGroup Bool ℂ) :
Orthonormal ℂ (fun p : QubitPair => rotatedBell U p.1 p.2) ∧
∀ (psi : Vec Bool), IsState psi → ∀ c d : Bool,
let b := teleportContraction psi (finiteMaxEntangled Bool) (rotatedBell U c d)
b = (1 / 2 : ℂ) • act (pauliByproduct d c * U) psi ∧
‖b‖ ^ 2 = (1 / 4 : ℝ) ∧ (2 : ℂ) • b = act (pauliByproduct d c * U) psi := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P52
end
Source
An introduction to measurement based quantum computation, arXiv:quant-ph/0508124v2, PDF p. 2, §2: one-qubit gate teleportation
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every unitary complex matrix indexed by Booleans, write , , and , where false and true are denoted by and , and is the coordinate unit vector at . The four vectors
are orthonormal. Moreover, for every with Euclidean norm and every pair of Boolean values , define by . Then
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.