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.
Sparse diagonal block-encoded linear system
Example
Let , , , and be either basis vector. Take the exact one-ancilla block encoding For the inverse target use the odd polynomial , degree one, and error . A supplied real-QSVT extraction phase list is together with its conjugate list .
Facts & Assumptions
Given: The matrix, block, input states, , and the supplied phase lists specified in the Example.
Finite block encoding: the block encoding is exact when the all-zero ancilla compression equals and the encoding unitary is unitary.
QSP signal matrix and ordered phase sequence: and a degree-one sequence is with .
QSVT action on singular subspaces: the coherent extraction has compressed block equal to the singular-value transform of the real part of the upper-left polynomial.
Verification
The matrices are self-adjoint, commute, and satisfy . Thus and . The all-zero ancilla compression of is its top-left block , so [F1] gives an exact block encoding.
The diagonal entries of are its singular values. Both inputs are supported on singular values at least , and , so . For , because and . Hence . Also is odd, has degree one, satisfies , and on .
For , [F2] gives upper-left entry ; the conjugate list gives . Their coherent real extraction is by [F3]. Thus the exact response multipliers on the two singular vectors are and .
For , the QSVT success probability is and the ideal inverse-block probability is . For , these probabilities are and . Each successful state is the same basis vector as the normalized QLSP solution because the singular space is one-dimensional and both multipliers are positive. For the optional Bernstein reciprocal check, set for . Then the two polynomials are and , with degree-two Bernstein coefficient lists and . All coefficients are nonnegative, so the finite reciprocal certificate is valid.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
37 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 (standard reference, not scraped)