Section I: unitary invariance from metric and chaining
ProvedQAlgorithms.Papers.Independent.Advance50.P17.unitaryInvarianceLet be a chaining family of metrics on finite-dimensional CPTP maps. Let be CPTP, and let and be unitaries on and , respectively. Writing and for their conjugation channels,
The statement applies to arbitrary positive finite input and output dimensions.
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P17
noncomputable section
open MeasureTheory Filter
open scoped Matrix ComplexConjugate Topology
namespace QAlgorithms.Papers.Independent.Advance50.P17
open QAlgorithms.Papers.Independent.Information100.P53 (fidelity)
open QAlgorithms.Papers.Independent.Information100.P08 (canonicalPurification)
open QAlgorithms.Papers.Independent.Information100.P75 (hermitianReal)
variable {I J K : Type} [Fintype I] [Fintype J] [Fintype K]
[DecidableEq I] [DecidableEq J] [DecidableEq K]
[Nonempty I] [Nonempty J] [Nonempty K]
/-- Section I, PDF p.2: unitary pre- and post-processing preserve every chaining process metric. -/
theorem unitaryInvariance (delta : ProcessDistance) (hm : ProcessMetrics delta)
(hc : ProcessChaining delta) (E F : FiniteProcess I J)
(U : Matrix.unitaryGroup J ℂ) (V : Matrix.unitaryGroup I ℂ) :
delta (conjSuperop (U : Matrix J J ℂ) ∘ E.val ∘ conjSuperop (V : Matrix I I ℂ))
(conjSuperop (U : Matrix J J ℂ) ∘ F.val ∘ conjSuperop (V : Matrix I I ℂ)) =
delta E.val F.val := by sorry
end QAlgorithms.Papers.Independent.Advance50.P17
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty types with decidable equality. Let assign a real number to every pair of maps between complex matrix spaces of any finite types with decidable equality. Assume that, on channels between every pair of finite nonempty types, is nonnegative, vanishes exactly on equal channels, is symmetric, and satisfies the triangle inequality; also assume that for all composable channels , . Here a channel means a map admitting a finite representation with . For any channels from matrices indexed by to matrices indexed by , and any unitary matrices on and on , writing , one has
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.