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.
Normalization and nonzero success weight of the supported pseudoinverse target
Statement
In the block-encoded QLSP model, let be the normalized codomain input, let , and suppose is supported on positive singular values . Then In particular the ideal inverse-branch success probability is positive and has the stated crude lower bound.
Facts & Assumptions
Given: The finite-dimensional map and singular-gap promise of Block-encoded QLSP input and singular-gap promise, with .
Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition: there are orthonormal singular vectors and positive singular values with on the supported singular subspace.
Quantum linear-systems state-output task: the normalized input has , , and every nonzero supported singular coefficient has .
The Moore--Penrose pseudoinverse as the solution of the four Penrose equations: exactly when , , and are self-adjoint.
Every finite real or complex matrix has a unique Moore--Penrose pseudoinverse: the matrix satisfying the four Penrose equations exists and is unique.
The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||: on a nonzero finite-dimensional domain, is the maximum of over unit vectors .
Proof
By [F1], in ordered orthonormal singular bases write with positive diagonal entries . Define by replacing each positive with and leaving zeros zero. Direct multiplication gives , , and , both self-adjoint. Thus [F3] makes a Moore–Penrose inverse, and [F4] gives .
Since is normalized and its coefficients in the orthonormal singular vectors are , . Each is a unit vector and , so [F1] and [F5] give . Step 1.1 therefore yields . Thus its normalized state is defined.
The singular values of are with the same left and right vectors. Repeating the construction in step 1.1 gives because . Hence , and multiplication by the positive scalar preserves the normalized vector.
By [F2], coefficients outside the supported positive singular subspace vanish. By [F1] and [F5], each unit right singular vector satisfies . Since , step 2.2 gives . This is the ideal QSVT flag weight; any implementation error requires a separate error budget.
Depends on
- Block-encoded QLSP input and singular-gap promise
- Quantum linear-systems state-output task
- Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition
- The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||
- The Moore--Penrose pseudoinverse $A^+$ as the solution of the four Penrose equations
- Every finite real or complex matrix has a unique Moore--Penrose pseudoinverse
- Dirac Notation Conversion
Used by
Cited to discharge well-definedness by Block-encoded QLSP input and singular-gap promise.
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
- Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd, Quantum algorithm for linear systems of equations (standard reference, not scraped)