Two-qudit reconstruction coefficients and endpoint maps
OpenQAlgorithms.Papers.Independent.Intakethird100.P71.twoQudit_reconstructionLet , , and let a locally scrambled projective experiment have second features in region order , with . Its unique coefficient solution is
The constructed map is a two-sided inverse of the measurement channel. At the endpoints,
For product inputs the local endpoint is . The tensor-of-maps formulation covers correlated inputs without factoring their marginals.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P71
noncomputable section
open MeasureTheory
open scoped Matrix ComplexConjugate ENNReal Matrix.Norms.Elementwise
namespace QAlgorithms.Papers.Independent.Intakethird100.P71
attribute [local instance] Classical.propDecidable
local notation "Config" n:max d:max =>
QAlgorithms.Papers.Independent.Information100.P21.Config (P := Fin n) (fun _ => d)
local notation "Op" n:max d:max =>
QAlgorithms.Papers.Independent.Information100.P21.Op (Config n d)
attribute [local instance] QAlgorithms.Papers.Independent.Intakethird100.P71.matrixContinuousENorm
local notation "Unitary" n:max d:max => Matrix.unitaryGroup (Config n d) ℂ
local notation "Local" n:max d:max => Fin n → Matrix.unitaryGroup (Fin d) ℂ
open QAlgorithms.Papers.Independent.Information100.P63 (tensorPower)
/-- PDF pp.5–6 Eqs.(24)–(28): exact toy-model coefficients and the local/global
endpoint superoperators. Eq.(27) is a tensor of maps on general inputs, with a
product-input specialization; Eq.(28) contains Tr(X) I on arbitrary X. -/
theorem twoQudit_reconstruction {d : ℕ} (hd : 2 ≤ d) (E : ProjectiveEnsemble 2 d)
(hls : LocallyScrambled (prior E)) (w : ℝ)
(hw : 2*(d : ℝ)/((d : ℝ)^2+1) ≤ w ∧ w ≤ 1) (hf : ToyFeature (prior E) w) :
CoefficientSystem (prior E) (toyCoefficients d w) ∧
(∀ r, CoefficientSystem (prior E) r → r = toyCoefficients d w) ∧
(∀ X : Op 2 d,
efReconstruct (toyCoefficients d w) (snapshotMeasurementMap (prior E) X) = X ∧
snapshotMeasurementMap (prior E) (efReconstruct (toyCoefficients d w) X) = X) ∧
(∀ X : Op 2 d, efReconstruct (toyCoefficients d 1) X =
QAlgorithms.piSuperop (fun _ : Fin 2 => oneSiteInverse d) X) ∧
(∀ X Y : Matrix (Fin d) (Fin d) ℂ,
efReconstruct (toyCoefficients d 1) (twoSiteProduct X Y) =
twoSiteProduct (oneSiteInverse d X) (oneSiteInverse d Y)) ∧
(∀ X : Op 2 d,
efReconstruct (toyCoefficients d (2*(d : ℝ)/((d : ℝ)^2+1))) X =
((d : ℂ)^2+1) • X - X.trace • 1) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P71
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a natural number, let , and let supply a probability law on unitary matrices on . Put , and assume that is invariant under for all local unitary matrices . For , let be the partial trace obtained by summing matching complementary row and column indices, let have entries when agree outside and otherwise, and define . Let satisfy , and assume for every singleton and for the empty and full subsets. Define
and . The theorem states that satisfies the equations
for every , and that every real function satisfying these equations equals . For every complex matrix , and . In addition, putting , the map equals the linear map , meaning that it sends each matrix unit to ; in particular for all complex matrices . Finally, for every ,
These last identities use the indicated endpoint coefficients regardless of the value of the given .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.