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.
QFT-based amplitude estimation
Definition
Input. An instance from Amplitude estimation and counting input/output contract, an integer , , and either the declared controlled-power access mode or repeated controlled- access.
Instructions. Prepare , run the -label QPE circuit on using controlled powers , , and measure its phase register to obtain . Output the exact cyclotomic value with the real embedding specified by this root. A decimal approximation is postprocessing and is charged separately. The leading minus in is retained: on a controlled call it is the control phase , not a discarded standalone global phase.
Depends on
- Amplitude estimation and counting input/output contract
- Grover eigenphases encode the good probability
- 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
- Median confidence amplification for amplitude estimation Algorithm
- Quantum counting by uniform-state amplitude estimation Algorithm
- Relative estimation of a promised coherent success probability Algorithm
- Amplitude-estimation additive error and success probability Theorem
- Amplitude-estimation query and precision complexity Theorem
- Coherent query-to-circuit cost translation Theorem
- Explicit median confidence guarantee for amplitude estimation Theorem
- Quantum bounded-expectation guarantee and query cost Theorem
- Quantum counting error and boundary cases Theorem
- Relative probability estimation with a charged finite cap Theorem
Dependency tree · two levels
78 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)