Appendix A (A1)–(A3): symmetry reduction coefficients
OpenQAlgorithms.Papers.Independent.Support50.P11.symmetry_reduction_coefficientsLet , , and . On the input–output pairs let sum all products with exactly antisymmetric projectors and symmetric projectors. Let sum products with exactly normalized Bell projectors and complements. The are orthogonal idempotents summing to the identity. For real and ,
where
For any selected NS/PPTp flags, every primal feasible for has a feasible pair with the identical full-transpose Choi objective. This is the lossless symmetry reduction, with the remaining identity on the input system.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P11
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder ENNReal
namespace QAlgorithms.Papers.Independent.Support50.P11
open QAlgorithms.Papers.Independent.Information100.P34 (choi dephasing permutationMatrix)
open QAlgorithms.Papers.Independent.Information100.P21 (pt)
open QAlgorithms.Papers.Independent.Dependency50.P09 (tensorAction)
open QAlgorithms.Papers.Independent.Information100.P76 (swapMatrix)
open QAlgorithms.Papers.Independent.Information100.P69 (replacer)
open QAlgorithms.Papers.Independent.Gap20.P19 (wernerIsometry)
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
/-- PDF pp.13--14, (A1)--(A3): sector orthogonality, exact partial transpose and
partial trace, and lossless averaging to rho=I/d^n and the real wernerSector ansatz.
The printed remaining-system identity is corrected from I_B to I_input. -/
theorem symmetry_reduction_coefficients
(d n K : ℕ) (hd : 2 ≤ d) (hn : 0 < n) (hK : 0 < K)
(alpha : ℝ) (ha0 : 0 ≤ alpha) (ha1 : alpha ≤ 1) (s p : Bool) :
(∀ j : Fin (n + 1), sectorSum d n j * sectorSum d n j = sectorSum d n j) ∧
(∀ i j : Fin (n + 1), i ≠ j → sectorSum d n i * sectorSum d n j = 0) ∧
(∑ j : Fin (n + 1), sectorSum d n j) = 1 ∧
(∀ x : Fin (n + 1) → ℝ,
pt (ansatz d n x) = ∑ i : Fin (n + 1),
((∑ j, coeffM d n i j * x j : ℝ) : ℂ) • bellSectorSum d n i (by omega)) ∧
(∀ j : Fin (n + 1), traceRight (sectorSum d n j) = (coeffG d n j : ℂ) • 1) ∧
(∀ rho L, Primal K s p rho L →
∃ x : Fin (n + 1) → ℝ,
Primal K s p (((d : ℂ)^n)⁻¹ • 1) (ansatz d n x) ∧
primalObjective (piSuperop (fun _ : Fin n => wernerHolevoChannel d alpha)) L =
primalObjective (piSuperop (fun _ : Fin n => wernerHolevoChannel d alpha)) (ansatz d n x)) := by sorry
end QAlgorithms.Papers.Independent.Support50.P11
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all natural numbers with , , and , every real , and either Boolean value of each of , make the following definitions. Let , let , put , , and let , where . For , define
where counts the entries equal to , and . Define
All integer subtractions in these definitions are natural-number subtraction, truncated at zero. Write , and let , where
the tensor map is specified on matrix units by . Then every is idempotent, whenever , , and, for every real vector ,
Moreover, for every pair of complex matrices on and on , suppose is positive semidefinite with trace , , and the following conditional requirements hold: if is true, ; if is true, . There then exists a real vector for which the same requirements hold with replaced by and replaced by , and
Each matrix inequality means positive semidefiniteness of the difference; when a flag is false, its associated conditional requirement imposes no restriction.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.