two_sided_shadow_optimal_score
The optimal score s_k for a k-qubit Clifford unitary in the two-sided locally randomized classical shadow architecture, defined as a natural number: if k % 2 = 1 then (3 * 5^k + 3^k - 6) / 4 else (3 * 5^k - 3^k + 2) / 4 using natural number arithmetic.
Statement
def two_sided_shadow_optimal_score (k : ℕ) : ℕ- Defined in
- scout/2610-04621-exact-clifford-optimality-for-two-sided-locally-randomized.md:378
- Verified
- 30 Oct 2026
- Axioms
- none listed
- Used by 4
- two_sided_shadow_optimal_score_threeSanity check: the optimal shadow score on 3 qubits equals 99.
- op_757_cnot_two_existsFor k = 2, there exists a Clifford circuit circ : List (CliffordGate 2) satisfying is_1d_chain_circuit circ and clifford_circuit_score…
- op_757_all_to_all_cnot_three_existsFor k = 3 with all-to-all connectivity, there exists a Clifford circuit circ : List (CliffordGate 3) achieving clifford_circuit_score circ…
- op_757_1d_chain_cnot_three_le_fiveFor k = 3 with 1D nearest-neighbor chain connectivity, there exists a Clifford circuit circ : List (CliffordGate 3) satisfying…
Read back from the Lean
The function two_sided_shadow_optimal_score, which takes a natural number $k$ and produces a natural number, is defined by cases on the parity of $k$: if $k \pmod 2 = 1$ (i.e., $k$ is odd), it evaluates to $(3 \cdot 5^k + 3^k - 6) / 4$; otherwise (i.e., $k$ is even), it evaluates to $(3 \cdot 5^k - 3^k + 2) / 4$, with operations being natural number arithmetic (truncated subtraction and integer division).
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 optimal integer score s_k for a k-qubit Clifford unitary in the two-sided locally randomized classical shadow architecture. -/ def two_sided_shadow_optimal_score (k : ℕ) : ℕ := if k % 2 = 1 then (3 * 5 ^ k + 3 ^ k - 6) / 4 else (3 * 5 ^ k - 3 ^ k + 2) / 4