Section IV A, Eq.(12) and reference note [45]: at most 2d^2 observable averages
ProvedQAlgorithms.Papers.Independent.Advance50.P17.reconstruction12Let be CPTP and unitary on a register of dimension . Choose an orthogonal unitary basis , with , and any density-matrix operator basis . Compute from and set . Then
Writing and gives Hermitian observables with . Hence at most observable averages suffice, or when the paired operators are Hermitian. These are counts of distinct averages, not samples. The adjoint corrects the printed formula consistently with (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.(12), and note [45], p.15: at most 2d^2 Hermitian averages.
The adjoint in pairedOperator corrects the same printed omission as Eq.(11). -/
theorem reconstruction12 (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 : Module.Basis (I × I) ℂ (Matrix I I ℂ)) (hr : ∀ k, IsDensityMatrix (r k)) :
(proFidelity E.val (conjSuperop (U : Matrix I I ℂ)) : ℂ) =
(Fintype.card I : ℂ)⁻¹ ^ 3 * ∑ k, (pairedOperator r V U k * E.val (r k)).trace ∧
(∀ k, (hermitianReal (pairedOperator r V U k)).IsHermitian ∧
(hermitianImag (pairedOperator r V U k)).IsHermitian ∧
pairedOperator r V U k = hermitianReal (pairedOperator r V U k) +
Complex.I • hermitianImag (pairedOperator r V U k)) ∧
Fintype.card ((I × I) × Bool) = 2 * Fintype.card I ^ 2 ∧
((∀ k, (pairedOperator r V U k).IsHermitian) →
proFidelity E.val (conjSuperop (U : Matrix I I ℂ)) =
(Fintype.card I : ℝ)⁻¹ ^ 3 *
∑ k, effectProb (pairedOperator r V U k) (E.val (r k))) ∧
Fintype.card (I × I) = Fintype.card I ^ 2 := 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, admitting a finite Kraus representation with . Let and all matrices , indexed by , be unitary, and assume when and otherwise. Let be a complex basis of the matrix space consisting of positive semidefinite trace-one matrices. Using its coordinate functions , set
Define for and otherwise, , with applied blockwise, and . Then, writing , one has the complex equality
every is Hermitian and ; and . Furthermore, if every is Hermitian, then the real equality holds. Finally, .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.