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.
Odd and even singular-value transforms
Definition
Let be the PUE map of Projected-unitary encoding and singular vectors, with positive singular-value decomposition . Let be a scalar function.
If is odd, define the odd singular-value transform by
If is even, define its right-space transform by
where is the orthogonal projection in onto . The left-space version is
The odd transform annihilates the right kernel because oddness gives ; the even transforms use the canonical kernel projections. The resulting operators are independent of the chosen SVD by Singular-value transform is independent of SVD choices ↗.
Depends on
Used by
- QSVT implementation of a bounded matrix function Algorithm
- Quantum singular-value transformation circuit Algorithm
- Parity violation makes singular-value action basis dependent Counterexample
- Hamiltonian-simulation polynomial target Definition
- Qubitization access model Definition
- Operator perturbation bound for QSVT Lemma
- Singular-value transform is independent of SVD choices Lemma
- Gapped pseudoinverse polynomial degree and error Theorem
- Matrix-function transformation error and resource bound Theorem
- QSVT action on singular subspaces Theorem
- QSVT robustness, approximation error, and resources Theorem
Dependency tree · two levels
17 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, Definition 16 (standard reference, not scraped)
- Andrew M. Childs, Lecture Notes on Quantum Algorithms, Chapter 29 §§29.2–29.3 (standard reference, not scraped)