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.
Positive-sign cyclic quantum Fourier transform
Definition
For an integer , let be the negative-sign, -normalized transform of The unitary discrete Fourier transform on . Define the cyclic quantum Fourier transform by . The inverse exists by Finite Fourier inversion for the unitary transform on , and its matrix on the standard basis indexed by is
Here the standard-basis ket convention is the one specified by Dirac Notation Conversion. Thus the transform has the positive sign and the same normalization as the inverse Fourier formula. At it is the identity on the one-dimensional register. In the binary specialization , the circuit page writes each index in its unique base-two expansion.
Depends on
Used by
- Exact binary QFT circuit Algorithm
- Power-of-two dihedral hidden-subgroup sieve Algorithm
- Quantum phase estimation Algorithm
- QFT circuit order and truncation examples Example
- A finite-grid quantum subgradient from approximate values Lemma
- Binary factorization of QFT basis output Lemma
- Fourier sample from a generalized-dihedral reflection coset state Lemma
- Phase-estimation finite outcome law Lemma
- Exact binary QFT circuit correctness Theorem
- Phase estimation on a superposition of eigenspaces Theorem
Dependency tree · two levels
27 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
- Ronald de Wolf, Quantum Computing: Lecture Notes (arXiv:1907.09415v6) (standard reference, not scraped)
- Andrew M. Childs, Lecture Notes on Quantum Algorithms (standard reference, not scraped)
- John Preskill, Quantum Information, Chapter 6: Quantum Algorithms (standard reference, not scraped)