Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Collective qudit logical operator and coefficient transport

Open
QAlgorithms.Papers.Independent.Intakenext100.P65.permCode_logicalX

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let d≥2d\ge2d≥2, M≥1M\ge1M≥1 and S≥0S\ge0S≥0 be integers. Use the explicit shift X=∑u=0d−1∣u⟩⟨u+1(modd)∣X=\sum_{ u=0}^{d-1}| u\rangle\langle u+1\pmod d|X=∑u=0d−1​∣u⟩⟨u+1(modd)∣, so that it shifts a basis label backwards. Let Xcol=M−1∑kXkX_{\rm col}=M^{-1}\sum_kX_kXcol​=M−1∑k​Xk​ and let PPP project to the extended-binomial excitation span of dimension (d−1)M+1(d-1)M+1(d−1)M+1. For the normalized Fourier repetition codewords and their excitation coefficients vμv_\muvμ​,

Xcol∣μperm′⟩=e2πiμ/d∣μperm′⟩,(PXcolP)vμ=e2πiμ/dvμ.X_{\rm col}|\mu_{\rm perm'}\rangle=e^{2\pi i\mu/d}|\mu_{\rm perm'}\rangle,\qquad (PX_{\rm col}P)v_\mu=e^{2\pi i\mu/d}v_\mu.Xcol​∣μperm′​⟩=e2πiμ/d∣μperm′​⟩,(PXcol​P)vμ​=e2πiμ/dvμ​.

Transporting the latter action through ∣m⟩↦∣(S+1)m⟩|m\rangle\mapsto|(S+1)m\rangle∣m⟩↦∣(S+1)m⟩ or ∣m⟩↦∣(S+1)((d−1)M−m),(S+1)m⟩|m\rangle\mapsto|(S+1)((d-1)M-m),(S+1)m\rangle∣m⟩↦∣(S+1)((d−1)M−m),(S+1)m⟩ 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.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P65
Formal statement
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
Source
Performance and structure of single-mode bosonic codes, arXiv:1708.05010v3, PDF p. 28, Appendix C1 (C7)–(C11): collective logical operator and transport
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For all natural numbers d,M,Sd,M,Sd,M,S with d≥2d\ge2d≥2 and M>0M>0M>0, put N=(d−1)MN=(d-1)MN=(d−1)M, let cr=#{x∈{0,…,d−1}M:∑ixi=r}c_r=\#\{x\in\{0,\ldots,d-1\}^{M}:\sum_i x_i=r\}cr​=#{x∈{0,…,d−1}M:∑i​xi​=r}, and define

Vx,r=1{∑ixi=r}cr,vμ(r)=e2πiμr/dcrdM,Pμ(x)=∑r=0Nvμ(r)Vx,r.V_{x,r}=\frac{\mathbf1\{\sum_i x_i=r\}}{\sqrt{c_r}}, \qquad v_\mu(r)=e^{2\pi\mathrm{i}\mu r/d}\frac{\sqrt{c_r}}{\sqrt{d^M}}, \qquad P_\mu(x)=\sum_{r=0}^{N}v_\mu(r)V_{x,r}.Vx,r​=cr​​1{∑i​xi​=r}​,vμ​(r)=e2πiμr/ddM​cr​​​,Pμ​(x)=r=0∑N​vμ​(r)Vx,r​.

Define Tx,y=M−1∑k=0M−11{y=x with coordinate k increased modulo d}T_{x,y}=M^{-1}\sum_{k=0}^{M-1}\mathbf1\{y=x\text{ with coordinate }k\text{ increased modulo }d\}Tx,y​=M−1∑k=0M−1​1{y=x with coordinate k increased modulo d}, C=V†TVC=V^\dagger TVC=V†TV, and λμ=e2πiμ/d\lambda_\mu=e^{2\pi\mathrm{i}\mu/d}λμ​=e2πiμ/d. For any vector v:{0,…,N}→Cv:\{0,\ldots,N\}\to\mathbb Cv:{0,…,N}→C, define the coordinate functions

E1(v)(n)=∑r=0N1{n=(S+1)r}v(r),E2(v)(n1,n2)=∑r=0N1{(n1,n2)=((S+1)(N−r),(S+1)r)}v(r).E_1(v)(n)=\sum_{r=0}^{N}\mathbf1\{n=(S+1)r\}v(r), \qquad E_2(v)(n_1,n_2)= \sum_{r=0}^{N} \mathbf1\{(n_1,n_2)=((S+1)(N-r),(S+1)r)\}v(r).E1​(v)(n)=r=0∑N​1{n=(S+1)r}v(r),E2​(v)(n1​,n2​)=r=0∑N​1{(n1​,n2​)=((S+1)(N−r),(S+1)r)}v(r).

The statement asserts all four identities, for every μ∈{0,…,d−1}\mu\in\{0,\ldots,d-1\}μ∈{0,…,d−1},

TPμ=λμPμ,Cvμ=λμvμ,E1(Cvμ)=λμE1(vμ),E2(Cvμ)=λμE2(vμ).TP_\mu=\lambda_\mu P_\mu,\qquad Cv_\mu=\lambda_\mu v_\mu,\qquad E_1(Cv_\mu)=\lambda_\mu E_1(v_\mu),\qquad E_2(Cv_\mu)=\lambda_\mu E_2(v_\mu).TPμ​=λμ​Pμ​,Cvμ​=λμ​vμ​,E1​(Cvμ​)=λμ​E1​(vμ​),E2​(Cvμ​)=λμ​E2​(vμ​).

The last two are equalities of functions on N\mathbb NN and N2\mathbb N^2N2, respectively. The spacing parameter SSS is unrestricted and may be zero.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me