AFTD Auto-Formalizing Theoretical Domains

full_support_paulis

def

The set of full-support Pauli operators on k qubits, acting non-trivially on every qubit.

Statement

def full_support_paulis (k : ℕ) : Finset (PauliLabel k)
Defined in
scout/2610-04621-exact-clifford-optimality-for-two-sided-locally-randomized.md:368
Verified
30 Oct 2026
Axioms
none listed
Built on 2
  • PauliLabelA binary symplectic Pauli label on k qubits, given as a pair of binary vectors (x, z) in (ZMod 2)^k x (ZMod 2)^k.
  • pauli_sizeThe weight (support size) of a k-qubit Pauli operator: the number of qubits on which the operator is not the identity.
Used by 1
  • clifford_circuit_scoreThe integer score S_k(U) of a k-qubit Clifford circuit circ : List (CliffordGate k), defined as the sum over all p in full_support_paulis…

Read back from the Lean

The definition full_support_paulis takes a natural number $k$ and produces the finite set of all Pauli labels on $k$ qubits (elements of PauliLabel k) whose pauli_size is equal to $k$.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- The finset of full-support Pauli operators on k qubits. -/
def full_support_paulis (k : ℕ) : Finset (PauliLabel k) := Finset.filter (fun p => pauli_size p = k) Finset.univ
See it in the graphDiscuss this resultChallenge it