Section IV A, Eq.(11): reconstruction from input states and observables
ProvedQAlgorithms.Papers.Independent.Advance50.P17.reconstruction11Let , be CPTP, and be a unitary on the -dimensional register. Choose unitaries with , a density-matrix operator basis , and a Hermitian operator basis . Compute and by and , and put . Then
The equality is interpreted in , with real left side. The indexed observable averages determine the fidelity, and their coefficients are independent of . The adjoint in the definition of corrects the expansion printed before (11), as required by (10).
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 IV A, PDF p.6, Eq.(11): d^4 expectation values suffice.
PRINTED: b expands U V_j U^dagger. CHANGED: expand U V_j^dagger U^dagger,
as required by Eq.(10). Coefficients are computed from bases, never assumed to fit E. -/
theorem reconstruction11 (E : FiniteProcess I I) (U : Matrix.unitaryGroup I ℂ)
(V : I × I → Matrix.unitaryGroup I ℂ)
(hv : ∀ j k, ((V j : Matrix I I ℂ)ᴴ * (V k : Matrix I I ℂ)).trace =
if j = k then (Fintype.card I : ℂ) else 0)
(r s : Module.Basis (I × I) ℂ (Matrix I I ℂ))
(hr : ∀ k, IsDensityMatrix (r k)) (hs : ∀ l, (s l).IsHermitian) :
(proFidelity E.val (conjSuperop (U : Matrix I I ℂ)) : ℂ) =
(Fintype.card I : ℂ)⁻¹ ^ 3 *
∑ k, ∑ l, reconstructionCoefficients r s V U k l * (s l * E.val (r k)).trace ∧
Fintype.card ((I × I) × (I × I)) = Fintype.card I ^ 4 := 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 a finite nonempty type with decidable equality, put , and let be a channel on its complex matrix space, meaning for finitely many operators with . Let be unitary and let be unitary matrices satisfying when and otherwise. Let and be complex vector-space bases of the full matrix space, with every positive semidefinite of trace one and every Hermitian. Write and for the respective basis coordinates, and define
For if and otherwise, put , where the tensor extension applies blockwise, and define . With , the following equality holds in , with the real fidelity embedded into :
In addition, .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.