How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Jacobi–Anger Chebyshev truncation
Statement
With defined in Hamiltonian-simulation polynomial target, for every real and integer , whenever . In the OP4 simulator, and the factorial-tail stopping test therefore certifies truncation error at most ; rounding each coefficient to error at most keeps the combined polynomial error below . For the nontrivial simulation regime , an integer passing OP4's test exists with For , the constant polynomial approximates the target within ; the wrapper algorithm uses the exact identity circuit in that branch.
Facts & Assumptions
Given: Real , the coefficient series and Chebyshev recurrence in Hamiltonian-simulation polynomial target, and rational .
Hamiltonian-simulation polynomial target: , , and .
The complex exponential series converges absolutely for every complex argument: the exponential series converges absolutely at every complex argument.
, , and : for real .
The complex exponential is entire and its complex derivative is itself: the complex exponential is differentiable with derivative equal to itself.
, and the complex exponential extends the real exponential: the complex exponential satisfies for all complex .
Qubitized Hamiltonian simulator: OP4 sets , starts the degree loop at , accepts a factorial-tail bound at most , and rounds coefficients within each.
Small-time-aware qubitized simulator: if , the wrapper returns the exact identity circuit.
Proof
Given: As in Facts & Assumptions.
The Chebyshev recurrence and show by induction that for all . Every is for some real , so .
If , the ratio of consecutive absolute terms in the defining series of is , which tends to zero, so the series converges absolutely; for the series is immediate. For the integral , splitting and integrating the derivative of gives . Iterating yields . Expanding uniformly on , substituting , and using this moment ratio gives The weight is nonnegative and its normalized integral is one; [F4] therefore gives .
Put , , and . If , then . If , put , so . The function is increasing for , since its derivative has numerator ; the first term exceeds and the second is below . Also for (the difference has positive derivative and is positive at ), and , so . Therefore . In all cases . Set ; then , , and , so this is an eligible candidate in the OP4 loop starting rule [F7]. The real parameter is defined in [F1].
For , [F6] writes as the product of the absolutely convergent exponential series for and . Absolute convergence permits grouping terms by the exponent difference ; for each the coefficient of is , and the coefficient of is the same. Pairing these terms and using [F1] gives By [F1], [F3], [F4], and [F6], the defining product is absolutely and uniformly convergent in on bounded intervals, so the regrouping is valid.
Subtracting the degree- partial sum in step 2.1, applying the triangle inequality, and using from step 1.1 gives error at most . With , the ratio of consecutive factorial majorants for is at most . The geometric-series bound from step 1.2 now yields the stated factorial tail.
By [F7], each of the OP4 coefficient errors is at most . Since a nonconstant Chebyshev term has coefficient multiplier , their total uniform contribution is at most ; adding the tail from step 3.1 gives a combined error . The coefficients and multiplier are those of the expansion in [F1].
Let . If , then . Since for and , we have . Thus , because gives ; hence . If , gives , hence , since implies . For , these bounds give , because . For , they give , because . Also , so , and the factorial tail expression is bounded by the estimate of step 3.1. The real is defined in [F1]. so . The factorial-tail test at is consequently at most The last inequality holds because : for , the function is positive (its derivative is as increases to , and its value at is zero), and . Hence ; the numerical comparison follows from , which gives . Since using , the passing degree is . The factorial tail is the estimate of step 3.1 and the OP4 threshold is [F7].
If , the derivative fact [F5] and from [F4] give for every . Thus the wrapper [F8] has the stated small-time error, including .
Depends on
- Hamiltonian-simulation polynomial target
- $\exp(z+w)=\exp z\,\exp w$, and the complex exponential extends the real exponential
- $\exp(x+iy)=e^x(\cos y+i\sin y)$, $|\exp(x+iy)|=e^x$, and $e^{i\pi}+1=0$
- The complex exponential by its power series
- The complex exponential series converges absolutely for every complex argument
- The complex exponential is entire and its complex derivative is itself
- Qubitized Hamiltonian simulator
- Small-time-aware qubitized simulator
Used by
Dependency tree · two levels
46 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe, Quantum singular value transformation and beyond, Lemma 57 and proof (standard reference, not scraped)
- Andrew M. Childs, Lecture Notes on Quantum Algorithms, Chapter 29 §29.4 (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes, Chapter 9 §9.4.1 (standard reference, not scraped)