Objective-preserving Haar symmetry reduction
OpenQAlgorithms.Papers.Independent.Support50.P24.symmetryReductionLet , , and let be the Choi matrix of a deterministic sequential -slot comb, or of a parallel strategy for . Choi matrices use the unnormalized, input-first convention. Group the wires as and . Let be the actual inversion performance operator in (S77), with normalized Haar measure and the factor . Define and
The defining matrix integrals and scalar objective integrand are integrable. The matrix satisfies the same class of comb constraints, both and commute with every , and
Thus imposing the symmetry preserves every attainable objective and every optimum.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P24
noncomputable section
open QAlgorithms MeasureTheory
open scoped BigOperators Matrix ComplexConjugate ComplexOrder Matrix.Norms.Elementwise
namespace QAlgorithms.Papers.Independent.Support50.P24
attribute [local instance] Classical.decEq Classical.propDecidable
attribute [local instance] QAlgorithms.Papers.Independent.Support50.P24.groupedContinuousENorm
/-- PDF pp.3,21-22,24: the concrete Haar average is feasible, invariant and
objective preserving for either sequential or parallel combs. All integrability is concluded. -/
theorem symmetryReduction (d n : ℕ) (hd : 0 < d) (parallel : Bool)
(C : GroupedComb d (n+1))
(hC : if parallel then ParallelFeasible C else SequentialFeasible d (n+1) C) :
Integrable (@performanceKernel d n) (QAlgorithms.Papers.Independent.Next46.P24.haar d) ∧
Integrable (fun U => (C * performanceKernel U).trace.re)
(QAlgorithms.Papers.Independent.Next46.P24.haar d) ∧
Integrable (averagingKernel C)
((QAlgorithms.Papers.Independent.Next46.P24.haar d).prod
(QAlgorithms.Papers.Independent.Next46.P24.haar d)) ∧
(if parallel then ParallelFeasible (averageComb C)
else SequentialFeasible d (n+1) (averageComb C)) ∧
(∀ V W : Matrix.specialUnitaryGroup (Fin d) ℂ,
performanceOperator d n * groupAction V W = groupAction V W * performanceOperator d n ∧
averageComb C * groupAction V W = groupAction V W * averageComb C) ∧
(C * performanceOperator d n).trace.im = 0 ∧
inversionObjective (averageComb C) = inversionObjective C := by sorry
end QAlgorithms.Papers.Independent.Support50.P24
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , every natural number , every Boolean choice , and every complex matrix indexed by pairs of length- tuples in , assume the feasibility condition specified below, using parallel feasibility when is true and sequential feasibility otherwise. To define these conditions, write , write for appending to , write for prepending to , and, for a matrix indexed by , define
Sequential feasibility at length zero means that the matrix is the identity on the singleton index set ; at length , it means that is positive semidefinite, is sequentially feasible at length , and, for every and ,
where are the first coordinates. Parallel feasibility of means that is positive semidefinite and there exists a positive semidefinite matrix , indexed by , satisfying, for every and every ,
Let be normalized Haar measure on . For , define
Then is integrable, is integrable, and is integrable, each with respect to the displayed Haar measure or product measure; satisfies the same selected feasibility condition as ; for every , both and commute with ; and
The quantification includes , with empty tuples and empty products interpreted as the unique empty tuple and , respectively.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.