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.
Unitary hybrids on a preserved clean-work subspace
Statement
Let be an isometry of nonzero finite-dimensional complex Hilbert spaces, a unitary on , and a unitary on . If , then . The same inequalities hold after adjoining an arbitrary finite reference space or coherently controlling and against identity.
More generally, let be actual unitaries on and ideal unitaries on , with . Then The empty products give zero error. Each bound concerns the clean input subspace ; none assumes that an actual intermediate state belongs to that subspace or claims a full-space approximation on arbitrary dirty-work inputs.
Facts & Assumptions
Given: The finite spaces, isometry, unitaries and error bounds in the Statement.
The operator norm is submultiplicative and satisfies ||T^*T|| = ||T||^2 gives the operator-norm product inequality. Unitary multiplication preserves vector norms and hence preserves the operator norm of any compatible matrix.
Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition diagonalizes the squared norm of a finite rectangular map in orthonormal bases.
Proof
The exact identity , together with unitary invariance, gives . Thus reversing the actual circuit supplies the inverse clean-input bound, without applying a forward error promise to dirty work.
If has singular values , [F2] gives orthonormal bases in which . Tensor those bases with any orthonormal reference basis; for , . A top singular vector tensored with any unit reference vector attains equality, so . If the reference space is zero, the amplified map is zero and its bound is immediate. For coherent control against identity, the difference between the actual and ideal clean-input maps is zero on the control-zero summand and on the orthogonal control-one summand; its norm is at most . These statements apply to step 1.1 as well as to the original forward bound.
For , expansion and cancellation give Every factor outside the local difference is unitary, so each summand has norm at most . The triangle inequality yields the claimed sum. On the right of each local difference are only ideal system unitaries followed by , so this expansion evaluates that difference on clean ideal inputs. The actual later unitaries on the left propagate the error without any cleanliness assumption. For , both products are identity maps, so the difference is zero.
Depends on
Used by
- Finite CKS sparse QLSP with variable-time inverse estimation Algorithm
- HHL finite sine-window phase-estimation algorithm Algorithm
- Sparse-oracle quantum SDP algorithm Algorithm
- HHL state-preparation and simulation access model Definition
- CKS stopping-time and success-mass instantiation Lemma
- HHL sparse-query and state-preparation cost Theorem
- OP5 HHL returns the QLSP state within the requested error Theorem
- Sparse evolution substitution gives the quantum SDP and diagonal LP query bounds Theorem
Dependency tree · two levels
9 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)