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.
QSVT action on singular subspaces
Statement
Let be the PUE map of Projected-unitary encoding and singular vectors, with positive singular pairs , and let be the exact phase list in Quantum singular-value transformation circuit. Let be the upper-left scalar polynomial of its QSP signal sequence. On every positive two-dimensional singular plane from PUE singular-space invariant decomposition, the QSVT sequence is exactly . Consequently, if is odd,
and if is even,
The formulas include singular values and , repeated singular values, unmatched left and right kernels, and zero-dimensional singular spaces. If is zero or has degree at most , has parity , and satisfies on , the exact completion and phase-factorization suppliers give a phase list with . The coherent / branch then has compressed block ; for a supplied uniform scalar error , its block differs from by at most .
Facts & Assumptions
Given: A PUE, a finite phase list, and the definitions of the singular-value and QSP transforms.
Projected-unitary encoding and singular vectors: is a contraction with an SVD .
PUE singular-space invariant decomposition: for , the basis change is ; the plane collapses and the zero and residual subspaces are specified separately.
QSP signal matrix and ordered phase sequence: , , and .
Unitarity, determinant, and polynomial form of a QSP sequence: the upper-left entry of is a polynomial of parity and degree at most .
Odd and even singular-value transforms: odd transforms act between left and right singular spaces; even transforms act on a singular space and use on its kernel.
Singular-value transform is independent of SVD choices: these transforms are independent of the chosen singular-vector bases.
Completion of a bounded real parity polynomial: every real polynomial of degree at most , parity , and bound on has an admissible complex completion with real part exactly .
Constructive factorization of an admissible QSP polynomial pair: every admissible pair has an exact real phase list for the fixed Hermitian-reflection QSP sequence.
Projector Reflections Are Hermitian Unitary Involutions: is unitary, with eigenvalues on and on .
Hermitian-reflection and SU(2) QSP convention conversion: conversion to the SU(2) convention carries an explicit scalar , which is retained under control.
Projector phase operations from controlled reflections: its clean-ancilla toggle flips on and each toggle uses one controlled-reflection call plus a fixed ancilla gate.
Proof
Fix . In the input basis and output basis , [F2] says that is , and has the same matrix because it is real symmetric. The right-projector phase is on the input basis since has eigenvalues there; the left-projector phase is the same on the output basis. Thus the alternating sequence multiplies in the fixed order , whose upper-left entry is by [F3]–[F4].
If , [F2] gives and the complementary component is zero; the surviving one-dimensional action is the first-coordinate action of , namely . For , lies in and . The alternating calls therefore swap this right-kernel vector and its left-complement image exactly as does. If is odd the final vector lies in and the left compression is zero, equal to because [F4] makes odd. If is even it returns to with coefficient , the prescribed even-kernel term in [F5]. Left-kernel inputs and the residual complement contribute nothing to the stated compression by [F2].
The positive singular planes, the lines, the right zero-kernel lines, and the residual blocks are orthogonal and exhaust the relevant projected spaces by [F2]. Summing the scalar coefficients from steps 1.1–1.2 therefore gives the displayed odd and even compressed-block formulas.
For real under the stated degree, parity, and interval bounds, [F7] gives an admissible pair with , and [F8] supplies its exact phase list . At each slot with phase about , use the clean-ancilla toggle from [F11], then apply unconditional , then a control-one-controlled , and then again. In control branch the middle rotation is ; in branch it is . Since places the ancilla in on and in on , the induced system phases are respectively and , and the ancilla returns to . The same unconditioned signal calls therefore give full branch operators and . Because is real and , entrywise conjugation gives , and projection of the control from to has block . By step 2.1, its coefficient on each positive singular pair is ; for an even transform the same identity gives on . Thus the compressed block is . If the supplied scalar approximation satisfies , each singular coefficient changes by at most , so orthonormality gives operator-norm error at most . The proof stays in the reflected convention; [F10]'s scalar is not discarded if a circuit is translated to the SU(2) convention.
Depends on
- Projected-unitary encoding and singular vectors
- Quantum singular-value transformation circuit
- PUE singular-space invariant decomposition
- Odd and even singular-value transforms
- Singular-value transform is independent of SVD choices
- QSP signal matrix and ordered phase sequence
- Unitarity, determinant, and polynomial form of a QSP sequence
- Dirac Notation Conversion
- Projector Reflections Are Hermitian Unitary Involutions
- Hermitian-reflection and SU(2) QSP convention conversion
- Completion of a bounded real parity polynomial
- Constructive factorization of an admissible QSP polynomial pair
- Projector phase operations from controlled reflections
Used by
- QSVT regularized pseudoinverse transformation Algorithm
- Qubitized Hamiltonian simulator Algorithm
- A bounded polynomial approximation to a scaled exponential Example
- Rank-one PUE singular-plane calculation Example
- Sparse diagonal block-encoded linear system Example
- Operator perturbation bound for QSVT Lemma
- Matrix-function transformation error and resource bound Theorem
- QSVT inverse-state output and success cost Theorem
- QSVT robustness, approximation error, and resources Theorem
- Qubitization lifts scalar QSP Theorem
- Qubitized simulation correctness Theorem
- Real bounded polynomial extraction in QSVT Theorem
Dependency tree · two levels
48 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, Theorem 17 and Corollary 18 (standard reference, not scraped)
- Andrew M. Childs, Lecture Notes on Quantum Algorithms, Chapter 29 §§29.2–29.3 (standard reference, not scraped)