The explicit two-adder qutrit Clifford circuit
OpenQAlgorithms.Papers.Independent.Intakenext100.P95.explicit_qutrit_clifford_circuitFor , first add the first wire into the second, then add the resulting second wire into the first. The resulting unitary is
It normalizes the phase-aware two-qutrit Pauli group, hence is a Clifford unitary. For the four-qutrit state defined by the nine terms in Appendix A.2, its precise tensor interpretation is
Thus the input tensor legs are and output legs are , using zero-based leg labels. This links the explicit circuit to the source tensor rather than to an unspecified flattening.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P95
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let , and define complex matrices , indexed by , as follows: exactly when and ; exactly when and ; and exactly when and ; each entry is otherwise. The theorem asserts all three of the following:
and, for every ,
Here , takes the representative in , and equals when for both coordinates, and equals otherwise. The complex amplitude is when and , and is otherwise. All coordinate arithmetic and the sum inside are modulo .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.