Appendix G1: mixed samples with one pure anchor
OpenQAlgorithms.Papers.Independent.Intakethird100.P67.mixed_samples_pure_anchorLet a finite nonempty family of density operators generate all operators on the span of their supports, and assume the fixed anchor is exactly . Independently choose uniformly and uniformly on , and use with the controlled . Define by the actual partial trace and entrywise integral. The integrands are continuous and integrable on the interval and every finite-history unit cube. Then
The anchor is the unique supported fixed density operator. Using exact output records and the corresponding reverse history, the integral-defined emulator converges uniformly on supported density operators to . This is the exactly pure-anchor construction, without an unquantified near-purity extension.
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.28, G1: the EXACTLY pure anchor is the unique supported fixed state of
the continuous uniform-time channel. Its convergence permits supported-input emulation;
continuity/integrability of the displayed body is asserted, not assumed. -/
theorem mixed_samples_pure_anchor [Nonempty K] (S : K → Matrix I I ℂ) (a : K)
(hS : ∀ k, IsDensityMatrix (S k)) (hgen : Generates S)
(phi : EuclideanSpace ℂ I) (hphi : IsState phi) (hanchor : S a = pureDensity phi) :
(∀ (rho : Matrix I I ℂ) (k : K), Continuous (fun t : ℝ =>
traceRight (densityConjugation (mixedGate S a k t) (Matrix.kronecker rho (pureDensity minusVector))))) ∧
(∀ (rho : Matrix I I ℂ) (k : K) (i j : I), IntegrableOn (fun t : ℝ =>
traceRight (densityConjugation (mixedGate S a k t)
(Matrix.kronecker rho (pureDensity minusVector))) i j) (Set.Icc 0 1)) ∧
(∀ (rho : Matrix I I ℂ) (U : Matrix.unitaryGroup I ℂ) (T : ℕ) (h : Fin T → K) (i j : I),
IntegrableOn (fun ts : Fin T → ℝ => mixedHistoryOutput S a phi (U : Matrix I I ℂ) rho h ts i j)
(Set.pi Set.univ (fun _ : Fin T => Set.Icc (0 : ℝ) 1))) ∧
mixedSampleErasureChannel S a (pureDensity phi) = pureDensity phi ∧
(∀ rho : Matrix I I ℂ, IsDensityMatrix rho → InSampleSupport S rho →
mixedSampleErasureChannel S a rho = rho → rho = pureDensity phi) ∧
(∀ rho : Matrix I I ℂ, IsDensityMatrix rho → InSampleSupport S rho →
Tendsto (fun T : ℕ => traceNorm ((mixedSampleErasureChannel S a)^[T] rho - pureDensity phi)) atTop (nhds 0)) ∧
(∀ (U : Matrix.unitaryGroup I ℂ) (eps : ℝ), 0 < eps → ∃ N : ℕ, ∀ T ≥ N,
∀ rho : Matrix I I ℂ, IsDensityMatrix rho → InSampleSupport S rho →
traceDistance (mixedEmulate S a phi (U : Matrix I I ℂ) T rho) (densityConjugation (U : Matrix I I ℂ) rho) ≤ eps) := 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 finite index types with decidable equality, with nonempty, and fix . Let every be a positive semidefinite matrix on of trace , let be the functional-calculus value of on , and assume that the complex span of all nonempty products is . Let have norm , and assume . Write , , , and
where matrix integrals are taken entrywise with respect to Lebesgue measure. For and , let apply successively to the system and ancilla , put , , and , and define
The assertion is that is continuous for every complex matrix and every ; that each entry of is integrable on for every ; and that each entry of is integrable on for every complex matrix , every unitary , every natural number , and every history . It also asserts ; for every positive semidefinite of trace with , the implication ; for every such ,
where means -fold composition; and, for every unitary and every , the existence of a natural number such that, for every and every such ,
The definitions and integrability assertions include , using empty products and the zero-dimensional integration domain; no assumption is imposed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.