Independent circuit repetitions with a decoded coefficient pool
ProvedInfoLossLAR.WorstCase.RegevSearch.independent_coefficient_batch_mqptLet be a uniform quantum polynomial-time multi-output circuit family. There is a single such family that batches independent executions on inputs specifying an integer matrix , rational parameter , output count , and numerical budget . Both and are encoded in unary.
Let be the probability that one copy of , run at count one and precision , outputs a word beginning with the encoding of the integer vector . Whenever these probabilities sum to one, the output of has the exact joint law
for every event on the decoded pool. This includes the unique empty pool at . The uniform circuit construction must arrange independent workspaces, form the one-copy inputs, and pack the measured coefficient vectors in the public output format. The result applies to any normalized coefficient readout law.
import Definitions.Def_InfoLossLAR_RegevSketch_DGS set_option autoImplicit false open QAlgorithms.Complexity InfoLossLAR.WorstCase InfoLossLAR.WorstCase.RegevSketch open scoped BigOperators Classical
namespace InfoLossLAR.WorstCase.RegevSearch
theorem independent_coefficient_batch_mqpt (H : MFamily) (hH : IsMQPT H) :
∃ G : MFamily, IsMQPT G ∧
∀ (n : ℕ) (B : Matrix (Fin n) (Fin n) ℤ) (r : ℚ) (count budget : ℕ),
let precision := count * (budget + 1)
let draw (z : Fin n → ℤ) := outputProb H (dgsInput B r 1 precision)
(fun out => encVec encI z <+: out)
HasSum draw 1 → ∀ event : (Fin count → Fin n → ℤ) → Prop,
outputProb G (dgsInput B r count budget) (decodedPoolEvent event) =
∑' pool : Fin count → Fin n → ℤ,
(∏ i, draw (pool i)) * (if event pool then 1 else 0) := by
sorry
end InfoLossLAR.WorstCase.RegevSearch