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.
OP5 HHL returns the QLSP state within the requested error
Statement
Under the promises and precision allocations in HHL finite sine-window phase-estimation algorithm, let be the actual joint success vector for one prepared attempt, where rectangular-mode success includes the domain-tag projection. Write and for the ideal joint vector, including the unchanged preparation work and clean algorithmic registers. For and , the conditional returned joint pure-state ray (including unchanged preparation work) has a unit representative within vector norm of the normalized QLSP target tensored with the preparation work, clean algorithmic registers and well flag, and the capped amplification returns FAIL with probability at most . The same assertion holds for the Hermitian dilation, with the output in its tagged domain summand.
Facts & Assumptions
Given: The OP5 algorithm, a normalized input supported on , and the stated ideal simulator and circuit-error contracts.
Ideal inverse amplitude and HHL postselection probability: and ; tensoring the unit work, clean-register and well-flag factors gives .
Second moment of the signed sine-window phase kernel: conditional on each eigenvalue, the signed kernel obeys .
Relative stability of the HHL filter on supported eigenvalues: the well/ill flag-amplitude perturbation is at most times the ideal well amplitude.
Finite capped amplification succeeds with a supplied lower bound: probability at least of a verified well outcome, and its normalized good component is preserved.
Normalization is stable under a small flagged-vector error: relative flagged-vector error at most gives normalized-vector error at most .
HHL finite sine-window phase-estimation algorithm: the forward and actual inverse simulation calls have total full-space operator error, or total clean-input isometry error in the alternative mode, at most and the flag rotation has operator error at most this amount.
Operator error for the finite sine-prefix rotation table: the sine preparation and its inverse each have operator error at most .
Unitary hybrids on a preserved clean-work subspace accumulates local clean-input errors along the ideal all-clean workspace trajectory, including actual adjoints, controls and reference systems.
Hermitian dilation for a rectangular linear system: . For , , the diagonal Penrose construction gives . Thus the ideal well vector is fixed by the domain-tag projection.
Proof
First take the exact sine preparation, exact simulations and exact flag rotation. Before reversing phase estimation, different decoded labels are orthogonal. For a fixed eigenvalue , the well-flag projection keeps only the coordinate, so the squared error is By [F2] and [F3], this is at most . Summing with the eigenbasis weights shows that the exact-kernel well vector differs from by at most . Reversing the phase transform is unitary and preserves this norm bound.
Replacing the exact preparation, simulations and flag map by their implementations changes the attempt on its clean initial input by at most the sum of their norm errors. In the full-space mode this is ordinary unitary telescoping; in the clean-workspace mode [F7] applies because all ideal other gates leave simulator work untouched and ideal simulations return it to zero. The actual intermediate work need not be clean. In either mode the sum consists of two sine-table preparation uses, the total forward/reverse simulation budget, and one flag map, at most . The success projection is contractive and fixes : in rectangular mode this follows from [F8], and otherwise it is just the well flag. Applying it to both the exact-kernel comparison and the implementation error therefore gives using and . Hence and the implemented well probability exceeds .
The exact filter on supported eigenvalues is , so is the target. The normalization inequality in [L1] applies because step 2.1 gives relative error below : directly, . By [F4], every successful amplified branch is the same ray as ; choose the representative to obtain the stated distance. The preparation work factors as and is untouched by the HHL circuit; the ideal uncomputation leaves the other algorithmic registers zero and the measured flag in . Tensoring these unit vectors does not change any norm above. For a rectangular map with and , Hermitian dilation for a rectangular linear system gives ; the singular values of the scaled dilation are , so . This positive scalar cancels on normalization, leaving the ideal QLSP ray in the tagged domain summand. The actual successful vector also lies in that summand because includes its domain projection. Tracing out work gives the corresponding output density state.
Depends on
- HHL finite sine-window phase-estimation algorithm
- Ideal inverse amplitude and HHL postselection probability
- Second moment of the signed sine-window phase kernel
- Operator error for the finite sine-prefix rotation table
- Relative stability of the HHL filter on supported eigenvalues
- Normalization is stable under a small flagged-vector error
- Finite capped amplification succeeds with a supplied lower bound
- Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely
- Hermitian dilation for a rectangular linear system
- 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
- Unitary hybrids on a preserved clean-work subspace
Used by
Dependency tree · two levels
54 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)
- Andrew M. Childs, Robin Kothari, and Rolando D. Somma, Quantum algorithm for systems of linear equations with exponentially improved dependence on precision (standard reference, not scraped)
- Andrew M. Childs, Lecture Notes on Quantum Algorithms (standard reference, not scraped)