Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Explicit sufficient reduced-process sample counts

Open
QAlgorithms.Papers.Independent.Intakethird100.P66.simultaneousReducedExplicit

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

prove2quantum

Let n≥1n\ge1n≥1, 0≤k≤n0\le k\le n0≤k≤n and 0<ϵ,δ<10<\epsilon,\delta<10<ϵ,δ<1. Let ρ=2−nΛE\rho=2^{-n}\Lambda_{\mathcal E}ρ=2−nΛE​ be the trace-one reference-first Choi state of any CPTP channel. For a kkk-element physical subsystem SSS, let ρS\rho_SρS​ retain both copies of SSS. Set LF=log⁡(2(8n)2k/δ)L_F=\log(2(8n)^{2k}/\delta)LF​=log(2(8n)2k/δ), L1=log⁡((24n)2k/δ)L_1=\log((24n)^{2k}/\delta)L1​=log((24n)2k/δ), and

VU=max⁡S,P∥P~S−Tr⁡(P~S)4nI∥shadow,U2,Bk=max⁡P∥P∥∞2=1.V_{\mathcal U}=\max_{S,P}\left\|\widetilde P_S-\frac{\operatorname{Tr}(\widetilde P_S)}{4^n}I\right\|_{\mathrm{shadow},\mathcal U}^2, \qquad B_k=\max_P\|P\|_\infty^2=1.VU​=S,Pmax​​PS​−4nTr(PS​)​I​shadow,U2​,Bk​=Pmax​∥P∥∞2​=1.

Here PPP ranges over the 16k16^k16k phase-positive 2k2k2k-qubit tensor Paulis and P~S\widetilde P_SPS​ extends PPP by the identity to all 2n2n2n wires. For a fixed informationally complete measurement primitive U\mathcal UU, the following sufficient total counts are rounded upward:

generic primitive, Frobenius:⌈68 4kϵ−2LFVU⌉,global Clifford, Frobenius:⌈204 4n+kϵ−2LF⌉,Pauli-6, Frobenius:⌈68 36kϵ−2LFBk⌉,Pauli-6, trace:⌈83 144kϵ−2L1⌉.\begin{array}{ll} \text{generic primitive, Frobenius:}&\left\lceil68\,4^k\epsilon^{-2}L_FV_{\mathcal U}\right\rceil,\\ \text{global Clifford, Frobenius:}&\left\lceil204\,4^{n+k}\epsilon^{-2}L_F\right\rceil,\\ \text{Pauli-6, Frobenius:}&\left\lceil68\,36^k\epsilon^{-2}L_FB_k\right\rceil,\\ \text{Pauli-6, trace:}&\left\lceil\frac83\,144^k\epsilon^{-2}L_1\right\rceil. \end{array}generic primitive, Frobenius:global Clifford, Frobenius:Pauli-6, Frobenius:Pauli-6, trace:​⌈684kϵ−2LF​VU​⌉,⌈2044n+kϵ−2LF​⌉,⌈6836kϵ−2LF​Bk​⌉,⌈38​144kϵ−2L1​⌉.​

For each clause, there exists an estimator independent of the channel, taking exactly the indicated number of independent fresh-shot records, for which

Pr⁡[∀S, ∥ρ^S−ρS∥≤ϵ]≥1−δ,\Pr[\forall S,\ \|\widehat\rho_S-\rho_S\|\le\epsilon]\ge1-\delta,Pr[∀S, ∥ρ​S​−ρS​∥≤ϵ]≥1−δ,

using that clause's norm. The trace norm has no factor 1/21/21/2. At k=0k=0k=0 return scalar 111 without samples. The reduced channel has a maximally mixed complementary input; full tomography is k=nk=nk=n.

These explicit sufficient counts refine II.1. They are counts of all observations, not lengths of individual median-of-means batches. For the general Borel measurement primitive, the estimator is measurable, so the simultaneous success event is measurable.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P66
Formal statement
noncomputable section

open MeasureTheory QAlgorithms ClassicalShadows

open scoped Matrix ComplexConjugate ENNReal

namespace QAlgorithms.Papers.Independent.Intakethird100.P66

attribute [local instance] Classical.propDecidable Classical.typeDecidableEq

/-- Theorem A.3(i),(ii), PDF p.14, A5-A9. Ambient Pauli embeddings use 2n
wires and dimension 4^n; identity coefficients are exact. The estimator-line
O^(k) is corrected to O^(2k). Real sufficient prefactors are rounded upward
as total shots, not batch lengths. -/
theorem simultaneousReducedExplicit [∀ m : ℕ, Fintype (Clifford.ProjectiveGroup m)]
    (n k : ℕ) (hn : 0 < n) (hk : k ≤ n) (eps delta : ℝ)
    (heps : 0 < eps) (hepsOne : eps < 1) (hdelta : 0 < delta) (hdeltaOne : delta < 1) :
    (∀ P : MeasurementPrimitive (n + n), PrimitiveReducedRecovers P k
      (sampleCount k (68 * (4 : ℝ) ^ k / eps ^ 2 * reducedLog n k delta *
        reducedVariance P k)) eps delta) ∧
    ReducedRecovers (globalFrame (n + n)) k
      (sampleCount k (204 * (4 : ℝ) ^ (n + k) / eps ^ 2 * reducedLog n k delta))
      .frobenius eps delta ∧
    ReducedRecovers (pauliFrame (n + n)) k
      (sampleCount k (68 * (36 : ℝ) ^ k / eps ^ 2 * reducedLog n k delta *
        pauliNormEnvelope k)) .frobenius eps delta ∧
    ReducedRecovers (pauliFrame (n + n)) k
      (sampleCount k ((8 / 3 : ℝ) * (144 : ℝ) ^ k / eps ^ 2 * traceSampleLog n k delta))
      .trace eps delta := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P66

