Collective qudit logical operator and coefficient transport
OpenQAlgorithms.Papers.Independent.Intakenext100.P65.permCode_logicalXLet , and be integers. Use the explicit shift , so that it shifts a basis label backwards. Let and let project to the extended-binomial excitation span of dimension . For the normalized Fourier repetition codewords and their excitation coefficients ,
Transporting the latter action through or gives the same eigenphase on the one- and two-mode coefficient codes. The printed assertion about the Mth power being a check is not included.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P65
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P65
open MeasureTheory Filter
open QAlgorithms.Papers.Independent.Frontier18.P14 (displacementEntry)
open QAlgorithms.Papers.Independent.Dependency50.P40 (outputFirstChoi)
open scoped ComplexConjugate Matrix Topology
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
/-- PDF p.28 (C7)--(C11): positive Fourier eigenphase and its compression and
one-mode and two-mode transport. The erroneous Mth-power check is separately deferred.
Printed prose reverses C7 and omits one excitation dimension; use the displayed
C7 matrix with C8/C11 and all endpoints of C3/C4, hence dimension (d-1)M+1. -/
theorem permCode_logicalX (d M S : ℕ) (hd : 2 ≤ d) (hM : 0 < M) :
(∀ mu : Fin d, (_root_.QAlgorithms.Papers.Independent.Intakenext100.P65.collectiveShift d M (Nat.lt_of_lt_of_le (Nat.zero_lt_succ 1) hd)).mulVec (_root_.QAlgorithms.Papers.Independent.Intakenext100.P65.permCode d M mu) =
_root_.QAlgorithms.Papers.Independent.Intakenext100.P65.quditFourierFactor d mu.val 1 • _root_.QAlgorithms.Papers.Independent.Intakenext100.P65.permCode d M mu) ∧
(∀ mu : Fin d, (_root_.QAlgorithms.Papers.Independent.Intakenext100.P65.compressedShift d M (Nat.lt_of_lt_of_le (Nat.zero_lt_succ 1) hd)).mulVec (_root_.QAlgorithms.Papers.Independent.Intakenext100.P65.extendedCoefficients d M mu) =
_root_.QAlgorithms.Papers.Independent.Intakenext100.P65.quditFourierFactor d mu.val 1 • _root_.QAlgorithms.Papers.Independent.Intakenext100.P65.extendedCoefficients d M mu) ∧
(∀ mu : Fin d,
_root_.QAlgorithms.Papers.Independent.Intakenext100.P65.embedOne ((d - 1) * M) S ((_root_.QAlgorithms.Papers.Independent.Intakenext100.P65.compressedShift d M (Nat.lt_of_lt_of_le (Nat.zero_lt_succ 1) hd)).mulVec (_root_.QAlgorithms.Papers.Independent.Intakenext100.P65.extendedCoefficients d M mu)) =
_root_.QAlgorithms.Papers.Independent.Intakenext100.P65.quditFourierFactor d mu.val 1 • _root_.QAlgorithms.Papers.Independent.Intakenext100.P65.embedOne ((d - 1) * M) S (_root_.QAlgorithms.Papers.Independent.Intakenext100.P65.extendedCoefficients d M mu) ∧
_root_.QAlgorithms.Papers.Independent.Intakenext100.P65.embedTwo ((d - 1) * M) S ((_root_.QAlgorithms.Papers.Independent.Intakenext100.P65.compressedShift d M (Nat.lt_of_lt_of_le (Nat.zero_lt_succ 1) hd)).mulVec (_root_.QAlgorithms.Papers.Independent.Intakenext100.P65.extendedCoefficients d M mu)) =
_root_.QAlgorithms.Papers.Independent.Intakenext100.P65.quditFourierFactor d mu.val 1 • _root_.QAlgorithms.Papers.Independent.Intakenext100.P65.embedTwo ((d - 1) * M) S (_root_.QAlgorithms.Papers.Independent.Intakenext100.P65.extendedCoefficients d M mu)) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P65
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all natural numbers with and , put , let , and define
Define , , and . For any vector , define the coordinate functions
The statement asserts all four identities, for every ,
The last two are equalities of functions on and , respectively. The spacing parameter is unrestricted and may be zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.