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.
Certified finite smooth Fourier approximation and LCU normalization
Statement
Let , , and with . Put , , and choose Use the exact finite arcsine convolutions and binomial expansion in OP8 SmoothFourier. The exact truncated coefficients have , , and give an approximation to within throughout . Rounding all complex coefficients with total absolute error at most gives error below and coefficient norm at most . There are distinct signed frequencies. In an LCU SELECT their largest evolution time is .
Facts & Assumptions
Given: The absolutely convergent Taylor coefficient budget, positive parameters, exact finite convolution rules, coefficient precision, and supplied evolution/LCU circuits.
Principal inverse sine inverts sine on its principal interval and has derivative (Principal inverse sine and inverse cosine, For , and ).
The sine and cosine derivatives give the elementary trigonometric estimates used below (The derivatives of sine and cosine are cosine and minus sine).
Finite LCU compression is the normalized coefficient-weighted sum (LCU projected-block correctness).
A Hermitian matrix has an orthonormal eigenbasis, so a uniform scalar error on its spectrum bounds the corresponding operator norm (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely).
Proof
Given: The convergent coefficient bound and positive input parameters.
Set , so , and . The omitted Taylor terms have modulus at most . Let and . These are nonnegative and , while for . One direct derivation is to solve with by coefficients, obtaining ; coefficient integration gives the inverse-sine derivative and its value zero at zero. Letting increase to one, nonnegativity and finite partial sums give total sum . Thus for , .
Let be the coefficients of the th power of this series, with . They are nonnegative with sum one. Convolution truncated above computes their exact coefficients through : all degrees are nonnegative, so discarded high degrees cannot contribute to a lower degree in a later convolution. For , . The last inequality follows by integrating on and using . Hence the omitted degrees in every power have absolute contribution at most . Summing with weights gives error at most .
With , the exact identity has coefficient absolute sum one. For the omitted terms , their absolute sum is a fair-binomial tail at most . To prove that bound directly, for a fair-binomial , ; the inequality follows termwise from . Markov's inequality with gives the upper tail , and symmetry gives the other tail. The case has no omitted terms. Since and , (the excess dominates ). Thus every retained degree's omitted Fourier tail is at most . After the coefficient weights the error is at most .
Combining the errors gives . Every frequency is with , so . Multiplication by converts the variable Fourier series to the OP8 evolution . This phase has modulus one. The exact total coefficient norm is at most : expanding sine powers has norm one, and truncation cannot increase their individual absolute sums. Collisions among signed frequencies can only reduce the norm by the triangle inequality. Rounding the final coefficients, including these phases, with total error at most adds at most that much uniform error and gives norm at most .
Choose a certified normalization containing the rounded coefficient norm below it; when one may take , which is rational only when is rational. LCU followed by flag dilution has clean compression equal to the rounded Fourier sum divided by . Its error from is at most for a Hermitian whose spectrum is in the stated interval, by diagonalization. Approximate SELECT evolutions or PREPARE/dilution operations add their declared operator errors through the usual finite product telescoping and weighted block sum. No normalized postselected-state inverse is used.
The largest evolution time is , since and . There are at most distinct frequencies. The finite convolution arrays need at most arithmetic operations (direct truncated convolution, then the binomial coefficients and frequency accumulation); their actual numerical precision and classical bit costs are separate and explicit. Thus this construction proves the scalar and coefficient claims without an uncharged coefficient oracle or a citation-only supplier.
Remarks
For shifted positive Gibbs G with 1<=lambda_min(G)<=2 and ||G||<=2K_G, choose x0=K_G+1/2,r=K_G,Delta=1/2. The exponential coefficients have absolute B=exp(-x0/2) exp((r+Delta)/2)=1. For the observable square root, x0=0,r=1,Delta=1/2 and coefficients (1/2) binom(1/2,k)2^-k have absolute sum at r+Delta bounded by one: the sum at 3/4 is (1/2)(2-sqrt(1-3/4))=3/4. These elementary series follow by differentiating and the same coefficient-recurrence argument as above.
Use the SAME observable normalization B_A,+ for numerator and M=0 baseline; the baseline is I/(2 B_A,+), not the unnormalized I/2 unless B_A,+=1. The Gibbs normalization is also fixed in both branches. This gives exact normalization cancellation before finite approximation errors are bounded.
Depends on
- Principal inverse sine and inverse cosine
- For $-1<y<1$, $(\arcsin y)^{\prime}=1/\sqrt{1-y^2}$ and $(\arccos y)^{\prime}=-1/\sqrt{1-y^2}$
- The derivatives of sine and cosine are cosine and minus sine
- LCU projected-block correctness
- Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely
Used by
- Sparse-oracle Gibbs-state purification Algorithm
- Sparse-oracle quantum SDP algorithm Algorithm
- Flagged Gibbs trace estimation: errors, probability floors and charged access Theorem
- Quantum SDP additive-optimality guarantee Theorem
- Quantum SDP query bound and QRAM cost boundary Theorem
- Sparse evolution substitution gives the quantum SDP and diagonal LP query bounds Theorem
Dependency tree · two levels
26 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
- van Apeldoorn et al., Quantum SDP-solvers, Appendix B, Lemma 37 and Theorem 40 (standard reference, not scraped)