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 inverse-state output and success cost
Statement
Let be the generated odd polynomial degree and let bound the total operator error of one QSVT success block relative to , including scalar approximation, block-encoding, and phase-synthesis errors. If and the normalized input is supported on singular values at least , then , where . If , the implemented success weight satisfies Conditional on success of one unamplified attempt, let be its phase-fixed success vector. The unit representative differs in vector norm from by at most . The amplified returned quantum state has this same ray: for any unit representative of that state there is with such that . This terminal-state convention leaves the coherent phase and operator-error bound of the actual QSVT success block fixed as stated above. Put , so . In particular, gives .
An unamplified attempt of degree uses exactly block-encoding signal calls in the QSVT sequence. Applying the supplied unknown-amplitude amplification procedure costs expected signal calls, with state preparation, controlled/inverse calls, reflections, phase gates, synthesis, and classical certificate generation charged separately. When the degree theorem is established, , so this becomes expected signal calls, and the crude bound gives . This is an expected-cost statement; it does not assert a fixed worst-case stopping time.
Facts & Assumptions
Given: The block-encoded QLSP instance, a successful polynomial/phase certificate including the exact returned-phase product check, and for the actual success block. The phase-approximation and circuit-implementation errors in are measured relative to that verified ideal sequence.
Gapped pseudoinverse polynomial degree and error: on , the generated odd polynomial approximates and has degree .
Normalization and nonzero success weight of the supported pseudoinverse target: has and its normalized output is the QLSP target.
QSVT action on singular subspaces: the odd sequence on the adjoint PUE acts on each supported singular pair with scalar multiplier , and uniform scalar error gives the corresponding operator error.
QSVT signal and reflection query counts: a degree- QSVT sequence makes exactly signal calls, and phase/reflection and controlled-call counts remain separate.
Expected cost of unknown-amplitude search: for positive success weight , the unknown-amplitude procedure has expected query cost , with gates and classical costs separate.
Amplitude-amplification invariant plane: each standard Grover iterate acts on the span of the normalized good and bad components, and its good component is a scalar multiple of the same normalized good vector.
Unknown-amplitude randomized search: each round starts with a fresh preparation and returns only after the good projector accepts.
Unknown-amplitude search has no false positives and halts almost surely: on a positive initial good weight, the search returns a good output with probability .
QSVT regularized pseudoinverse transformation: before execution, the algorithm multiplies the exact returned phase-scalar list and checks its four polynomial entries against the returned completed pair; a mismatch returns PHASE_PRODUCT_ERROR without a QSVT call.
Proof
Write the finite SVD . Since is supported on , applying the odd transform to maps each to with multiplier given by the verified phase-sequence polynomial. By [F9] this ideal polynomial is exactly the generated completed-pair target before numerical phase approximation; its total difference from the intended transform, including polynomial shrink and phase/circuit errors, is included in . The target multiplier is , the coefficient of ; [F1] and [F3] therefore bound the operator error on the supported subspace by .
Put and let be the implemented success vector. Then . By [F2], , so reverse triangle inequality gives and . Moreover, The conditional state is defined because .
By [F2], . In the implemented case, if , step 1.2 gives . By [F4], one attempt uses block-encoding signal calls, and phase/reflection and controlled-call resources remain separate.
Put for the one-attempt good vector. By [F6], after any integer number of amplitude-amplification iterates the unnormalized good component is for a scalar . On a positive-probability good branch , and the normalized ket is ; its phase can differ from that of . Each such branch has exactly the density operator , including after the stopping history is forgotten. Thus any returned unit representative is with , and choosing gives and the error bound of step 1.2. This identifies the terminal state ray without rephasing any coherent circuit or controlled call. Fresh rounds use the same preparation circuit, and [F7] returns only on that good measurement; [F8] supplies eventual success for . Applying [F5] to the actual success weight gives expected attempts, hence expected signal calls. If [F1] is established, substitute ; if , step 2.1 gives . All other resource coordinates remain separate by [F4]–[F5].
Depends on
- QSVT regularized pseudoinverse transformation
- Block-encoded QLSP input and singular-gap promise
- Gapped pseudoinverse polynomial degree and error
- Normalization and nonzero success weight of the supported pseudoinverse target
- QSVT action on singular subspaces
- QSVT signal and reflection query counts
- Unknown-amplitude randomized search
- Amplitude-amplification invariant plane
- Expected cost of unknown-amplitude search
- Unknown-amplitude search has no false positives and halts almost surely
- Dirac Notation Conversion
- Circuit-family and computation cost model
Used by
Dependency tree · two levels
83 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)
- Gilles Brassard, Peter Høyer, Michele Mosca, and Alain Tapp, Quantum amplitude amplification and estimation (standard reference, not scraped)