Section IV A: d^2 observable averages for n qubits
ProvedQAlgorithms.Papers.Independent.Advance50.P17.qubitObservablesFor qubits, put . Let be CPTP and unitary. Index Pauli products and input states by strings in , where each input factor is , or . Expand using the real tensor-product coefficients from and . Define . Every is normalized and every is Hermitian, and
Thus observable averages suffice. The source's one-qubit input matrices are normalized here and their coefficients recomputed accordingly.
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 pp.6--7: d^2 Hermitian averages for n qubits.
PRINTED inputs I,I+X,I+Y,I+Z have trace two. CHANGED: divide each factor by two;
productCoefficient is recomputed in that normalized basis. Zero qubits is permitted. -/
theorem qubitObservables (n : ℕ) (E : FiniteProcess (Qubits n) (Qubits n))
(U : Matrix.unitaryGroup (Qubits n) ℂ) :
(∀ k, IsDensityMatrix (tomographyProductInput n k) ∧ (productObservable n U k).IsHermitian) ∧
(∀ j, productPauli n j = ∑ k : Fin n → Fin 4,
(productCoefficient n j k : ℂ) • tomographyProductInput n k) ∧
proFidelity E.val (conjSuperop (U : Matrix (Qubits n) (Qubits n) ℂ)) =
(2 ^ n : ℝ)⁻¹ ^ 3 * ∑ k : Fin n → Fin 4,
effectProb (productObservable n U k) (E.val (tomographyProductInput n k)) ∧
Fintype.card (Fin n → Fin 4) = (2 ^ n) ^ 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
For every natural number , including , let , let be a channel on complex matrices indexed by , and let be a unitary matrix on that space; a channel means a map with a finite Kraus representation whose Kraus operators satisfy . Set , where
and put times the identity and for . For , define , , and , where , for , and, for , , , and all other values are ; define . Then every is positive semidefinite of trace one and every is Hermitian, and for every . Put , when and otherwise, and , with applied blockwise. Then
The number of indices is . When , the index sets each have one element and all tensor products and coefficient products are empty products.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.