The padded strategy for the seeded low individual degree test #
Stage 4 of the Pauli basis test's analysis (lem:qld-global-setup, lem:qld-global-success)
assembles the padded point and line measurements of lem:qld-padded-points and
lem:qld-padded-lines into a strategy for the seeded test clGame at parameters
(q, 4m, d, 1), and shows that it succeeds with probability 1 - O(δ_combine + δ_Q + md/q).
This file defines the strategy and bounds its conditional failure at each of the seeded test's
question pairs by an agreement defect of the measurements it is built from; the averages over the
verifier's samples, and the value bound, are in PaddedValue.lean.
The model, and why the strategy is a family of POVMs #
The strategy lives in the expanded model M.reg (Anc F m) of stage 2: each player's measurements
are elements of Matrix (Anc F m) (Anc F m) R over the player's algebra R (the player's own
algebra and the expansion's ancilla, register outer). There is no register for the combining
coefficients: it was inert in every padded measurement. The point measurement is the sandwich
M^Z_b M^X_a M^Z_b of the hatted point measurements (POVMIn.sand), coarse-grained along
(a, b) ↦ α a + β b; its line measurements are the padded line measurements padLineMats,
averaged over the raw directions. Both are POVMs --- the point elements are coarse-grainings of Gram
elements (X_a Z_b)⋆ (X_a Z_b), the line elements averages of pasted sandwiches --- and neither is
projective, so the strategy is a family of POVMs, and one Halmos dilation at the end makes it the
projective strategy the soundness theorem takes. The dilated point measurement of
lem:qld-padded-points is not used: every bound of stage 3 is stated for the sandwich itself
(combined_points_pts, padded_lines_consistency).
In a bipartite model #
Stated in a bipartite model (Phase 5 of planning/mipco-track.md). The strategy of each player is
padStrat hm hm4 hS for a projective family S : Question F m → POVMIn (Answer F m d) R (the
design's padStratIn; the cited names padStrat, padPt, padPtPair, padLinePOVM, lineMeas
are the model versions), the conditional failures are those of any bipartite model whose algebras
are the two players' Matrix (Anc F m) (Anc F m) _ (in particular M.reg (Anc F m)), and
polynomial separation holds in any bipartite model. The model forms of the matrix helpers POVM.ofPosSemidef,
POVM.avgOn and the support lemmas of coarse-grainings are POVMIn.ofNonneg, POVMIn.avgOn,
POVMIn.map_congr_of_support, POVMIn.map_op_eq_zero_of_forall_ne and POVMIn.map_const_op
below.
A function of the question #
The seeded test asks for a measurement per question, while padLineMats is indexed by the
data ⟨pt, s, raw⟩ a sample generates the question from. A line question carries the canonical
base point u₀ of the line, the seed, and for a diagonal line the truncated direction v'; the
strategy answers it with the padded line measurement at the data ⟨u₀, s, raw⟩, averaged over
the raw directions that produce the question (rawFiber). Two things make this the right
choice. The decider reads the answer polynomial at the parameter of the sampled point relative to
u₀, and moving the data's point to the sampled point along the line does not change the padded
line measurement (pasteLine_subPair_padShift), so what the decider reads is padLineMats at the
sample's own data, coarse-grained by evaluation at the sample's point --- exactly the quantity
lem:qld-padded-lines controls (lineMeas_map_eval_mats). And the sample distribution averages
uniformly over the raw direction, so by linearity of the Born rule the strategy's failure at a
question is the average of the per-sample quantities.
POVMs in a ⋆-algebra from nonnegative families, uniform averages, and supports #
The model forms of POVM.ofPosSemidef, POVM.avgOn and three facts about coarse-grainings
(MIPRE/Foundations/POVMMix.lean), which the padded strategy needs in a player's algebra.
A POVM from a family of nonnegative elements summing to one, in a star-ordered ring: a nonnegative element is self-adjoint.
Equations
Instances For
An outcome outside the range of the relabelling carries the zero element.
Two relabellings that agree on the support of a POVM relabel it the same way.
The uniform average of POVMs over a finset, defaulting to the deterministic answer a₀
when the finset is empty.
Equations
- MIPRE.POVMIn.avgOn T Q a₀ = if hT : T.Nonempty then MIPRE.POVMIn.mix (MIPRE.unifOn T) ⋯ ⋯ Q else MIPRE.POVMIn.dirac a₀
Instances For
The elements of a uniform average over a nonempty finset.
The padded point measurement #
The sandwich M^Z_b M^X_a M^Z_b of the hatted point measurements at the X and Z blocks of
a padded point, as a POVM in the register's matrices over the player's algebra, with outcomes the
pairs (a, b).
Equations
- MIPRE.QLD.padPtPair hS u = MIPRE.POVMIn.sand ⋯ ⋯
Instances For
The combining coefficients' reading of a pair outcome at a padded point:
(a, b) ↦ α a + β b.
Equations
- MIPRE.QLD.padComb u r = MIPRE.QLD.alph u * r.1 + MIPRE.QLD.bet u * r.2
Instances For
The padded point measurement: the sandwich read through the combining coefficients, the
strategy's answer to a point question as a POVM with outcomes in F.
Equations
- MIPRE.QLD.padPt hS u = MIPRE.POVMIn.map (MIPRE.QLD.padComb u) (MIPRE.QLD.padPtPair hS u)
Instances For
The padded line measurements, as POVMs #
padLineMats, bundled as a POVM in the register's matrices over the player's algebra.
Equations
- MIPRE.QLD.padLinePOVM hm4 ty PX PZ hS P = MIPRE.POVMIn.ofNonneg (MIPRE.QLD.padLineMats hm4 ty PX PZ S P) ⋯ ⋯
Instances For
The presentation of a line type on side W: the diagonal one for dline, the axis-parallel
one otherwise.
Equations
- MIPRE.QLD.presOf hm MIPRE.LIDT.CL.Ty.dline W = MIPRE.QLD.dPres hm W
- MIPRE.QLD.presOf hm ty W = MIPRE.QLD.aPres hm W
Instances For
The line measurement of the padded strategy: the padded line POVM at the data
⟨u₀, s, raw⟩, averaged over the raw directions in T.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The raw directions a sample with seed s can carry so that its diagonal question shows the
truncated direction v'.
Equations
- MIPRE.QLD.rawFiber hm4 s v' = {raw : MIPRE.LIDT.Point F (4 * m) | MIPRE.LIDT.CL.zeroBelow (MIPRE.LIDT.CL.chi hm4 s) raw = v'}
Instances For
The questions of a sample #
The direction of the line of type ty a seed and raw direction describe; 0 for the point
type.
Equations
- MIPRE.QLD.lineDir hm4 MIPRE.LIDT.CL.Ty.point s raw = 0
- MIPRE.QLD.lineDir hm4 MIPRE.LIDT.CL.Ty.aline s raw = Pi.single (MIPRE.LIDT.CL.chi hm4 s) 1
- MIPRE.QLD.lineDir hm4 MIPRE.LIDT.CL.Ty.dline s raw = MIPRE.LIDT.CL.zeroBelow (MIPRE.LIDT.CL.chi hm4 s) raw
Instances For
The raw directions the strategy averages over at the line question of type ty a sample with
seed s and raw direction raw generates: all of them for an axis-parallel line, the fibre of
the truncated direction for a diagonal one.
Equations
- MIPRE.QLD.rawSet hm4 MIPRE.LIDT.CL.Ty.dline s raw = MIPRE.QLD.rawFiber hm4 s (MIPRE.LIDT.CL.zeroBelow (MIPRE.LIDT.CL.chi hm4 s) raw)
- MIPRE.QLD.rawSet hm4 ty s raw = Finset.univ
Instances For
Every raw direction the strategy averages over describes the sample's line.
The line question of type ty the sample (u, s, raw) generates, as the seeded test
computes it.
Equations
- MIPRE.QLD.lineQ hm4 ty u s raw = MIPRE.LIDT.CL.Sample.question hm4 { tyA := ty, tyB := ty, u := u, s := s, v := raw } ty
Instances For
The parameter of the sample's point on the line it generates.
Equations
- MIPRE.QLD.lineTau hm4 ty u s raw = MIPRE.LIDT.CL.lineParam (MIPRE.LIDT.CL.rep (MIPRE.QLD.lineDir hm4 ty s raw) u) (MIPRE.QLD.lineDir hm4 ty s raw) u
Instances For
The strategy's line data, moved to the sample's point along the line, is the sample's own data, for every raw direction the strategy averages over.
The strategy #
The answer a padded line outcome is read as, at an axis-parallel line question: the polynomial
resized to degree d. On the support of a legally supported strategy this loses nothing
(padLineMats_aline_eq_zero_of_not_degLE).
Equations
- MIPRE.QLD.alineAns f = MIPRE.LIDT.CL.Answer.apolys fun (x : Fin 1) => MIPRE.QLD.padLine d f
Instances For
The answer a padded line outcome is read as, at a diagonal line question: the polynomial
resized to degree 4 m d, which loses nothing since m d + 1 ≤ 4 m d.
Equations
- MIPRE.QLD.dlineAns f = MIPRE.LIDT.CL.Answer.dpolys fun (x : Fin 1) => MIPRE.QLD.padLine (4 * m * d) f
Instances For
The answer map of a line type.
Equations
Instances For
The value a line answer takes at the parameter t; a point answer reads as 0.
Equations
- MIPRE.QLD.rdEval t (MIPRE.LIDT.CL.Answer.apolys p) = (p 0).eval t
- MIPRE.QLD.rdEval t (MIPRE.LIDT.CL.Answer.dpolys p) = (p 0).eval t
- MIPRE.QLD.rdEval t x✝ = 0
Instances For
The padded strategy of one player, as a family of POVMs in the register's matrices over
the player's algebra, indexed by the seeded test's questions at (q, 4m, d, 1) (the design's
padStratIn).
Equations
- One or more equations did not get rendered due to their size.
- MIPRE.QLD.padStrat hm hm4 hS (MIPRE.LIDT.CL.Question.point u) = MIPRE.POVMIn.map (fun (a : F) => MIPRE.LIDT.CL.Answer.values fun (x : Fin 1) => a) (MIPRE.QLD.padPt hS u)
Instances For
The support of the strategy's answers #
On an axis-parallel line, the strategy's line measurement has no element off DegLE _ d.
Reading the strategy's line answer at a parameter is reading the line measurement there:
the resizing in lineAns is invisible on the support.
The strategy's point answer, read back as a field element, is the padded point measurement.
The line measurement read at the sampled point #
sum_filter_padLineMats reads the padded line measurement at the parameter of a point of the
padded line as the pasted line measurement, at the data's own point, coarse-grained by the
combining map at the shifted point. The strategy's line data carries the canonical base point of
the line, while lem:qld-padded-lines is stated at the sample's point; the two are reconciled by
the invariance of the pasted line measurement under moving the padded point along the padded
line, which holds because each block of the padded point either moves along its own subline or
does not move at all (xBlk_dir_sub, zBlk_dir_sub).
The X line measurement of the pair of sublines is unchanged by the padded shift.
The Z line measurement of the pair of sublines is unchanged by the padded shift.
The pasted line measurement is unchanged by moving the padded point along the padded line.
The padded line measurement read at the parameter of a point of the padded line is the average over the fresh randomness of the pasted line measurement at that point, coarse-grained by the combining map there.
The strategy's line measurement, read at the parameter of the sample's point, is the
average over the raw directions and the fresh randomness of the pasted line measurement at the
sample's own data, coarse-grained by the combining map at the sample's point. This is the
quantity lem:qld-padded-lines controls.
The conditional failures of the strategy, question pair by question pair #
A line answer read at the parameter of the sampled point, against the point answer there: the decider accepts.
The same with the players exchanged.
The first player's line against the second player's point: the conditional failure is at most the disagreement of the first player's line measurement read at the sample's point with the second player's padded point measurement.
The first player's point against the second player's line.
Identical points: the conditional failure is at most the disagreement of the two padded point measurements.
Identical lines: the conditional failure is at most the disagreement of the two line measurements, outcome polynomial by outcome polynomial.
The two cross type pairs are always accepted: the strategy answers in the right format, and the decider checks nothing else.
Polynomial separation #
Two distinct line polynomials of degree at most n agree at at most n parameters
(card_agree_linePoly_le), so the disagreement of two polynomial-valued measurements is at most
their disagreement when both are read at a uniformly random parameter, plus n / q. This is the
paper's argument for the identical-line subtest.
Polynomial separation, in any bipartite model.