Theorem 3 — uniform nonadaptive Raz–Tal distinguishing and oracle separation
OpenIQPForrelation832.SingleQuery.Supplement.theorem_3There is one deterministic polynomial-time uniform family of single IQP circuits which, for every integer , makes exactly nonadaptive local joint-oracle queries, one to each of independent input pairs. Under the concrete truncated-and-rounded Raz–Tal product law and the uniform product law, respectively, its expected acceptance satisfies
The circuit descriptions, all query wires and all local oracle labels are fixed before quantum measurements. The accepting outcome set has one polynomial-time membership algorithm; no random selection of IQP circuits is part of this construction. Both dimension parities are included. Moreover, there is a single total Boolean oracle and a language such that
Here PH is the union over all fixed finite numbers of alternations, and the same occurs in both clauses. The paper writes and constant advantage; the proof yields the witness constant , rational threshold and failure bound . The statement has no hardness, moment-gap or oracle-computability hypothesis. This companion theorem retains both the finite distributional construction and the separation it implies.
Differences from the source:
- generalization: m = Theta(n squared) and constant advantage → m(n) = 147456 n squared and both error probabilities at most exp(-2), for every n at least 1; reason: the proof gives epsilon = 1/(24 log(2) n); its gap exceeds 1/(192n) in either parity and the threshold 1/2+1/(384n) gives the displayed tails; this fixed m(n) witnesses Theta(n squared), and 1-exp(-2) > 2/3, exp(-2) < 1/3 give the success probability 2/3 of Definition 8
- reading: uniform classical generation of IQP circuits with efficient accepting-set membership → fixed structural parser, effective finite diagonal gate library, polynomial resource bound, and a polynomial-time outcome decider; reason: Definition 3 names no gate set; the standard uniform reading with a fixed effective finite library is taken, which only narrows IQP^O and so makes the separation stronger; raw total-oracle queries have empty labels and no oracle is supplied to the classical machines
import Definitions.Def_IQPForrelation832_SingleQuery_Supplement_Uniform set_option autoImplicit false
namespace IQPForrelation832.SingleQuery.Supplement
open QAlgorithms QAlgorithms.Complexity
theorem theorem_3 :
(∃ (G : List Gate) (code : Str → UniformCode) (a : Str → Str),
UniformFamily G code a ∧ ∀ n : ℕ, 1 ≤ n →
UsesIndependentBlocks n (repetitionCount n) (code (encNat n)) ∧
productExpectation (structuredWeight n)
(fun z : Fin (repetitionCount n) → SignPair n =>
distinguishingBorn G (code (encNat n)) a z) ≥ 1 - Real.exp (-2) ∧
productExpectation (uniformWeight n)
(fun z : Fin (repetitionCount n) → SignPair n =>
distinguishingBorn G (code (encNat n)) a z) ≤ Real.exp (-2) ∧
2/3 ≤ 1 - Real.exp (-2) ∧ Real.exp (-2) < 1/3) ∧
∃ (O : TotalOracle) (L : Language Bool), L ∈ IQPO O ∧ L ∉ PHO O := by sorry
end IQPForrelation832.SingleQuery.Supplement