Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Quadratic Gaussian conjugation and all special orthogonal rotations

Open
QAlgorithms.Papers.Independent.Intakethird100.P77.gaussian_rotation

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let c1,…,c2nc_1,\ldots,c_{2n}c1​,…,c2n​ be Hermitian operators on the full nnn-qubit Hilbert space with cμcν+cνcμ=2δμνIc_\mu c_\nu+c_\nu c_\mu=2\delta_{\mu\nu}Icμ​cν​+cν​cμ​=2δμν​I. For a real antisymmetric matrix hhh, set H=i∑μ≠νhμνcμcνH=i\sum_{\mu\ne\nu}h_{\mu\nu}c_\mu c_\nuH=i∑μ=ν​hμν​cμ​cν​ and U=eiHU=e^{iH}U=eiH. Then

UcμU†=∑ν(e4h)μνcν,U†cμU=∑ν(e−4h)μνcν.Uc_\mu U^\dagger=\sum_\nu(e^{4h})_{\mu\nu}c_\nu,\qquad U^\dagger c_\mu U=\sum_\nu(e^{-4h})_{\mu\nu}c_\nu.Ucμ​U†=ν∑​(e4h)μν​cν​,U†cμ​U=ν∑​(e−4h)μν​cν​.

Both real coefficient matrices are orthogonal with determinant one, and every matrix in SO(2n)SO(2n)SO(2n) is e4he^{4h}e4h for such an hhh and hence is induced by this conjugation. Both ordered off-diagonal terms are included and scalar Hamiltonian terms are omitted. This is the rotation interface underlying the simulation results.

Source correction. The printed displayed theorem puts e4he^{4h}e4h beside the opposite adjoint action. The statement follows the convention and differential equation in the source proof.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P77
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakethird100.P77

open QAlgorithms

open QAlgorithms.Complexity (Str)

open QAlgorithms.Papers.Independent.Advance50.P19 (Major CARSystem)

open QAlgorithms.Papers.Independent.Information100.P32 (Op)

open scoped BigOperators Matrix ComplexConjugate

attribute [local instance] Classical.propDecidable Classical.decEq

/-- PDF p.9 Theorem 3, corrected using its own proof: exp(4h) describes
U c U†, while exp(-4h) describes U† c U. The literal displayed theorem has the
adjoint sign reversed. Surjectivity is included, including the n=0 case. -/
theorem gaussian_rotation {n : ℕ} (c : CARSystem n) :
    (∀ h : Matrix (Major n) (Major n) ℝ, Skew h →
      IsMajoranaRotation (NormedSpace.exp ((4 : ℝ) • h)) ∧
      IsMajoranaRotation (NormedSpace.exp ((-4 : ℝ) • h)) ∧
      (∀ i, gaussianOperation c.majorana h * c.majorana i * star (gaussianOperation c.majorana h) =
        ∑ j, ((NormedSpace.exp ((4 : ℝ) • h)) i j : ℂ) • c.majorana j) ∧
      (∀ i, star (gaussianOperation c.majorana h) * c.majorana i * gaussianOperation c.majorana h =
        ∑ j, ((NormedSpace.exp ((-4 : ℝ) • h)) i j : ℂ) • c.majorana j)) ∧
    (∀ R : Matrix (Major n) (Major n) ℝ, IsMajoranaRotation R →
      ∃ h : Matrix (Major n) (Major n) ℝ, Skew h ∧
        NormedSpace.exp ((4 : ℝ) • h) = R ∧
        ∀ i, gaussianOperation c.majorana h * c.majorana i * star (gaussianOperation c.majorana h) =
          ∑ j, (R i j : ℂ) • c.majorana j) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P77

end
Source
Matchgates and classical simulation of quantum circuits, arXiv:0804.4050v2, PDF p. 9, Theorem 3: Gaussian conjugation induces every special orthogonal rotation
Read-back

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

For every natural number nnn and every family cic_ici​, 0≤i<2n0\le i<2n0≤i<2n, of Hermitian complex matrices indexed by Qn={0,1}nQ_n=\{0,1\}^nQn​={0,1}n satisfying

cicj+cjci={2I,i=j,0,i≠j,c_i c_j+c_j c_i= \begin{cases} 2I,&i=j,\\ 0,&i\ne j, \end{cases}ci​cj​+cj​ci​={2I,0,​i=j,i=j,​

define Gh=exp⁡(−∑i≠jhijcicj)G_h=\exp(-\sum_{i\ne j}h_{ij}c_i c_j)Gh​=exp(−∑i=j​hij​ci​cj​) for each real 2n×2n2n\times2n2n×2n matrix hhh. The theorem asserts both of the following: for every hhh satisfying hij=−hjih_{ij}=-h_{ji}hij​=−hji​ for all indices, the matrices R+=exp⁡(4h)R_+=\exp(4h)R+​=exp(4h) and R−=exp⁡(−4h)R_-=\exp(-4h)R−​=exp(−4h) each satisfy R±TR±=I2nR_\pm^{\mathsf T}R_\pm=I_{2n}R±T​R±​=I2n​ and det⁡R±=1\det R_\pm=1detR±​=1, and, for every index iii,

GhciGh†=∑j=02n−1(R+)ijcj,Gh†ciGh=∑j=02n−1(R−)ijcj;G_hc_iG_h^\dagger=\sum_{j=0}^{2n-1}(R_+)_{ij}c_j, \qquad G_h^\dagger c_iG_h=\sum_{j=0}^{2n-1}(R_-)_{ij}c_j;Gh​ci​Gh†​=j=0∑2n−1​(R+​)ij​cj​,Gh†​ci​Gh​=j=0∑2n−1​(R−​)ij​cj​;

also, for every real matrix RRR satisfying RTR=I2nR^{\mathsf T}R=I_{2n}RTR=I2n​ and det⁡R=1\det R=1detR=1, there exists a real matrix hhh satisfying hij=−hjih_{ij}=-h_{ji}hij​=−hji​, exp⁡(4h)=R\exp(4h)=Rexp(4h)=R, and

GhciGh†=∑j=02n−1Rijcjfor every i.G_hc_iG_h^\dagger=\sum_{j=0}^{2n-1}R_{ij}c_j \quad\text{for every }i.Gh​ci​Gh†​=j=0∑2n−1​Rij​cj​for every i.

Here †\dagger† denotes conjugate transpose. The existentially quantified hhh is not asserted to be unique. The statement includes n=0n=0n=0, when the conjugation assertions have no indices, Gh=IG_h=IGh​=I, and the real rotation matrices are empty.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me