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.
Amplitude-estimation additive error and success probability
Statement
For the QFT-based estimator with and integer , its output satisfies with probability at least when , and with probability strictly greater than when . In particular the error is at most . At the output is exactly zero; at it is exactly one.
For every allowed access instance and , the prescribed signed controlled circuit and its exact real cyclotomic output are well-defined, retaining the controlled relative phase and separately charged classical output processing.
Facts & Assumptions
Given: The amplitude task, QFT estimator with , and integer .
The estimator returns after QPE on the Grover iterate (QFT-based amplitude estimation).
The Grover eigenphases are modulo one with equal weights, where (Grover eigenphases encode the good probability).
The floor and ceiling phase labels have combined probability at least (Two nearest phase labels carry probability at least eight over pi squared).
The QPE tail for is at most , and exact-grid phases are returned with certainty (Phase-estimation nearest-grid and tail bounds).
Sine is -Lipschitz, so (Sine and cosine are -Lipschitz on ).
The fundamental theorem of calculus evaluates increments of a continuously differentiable function by integrating its derivative (The first fundamental theorem: if is integrable on and continuous at , then ; in particular a continuous has as a primitive).
The finite QPE outcome probability is (Phase-estimation finite outcome law).
The geometric sum equals when (Finite geometric sum for phase-estimation amplitudes).
Circular phase distance takes values in and identifies the two arcs from a phase to a label (Circular phase distance modulo one).
For , (Sine chord and linear bounds).
Euler's identity gives and (, , and ).
The complex modulus is multiplicative and satisfies (Conjugation is an involutive real-field automorphism, , and modulus is definite, multiplicative, and subadditive).
Sine is odd, cosine is even, and (Parity and the Pythagorean identity for sine and cosine).
The integer part satisfies (Integer part: for every real there is exactly one integer with ).
On a superposition of eigenspaces, QPE outcome probabilities are the eigenphase-weighted mixture, with no cross terms (Phase estimation on a superposition of eigenspaces).
The complex exponential is -periodic and additive in its exponent (, and the complex exponential extends the real exponential, , and exactly when ).
Sine changes sign under a shift by , and the supplementary identity is ; iterating the shift gives for every integer (Quarter-turn values and shifts by pi/2 and pi, Cofunction, supplementary, quarter-turn, and reflection identities for the six trigonometric functions).
The two Grover eigenphases are and , with equal weights in the prepared state for (Grover eigenphases encode the good probability).
QPE uses controlled positive powers and a projective readout of its -label register (Quantum phase estimation).
Controlled and inverse access are explicit capabilities. In repeated-unitary mode the task expands into its controlled factors; in power-query mode each supplied is a declared query with its own cost vector, including any constituent implementations used (Controlled Unitary Access, Inverse Unitary Access, Amplitude estimation and counting input/output contract).
A standalone global phase leaves outcome probabilities invariant, but a controlled global phase is a relative phase on the control (Standalone Global Phase Leaves Pure-State POVM Probabilities Unchanged, A Controlled Global Phase Becomes a Relative Control Phase).
The signed reflections in are unitary involutions (Projector Reflections Are Hermitian Unitary Involutions).
The phase-estimation access theorem counts supplied controlled-power queries or repeated controlled- calls (Phase-estimation query and gate costs).
Classical algebraic encoding and any decimal refinement are charged separately (Classical bit-operation cost).
A real value with has the exact real cyclotomic representation and comparison interface of Finite exact comparison of real cyclotomic values.
Proof
By [F21], the input state lies in the span of eigenvectors of with phases and ; the endpoint cases are single eigenphases. QPE is therefore applied to its finite eigenphase decomposition, and the projective measurement returns a label in the finite set by [F22].
In repeated-unitary mode, the task contract expands each controlled as , with every factor supplied or implemented and charged. In power-query mode the estimator instead uses the supplied controlled powers as declared queries, each with its own cost vector; it does not require separately supplied controlled or . The scalar minus is invisible only in an uncontrolled call by [F24], while under control it is retained as a relative phase. The reflection factors are unitary by [F25]. Thus the circuit instructions are well-defined under either declared access mode.
For , Euler's formula gives . This is a real algebraic element of the cyclotomic field, so the stated output is exactly encoded; query counts are those in [F26] and decimal/bit processing is charged under [F27].
Let and first suppose . Fix one Grover eigenphase , put , and let . The difference belongs to , so there are an integer and with . Hence . By the integer -shift identity [F18], the estimator output is for . On either eigenphase, : the first has , and the second has and uses the supplementary identity [F18]. Also by [F5], and on both branches: the second branch has by [F14] and [F18], while and by [F14]. For any real , [F5] and [F7] give . By [F6], the integrand has absolute value at most , so either orientation gives absolute remainder at most . On the phase-success event , hence , and the displayed error bound follows.
Let and fix one Grover eigenphase . For a tail outcome at distance , write by [F10]. Integer periodicity [F17] and sine parity [F14] reduce the denominator to by Euler [F12] and the sine addition formula. Thus [F8]–[F9] and [F12]–[F14] give , since the numerator modulus is at most and the denominator is by [F10]–[F11]. In the tail , put ; [F15] gives . Each annulus has at most two arcs of length , each containing at most one label on the grid. Thus the tail probability is at most . An empty tail has probability zero, also strictly below this positive bound. This strengthens [F4], so success is strictly greater than for each phase and hence for their mixture.
For , both labels from [F3] have circular distance at most from the relevant Grover phase. Off-grid, floor and ceiling labels have distances strictly below ; on-grid the distance is zero. Thus the event used in step 1.4 has probability at least .
At the Grover phase is the exact grid phase ; at it is , whose label is integral because is even. Exact-grid recovery [F4] gives outputs and . Finally gives the stated simplification.
Depends on
- QFT-based amplitude estimation
- Grover eigenphases encode the good probability
- Two nearest phase labels carry probability at least eight over pi squared
- Phase-estimation nearest-grid and tail bounds
- Phase estimation on a superposition of eigenspaces
- Sine chord and linear bounds
- Phase-estimation finite outcome law
- Finite geometric sum for phase-estimation amplitudes
- Circular phase distance modulo one
- Integer part: for every real $x$ there is exactly one integer $m$ with $m \le x < m + 1$
- Exact phase recovery on the QPE grid
- The derivatives of sine and cosine are cosine and minus sine
- The addition formulas for sine and cosine
- Sine and cosine are $1$-Lipschitz on $\mathbb{R}$
- The first fundamental theorem: if $f$ is integrable on $[a,b]$ and continuous at $c$, then $F'(c) = f(c)$; in particular a continuous $f$ has $F$ as a primitive
- $\exp(x+iy)=e^x(\cos y+i\sin y)$, $|\exp(x+iy)|=e^x$, and $e^{i\pi}+1=0$
- $\exp(z+w)=\exp z\,\exp w$, and the complex exponential extends the real exponential
- $\ker(\exp)=2\pi i\mathbb Z$, and $\exp z=\exp w$ exactly when $z-w\in2\pi i\mathbb Z$
- Conjugation is an involutive real-field automorphism, $z\overline z=|z|^2$, and modulus is definite, multiplicative, and subadditive
- Parity and the Pythagorean identity for sine and cosine
- Quarter-turn values and shifts by pi/2 and pi
- Cofunction, supplementary, quarter-turn, and reflection identities for the six trigonometric functions
- Amplitude estimation and counting input/output contract
- Eigenphase estimation access model
- Quantum phase estimation
- Phase-estimation query and gate costs
- Controlled Unitary Access
- Inverse Unitary Access
- Standalone Global Phase Leaves Pure-State POVM Probabilities Unchanged
- A Controlled Global Phase Becomes a Relative Control Phase
- Projector Reflections Are Hermitian Unitary Involutions
- Classical bit-operation cost
- Finite exact comparison of real cyclotomic values
Used by
- Amplitude-estimation expectation estimator Algorithm
- Finite CKS sparse QLSP with variable-time inverse estimation Algorithm
- Amplitude-estimation query and precision complexity Theorem
- Explicit median confidence guarantee for amplitude estimation Theorem
- Quantum bounded-expectation guarantee and query cost Theorem
- Quantum counting error and boundary cases Theorem
- Quantum counting query complexity Theorem
- Relative probability estimation with a charged finite cap Theorem
Cited to discharge well-definedness by QFT-based amplitude estimation.
Dependency tree · two levels
178 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
- Brassard, Høyer, Mosca, and Tapp, Quantum Amplitude Amplification and Estimation, complete article, §§4–5, Theorems 11–18 (standard reference, not scraped)
- Andrew M. Childs, Lecture Notes on Quantum Algorithms, complete lecture notes, §§19.1–19.3 (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes, complete 239-page notes, §7.3 (standard reference, not scraped)