Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The explicit two-adder qutrit Clifford circuit

Open
QAlgorithms.Papers.Independent.Intakenext100.P95.explicit_qutrit_clifford_circuit

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

prove2quantum

For x1,x2∈Z3x_1,x_2\in\mathbb Z_3x1​,x2​∈Z3​, first add the first wire into the second, then add the resulting second wire into the first. The resulting unitary is

U∣x1,x2⟩=∣2x1+x2,x1+x2⟩.U\lvert x_1,x_2\rangle=\lvert2x_1+x_2,x_1+x_2\rangle.U∣x1​,x2​⟩=∣2x1​+x2​,x1​+x2​⟩.

It normalizes the phase-aware two-qutrit Pauli group, hence is a Clifford unitary. For the four-qutrit state Ψ\PsiΨ defined by the nine terms in Appendix A.2, its precise tensor interpretation is

Uy,x=3Ψ(x2,y2,y1,x1).U_{y,x}=3\Psi(x_2,y_2,y_1,x_1).Uy,x​=3Ψ(x2​,y2​,y1​,x1​).

Thus the input tensor legs are (3,0)(3,0)(3,0) and output legs are (2,1)(2,1)(2,1), using zero-based leg labels. This links the explicit circuit to the source tensor rather than to an unspecified flattening.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P95
Formal statement
namespace QAlgorithms.Papers.Independent.Intakenext100.P95

open scoped Matrix ComplexConjugate

noncomputable section

local instance (p : Prop) : Decidable p := Classical.propDecidable p

/-- PDF p.46, (A.11): the two opposite adders implement the explicit
Clifford flattening. Inputs are tensor legs (3,0); outputs are (2,1),
so the equality is linked to the nine coefficients on PDF p.45. -/
theorem explicit_qutrit_clifford_circuit :
    qutritCircuit = addUp * addDown ∧ IsQutritClifford qutritCircuit ∧
    (∀ x y : Fin 2 → Trit,
      qutritCircuit y x = 3 * fourQutritState ![x 1, y 1, y 0, x 0]) := by sorry

end

end QAlgorithms.Papers.Independent.Intakenext100.P95
Source
Holographic quantum error-correcting codes: Toy models for the bulk/boundary correspondence, arXiv:1503.06237v2, PDF p. 46, Appendix A.2: explicit qutrit Clifford circuit (A.11)
Read-back

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

Let F3=Z/3Z\mathbb F_3=\mathbb Z/3\mathbb ZF3​=Z/3Z, and define complex matrices C,D,VC,D,VC,D,V, indexed by x,y∈F32x,y\in\mathbb F_3^2x,y∈F32​, as follows: Cy,x=1C_{y,x}=1Cy,x​=1 exactly when y0=2x0+x1y_0=2x_0+x_1y0​=2x0​+x1​ and y1=x0+x1y_1=x_0+x_1y1​=x0​+x1​; Dy,x=1D_{y,x}=1Dy,x​=1 exactly when y0=x0y_0=x_0y0​=x0​ and y1=x0+x1y_1=x_0+x_1y1​=x0​+x1​; and Vy,x=1V_{y,x}=1Vy,x​=1 exactly when y0=x0+x1y_0=x_0+x_1y0​=x0​+x1​ and y1=x1y_1=x_1y1​=x1​; each entry is 000 otherwise. The theorem asserts all three of the following:

C=VD,C†C=I,∀a,b∈F32 ∃a′,b′∈F32 ∃c∈F3, CW(a,b)C†=ωval⁡(c)W(a′,b′),C=VD,\qquad C^\dagger C=I,\qquad \forall a,b\in\mathbb F_3^2\ \exists a',b'\in\mathbb F_3^2\ \exists c\in\mathbb F_3,\ CW(a,b)C^\dagger=\omega^{\operatorname{val}(c)}W(a',b'),C=VD,C†C=I,∀a,b∈F32​ ∃a′,b′∈F32​ ∃c∈F3​, CW(a,b)C†=ωval(c)W(a′,b′),

and, for every x,y∈F32x,y\in\mathbb F_3^2x,y∈F32​,

Cy,x=3 Ψ(x1,y1,y0,x0).C_{y,x}=3\,\Psi(x_1,y_1,y_0,x_0).Cy,x​=3Ψ(x1​,y1​,y0​,x0​).

Here ω=exp⁡(2πi/3)\omega=\exp(2\pi i/3)ω=exp(2πi/3), val⁡\operatorname{val}val takes the representative in {0,1,2}\{0,1,2\}{0,1,2}, and W(a,b)v,uW(a,b)_{v,u}W(a,b)v,u​ equals ωval⁡(∑j=01bjuj)\omega^{\operatorname{val}(\sum_{j=0}^{1}b_ju_j)}ωval(∑j=01​bj​uj​) when vj=uj−ajv_j=u_j-a_jvj​=uj​−aj​ for both coordinates, and equals 000 otherwise. The complex amplitude Ψ(z0,z1,z2,z3)\Psi(z_0,z_1,z_2,z_3)Ψ(z0​,z1​,z2​,z3​) is 1/31/31/3 when z1=z0+z3z_1=z_0+z_3z1​=z0​+z3​ and z2=z0+2z3z_2=z_0+2z_3z2​=z0​+2z3​, and is 000 otherwise. All coordinate arithmetic and the sum inside val⁡\operatorname{val}val are modulo 333.

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