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.
First-order error for two Pauli terms
Example
For the Pauli matrices the two-term Hamiltonian has first-order commutator bound . Also, for every , the same fixed total matrix has the decomposition , , whose commutator certificate grows with although .
Facts & Assumptions
Given: The displayed matrices as endomorphisms of with its standard inner product (linear in the first argument), real , integer , real , and tolerance .
First-order commutator error gives for two terms.
The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv|| defines the operator norm as the maximum over unit vectors.
Verification
In the standard inner product, direct conjugate transpose gives and . Matrix multiplication gives and . Therefore .
The same matrices give . Hence [F2] and [F3] give , and scalar homogeneity of the operator norm yields .
Substituting , and into [F1] gives . For the exact finite boundary , both evolutions are and the error is zero.
For and , both terms are Hermitian and their sum is . Direct multiplication gives , and [F2]–[F3] give . Bilinearity and give , whose norm is by [step 2.1] and . Thus [F1] gives the sufficient certificate . To make this particular bound at most requires when . For fixed and , this threshold is unbounded as grows while the total matrix and its norm stay fixed; it shows that this error certificate cannot choose a uniform from and alone. It is not a lower bound on the actual simulation error.
Depends on
Used by
Nothing in the library uses this result yet.
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
- Andrew M. Childs, Lecture Notes on Quantum Algorithms (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes (standard reference, not scraped)