end
Source
Classical Shadows for Quantum Process Tomography on Near-term Quantum Computers, arXiv:2110.02965v3, PDF p. 14, Theorem A.3(i),(ii)
Read-back

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

Assume that for every m∈Nm\in\mathbb Nm∈N the quotient of the mmm-qubit Pauli normalizer by equality of conjugation maps has a supplied finite enumeration, where the Pauli subgroup is generated by tensor products of Pauli matrices with phases 1,i,−1,−i1,i,-1,-i1,i,−1,−i. For every n,k∈Nn,k\in\mathbb Nn,k∈N satisfying n>0n>0n>0 and k≤nk\le nk≤n, and every real ε,δ\varepsilon,\deltaε,δ satisfying 0<ε<10<\varepsilon<10<ε<1 and 0<δ<10<\delta<10<δ<1, four simultaneous recovery assertions hold with the explicit sample counts below. For their meaning, a channel is any map E(X)=∑jKjXKj†\mathcal E(X)=\sum_jK_jXK_j^\daggerE(X)=∑j​Kj​XKj†​ with finitely many Kraus matrices and ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I, its normalized Choi matrix is

(CE)(a,b),(a′,b′)=2−n[E(∣a⟩⟨a′∣)]b,b′,(C_{\mathcal E})_{(a,b),(a',b')}= 2^{-n}\bigl[\mathcal E(|a\rangle\langle a'|)\bigr]_{b,b'},(CE​)(a,b),(a′,b′)​=2−n[E(∣a⟩⟨a′∣)]b,b′​,

and for each injection w:{0,…,k−1}↪{0,…,n−1}w:\{0,\ldots,k-1\}\hookrightarrow\{0,\ldots,n-1\}w:{0,…,k−1}↪{0,…,n−1} its reduced matrix is

(CE,w)(u,v),(u′,v′)=∑a,b∈{0,1}na∘w=b∘w=0(CE)(a[w←u], b[w←v]),(a[w←u′], b[w←v′]),(C_{\mathcal E,w})_{(u,v),(u',v')}= \sum_{\substack{a,b\in\{0,1\}^n\\a\circ w=b\circ w=0}} (C_{\mathcal E})_{(a[w\leftarrow u],\,b[w\leftarrow v]), (a[w\leftarrow u'],\,b[w\leftarrow v'])},(CE,w​)(u,v),(u′,v′)​=a,b∈{0,1}na∘w=b∘w=0​∑​(CE​)(a[w←u],b[w←v]),(a[w←u′],b[w←v′])​,

where the bracket notation means overwriting the indicated coordinates. Each recovery assertion means that there exists an estimator from the specified number of records and an injection www to a complex matrix on 2k2k2k qubits, such that for every channel the event ∀w, ∥C^(r,w)−CE,w∥≤ε\forall w,\ \|\widehat C(r,w)-C_{\mathcal E,w}\|\le\varepsilon∀w, ∥C(r,w)−CE,w​∥≤ε has measure or finite record weight at least 1−δ1-\delta1−δ; the estimator need not satisfy any stated measurability, positivity, or normalization condition. Set

ℓ=log⁡2(8n)2kδ,ℓ1=log⁡(24n)2kδ,sk(B)={0,k=0,max⁡{0,⌈B⌉},k≠0.\ell=\log\frac{2(8n)^{2k}}{\delta},\qquad \ell_1=\log\frac{(24n)^{2k}}{\delta},\qquad s_k(B)= \begin{cases}0,&k=0,\\ \max\{0,\lceil B\rceil\},&k\ne0.\end{cases}ℓ=logδ2(8n)2k​,ℓ1​=logδ(24n)2k​,sk​(B)={0,max{0,⌈B⌉},​k=0,k=0.​

The first assertion holds for every measurement primitive PPP on 2n2n2n qubits, in Frobenius norm, with

NP=sk ⁣(68 4kε2 ℓ RP(k)).N_P=s_k\!\left(\frac{68\,4^k}{\varepsilon^2}\,\ell\,R_P(k)\right).NP​=sk​(ε2684k​ℓRP​(k)).

Such a primitive consists of a probability measure μP\mu_PμP​ on unitaries with injective linear measurement channel

MP(X)=∫∑bTr⁡(U†∣b⟩⟨b∣U X) U†∣b⟩⟨b∣U dμP(U).\mathcal M_P(X)= \int\sum_b\operatorname{Tr}(U^\dagger|b\rangle\langle b|U\,X) \,U^\dagger|b\rangle\langle b|U\,d\mu_P(U).MP​(X)=∫b∑​Tr(U†∣b⟩⟨b∣UX)U†∣b⟩⟨b∣UdμP​(U).

The record measure is the product of the single-record measures with density max⁡{Re⁡(UCEU†)bb,0}\max\{\operatorname{Re}(UC_{\mathcal E}U^\dagger)_{bb},0\}max{Re(UCE​U†)bb​,0} against μP\mu_PμP​, summed over bbb. To define RP(k)R_P(k)RP​(k), for every www as above and every 2k2k2k-qubit Pauli tensor AAA, extend AAA to an observable AwA_wAw​ on the input and output nnn-qubit registers by using www in both registers and the identity on the remaining wires: its matrix entry is AAA at the restricted pair of strings when both registers agree outside the image of www, and zero otherwise. Then RP(k)R_P(k)RP​(k) is the maximum of VP(Aw)V_P(A_w)VP​(Aw​) over all such w,Aw,Aw,A, where, for Hermitian OOO, with O∘=O−2−2nTr⁡(O)IO^\circ=O-2^{-2n}\operatorname{Tr}(O)IO∘=O−2−2nTr(O)I,

VP(O)=[sup⁡τ⪰0Tr⁡τ=1∫∑bRe⁡(UτU†)bb(Re⁡[UMP−1(O∘)U†]bb)2 dμP(U)]2,V_P(O)= \left[ \sqrt{\sup_{\substack{\tau\succeq0\\\operatorname{Tr}\tau=1}} \int\sum_b \operatorname{Re}(U\tau U^\dagger)_{bb} \left(\operatorname{Re}[U\mathcal M_P^{-1}(O^\circ)U^\dagger]_{bb}\right)^2 \,d\mu_P(U)} \right]^2,VP​(O)=​τ⪰0Trτ=1​sup​∫b∑​Re(UτU†)bb​(Re[UMP−1​(O∘)U†]bb​)2dμP​(U)​​2,

and VP(O)=0V_P(O)=0VP​(O)=0 for non-Hermitian OOO; a maximum over an empty finite index type is defined as zero. The remaining three assertions use finite frames: a frame with matrices Qa,bQ_{a,b}Qa,b​ assigns a record rrr the weight

∏j<NRe⁡Tr⁡(QrjCE)∣Basis⁡∣,\prod_{j<N}\frac{\operatorname{Re}\operatorname{Tr}(Q_{r_j}C_{\mathcal E})} {|\operatorname{Basis}|},j<N∏​∣Basis∣ReTr(Qrj​​CE​)​,

and assigns an event the sum of these weights. The global frame uses quotient classes of normalizer unitaries as basis choices and Qa,b=Ua†∣b⟩⟨b∣UaQ_{a,b}=U_a^\dagger|b\rangle\langle b|U_aQa,b​=Ua†​∣b⟩⟨b∣Ua​ for chosen representatives; it recovers in Frobenius norm with

Nglobal,F=sk ⁣(204 4n+kε2ℓ).N_{\mathrm{global,F}}= s_k\!\left(\frac{204\,4^{n+k}}{\varepsilon^2}\ell\right).Nglobal,F​=sk​(ε22044n+k​ℓ).

The Pauli frame uses choices a=(Aj,sj)j<2na=(A_j,s_j)_{j<2n}a=(Aj​,sj​)j<2n​, where Aj∈{X,Y,Z}A_j\in\{X,Y,Z\}Aj​∈{X,Y,Z}, sj∈{−1,1}s_j\in\{-1,1\}sj​∈{−1,1}, and Qa,b=⨂j(I+sj(−1)bjAj)/2Q_{a,b}=\bigotimes_j(I+s_j(-1)^{b_j}A_j)/2Qa,b​=⨂j​(I+sj​(−1)bj​Aj​)/2; it recovers in Frobenius norm with

NPauli,F=sk ⁣(68 36kε2ℓ H(k)),H(k)=max⁡A a 2k-qubit Pauli tensor∥A∥op2,N_{\mathrm{Pauli,F}}= s_k\!\left(\frac{68\,36^k}{\varepsilon^2}\ell\,H(k)\right), \qquad H(k)=\max_{A\text{ a }2k\text{-qubit Pauli tensor}}\|A\|_{\mathrm{op}}^2,NPauli,F​=sk​(ε26836k​ℓH(k)),H(k)=A a 2k-qubit Pauli tensormax​∥A∥op2​,

and in trace norm with

NPauli,1=sk ⁣((8/3) 144kε2ℓ1).N_{\mathrm{Pauli,1}}= s_k\!\left(\frac{(8/3)\,144^k}{\varepsilon^2}\ell_1\right).NPauli,1​=sk​(ε2(8/3)144k​ℓ1​).

Here the trace norm is Re⁡Tr⁡X†X\operatorname{Re}\operatorname{Tr}\sqrt{X^\dagger X}ReTrX†X​. The four assertions can have different estimators. The case k=0k=0k=0 is included, and all four sample counts are then exactly zero.

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