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.
Qubitized simulation correctness
Statement
For the exact access model of Qubitization access model, or its bounded-block-error variant satisfying the post-degree budget in Qubitized Hamiltonian simulator, rational , and , a successful execution of Qubitized Hamiltonian simulator returns a unitary dilation satisfying on the clean-input isometry , where appends every work register in zero. Output work registers are approximate; no full-space error on arbitrary dirty work inputs or exact cleanup is asserted. For , the declared identity branch is exact. For every reference system, tracing out work gives the corresponding system-output trace-distance bound at most .
Facts & Assumptions
Given: A finite Hermitian with , either the exact or budgeted bounded-error normalized block encoding, and a successful certified OP4 execution.
Qubitized Hamiltonian simulator: OP4 gives combined scalar error at most , sets each real phase-synthesis tolerance to , requires the bounded-block mode to satisfy , and allocates the remaining post-amplification primitive-implementation error at most .
Jacobi–Anger Chebyshev truncation: the factorial-tail polynomial and its certified coefficient rounding give the stated scalar error on .
Correctness of QSP phase synthesis: on a successful numerical phase-synthesis call, the exact phase-list polynomial error plus the sum of its implemented phase-slot errors is at most .
QSVT action on singular subspaces: the alternating QSVT sequence has the stated polynomial compressed block on each singular space, including endpoints and null spaces.
Clean-input isometry error bounds output trace distance: clean-input isometry error bounds the reference-system trace distance after work is traced out.
Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: a finite Hermitian has an orthonormal eigenbasis.
Qubitization access model and Qubitized Hamiltonian simulator: the exact and bounded-error modes both satisfy .
Robust one-step OAA including ancilla leakage: if has clean block and for a unitary , the phase-corrected OAA circuit has clean-input isometry error at most , including workspace leakage.
The inner-product norm is definite, homogeneous, and satisfies the triangle inequality: the vector triangle inequality induces the operator-norm triangle inequality used in spectral and circuit-product error sums.
Operator perturbation bound for QSVT: for any fixed exact degree- QSVT phase sequence, changing the encoded contraction by changes its singular-value-transform block by at most .
Proof
Given: A successful output of the simulator in Facts & Assumptions; when , all OP4 certificates succeed. Put and .
If , [F1] returns the identity circuit with no signal query, and ; hence its clean-input isometry error is zero. If , continue with the certified OP4 output.
On an eigenvector of with eigenvalue , has eigenvalue , by [F8] and [F9]. Put and . The OP4 certificate gives by [F1]–[F2], and . Since , In the orthonormal eigenbasis, this error is diagonal; for any vector with coordinates , its squared output norm is the sum of times the squared scalar errors. Thus the uniform scalar bound gives . For each real QSVT extraction, [F3] bounds the exact phase-list polynomial mismatch plus the implemented phase-slot errors by uniformly on . For the bounded mode, apply [F12] to the exact and phase sequences on the supplied block and on the target block; each branch changes by at most , so their average has the same block-perturbation bound. The coefficient-qubit average therefore gives a complete block with For even , ; for odd , the singular vector of a negative eigenvalue has left vector , so , and . Thus these transforms are the ordinary polynomial blocks on . The certified error is consequently
Since , . Apply [F10] to the unitary whose clean block is , with target unitary . The phase-corrected OAA circuit therefore has clean-input isometry error at most , including its retained-work leakage.
The per-occurrence certificates in [F1] cover every remaining unitary primitive in the fully unrolled post-amplification circuit, counting repeated, inverse and controlled calls separately. If there are such occurrences, each contributes at most in full operator norm. The telescoping product identity, [F11], and unitary norm one bound the difference between the actual and phase-certified OAA unitaries by ; for the difference is zero. Thus the actual clean-input isometry error is at most .
If , [F1] returns the exact identity and the conclusion holds with zero error. If , step 3.1 gives the clean-input isometry bound. Apply [F7] in either case; it includes arbitrary reference systems and discarding the work registers, so the trace distance is at most .
Depends on
- Qubitized Hamiltonian simulator
- Jacobi–Anger Chebyshev truncation
- Correctness of QSP phase synthesis
- QSVT action on singular subspaces
- Operator perturbation bound for QSVT
- The operator norm is submultiplicative and satisfies ||T^*T|| = ||T||^2
- Projector Reflections Are Hermitian Unitary Involutions
- Clean-input isometry error bounds output trace distance
- Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely
- Qubitization access model
- Robust one-step OAA including ancilla leakage
- The inner-product norm is definite, homogeneous, and satisfies the triangle inequality
Used by
Dependency tree · two levels
85 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 58 and proof (standard reference, not scraped)
- Andrew M. Childs, Lecture Notes on Quantum Algorithms, Chapter 29 §§29.3–29.4 (standard reference, not scraped)
- Guang Hao Low and Isaac L. Chuang, Hamiltonian Simulation by Qubitization (standard reference, not scraped)