Proposition 4: continuous SWAP coupling approximates density-matrix evolution
OpenQAlgorithms.Papers.Independent.Intakethird100.P67.proposition4_continuous_swapPrepare independent reference registers in the same unit vector , a system density operator , a real coupling , and time . Let , , and let be the actual system partial trace of the joint evolution. Then
For every normalized pure system input , the absolute overlap of with is at least . These joint and reduced bounds refer to the same physical evolution.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P67
noncomputable section
open scoped ComplexConjugate Matrix Matrix.Norms.L2Operator
attribute [local instance] Classical.propDecidable
open MeasureTheory Filter
namespace QAlgorithms.Papers.Independent.Intakethird100.P67
variable {I J K L A : Type*} [Fintype I] [DecidableEq I]
[Fintype J] [DecidableEq J] [Fintype K] [DecidableEq K]
[Fintype L] [DecidableEq L] [Fintype A] [DecidableEq A]
/-- PDF p.24, Proposition 4, E4–E6: both reduced-state estimates and the absolute
joint overlap. Real subtraction prevents truncation at n=1; n=0 is excluded. -/
theorem proposition4_continuous_swap (phi : EuclideanSpace ℂ I) (hphi : IsState phi)
(n : ℕ) (hn : 1 ≤ n) (coupling t : ℝ) (ht : 0 ≤ t) :
(∀ rho : Matrix I I ℂ, IsDensityMatrix rho →
let actual := traceRight (swapJoint phi n coupling t rho)
let target := densityConjugation (positivePhaseEvolution (effectiveHamiltonian phi n coupling) (-t)) rho
((n : ℝ) - 1) / (n + 1) ≤ rootFidelity actual target ∧ traceDistance actual target ≤ 6 / n) ∧
(∀ psi : EuclideanSpace ℂ I, IsState psi → ((n : ℝ) - 1) / (n + 1) ≤
‖inner ℂ (tensorVec (act (positivePhaseEvolution (effectiveHamiltonian phi n coupling) (-t)) psi)
(referenceVector phi n)) (act (positivePhaseEvolution (swapHamiltonian n coupling) (-t))
(tensorVec psi (referenceVector phi n)))‖) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P67
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a finite index type with decidable equality, let have norm , let be a natural number, let be arbitrary, and let . Put , , , and , where swaps the system register with reference register : on basis labels it sends to . For every positive semidefinite matrix of trace , define
Then
with square roots defined by functional calculus. In addition, for every norm- vector ,
The case is included; no sign or magnitude restriction is imposed on , and there is no upper bound on .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.