OctoInformBeta

OpenAI preprint, September 2026 · Section 3. A polynomial approximation with controlled coefficients

Section 3: Weighted coefficient cost: Monomial coefficients weighted at the scale of the total qubit count

The cost of a polynomial expansion.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

For a count on NN total qubits, the weighted coefficient cost measures the expansion cost of applying a polynomial to that count.

The Definition

Definition 1. Let p∈ℝ[X]p\in\mathbb{R}[X] be a real polynomial with coefficients ckc_k, only finitely many of which are nonzero, and let R∈ℝR\in\mathbb{R}. The weighted coefficient cost WR(p)W_R(p) of a real polynomial p∈ℝ[X]p\in\mathbb{R}[X] at a real scale RR is the real number defined by (1); at the qubit scale R=NR=N, it is denoted WN(p)W_N(p). WR(p)=∑k≥0|ck|Rk.W_R(p)=\sum_{k\geq 0}|c_k|\,R^k.(1)✦

What Is Checked

The weighted coefficient cost is defined for every real polynomial and every real scale.