Exact QPT dispatch controlled by a polynomial-time classical predicate
ProvedInfoLossLAR.WorstCase.RegevSketch.qpt_bool_dispatchlar-regev-bridgelearning-with-errorsquantum-computing
Let and be uniform QPT one-bit output circuit families and let be a total polynomial-time computable string function. There is a uniform QPT family such that, on every input word , its acceptance probability equals that of if the first bit of is true, and equals that of otherwise (including when is empty). The equality is exact and is with respect to the platform's Born-rule acceptance probability.
Preamble
import Definitions.Def_InfoLossLAR_RegevSketch_DGS set_option autoImplicit false open QAlgorithms.Complexity InfoLossLAR.WorstCase
Formal statement
namespace InfoLossLAR.WorstCase.RegevSketch
theorem qpt_bool_dispatch (E A : Family) (hE : IsQPT E) (hA : IsQPT A)
(f : Str → Str) (hf : PolyTimeComputable f) :
∃ P : Family, IsQPT P ∧ ∀ word : Str,
acceptProb P word = if (f word)[0]? = some true then acceptProb E word else acceptProb A word := by sorry
end InfoLossLAR.WorstCase.RegevSketchSource
Standard reversible classical control and uniform quantum circuit composition, formulated using the exact platform predicates IsQPT, PolyTimeComputable, and acceptProb in Definitions.Def_InfoLossLAR_WorstCase_QPT; this is a model-specific composition obligation, not a separate named theorem in Regev.