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.
Finite Hermitian matrix dynamics
Definition
In this page a Hamiltonian is a self-adjoint endomorphism of a finite-dimensional complex inner-product space ; no physical postulate is part of the term. Let be the set of its distinct eigenvalues and let be the orthogonal projection onto the -eigenspace. For real time , define the finite matrix evolution
The second expression uses the finite spectral functional calculus The spectral functional calculus f(T) for a normal endomorphism. If is the zero space, the spectrum is empty and the empty sum is the unique endomorphism, which is also the identity on . This definition specifies a mathematical unitary from a finite matrix; it makes no claim that the operation has an efficient circuit or a free access cost.
Depends on
- Self-adjoint and normal endomorphisms of a finite-dimensional real or complex inner product space
- Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely
- The spectral functional calculus f(T) for a normal endomorphism
- $\exp(z+w)=\exp z\,\exp w$, and the complex exponential extends the real exponential
- $\exp(x+iy)=e^x(\cos y+i\sin y)$, $|\exp(x+iy)|=e^x$, and $e^{i\pi}+1=0$
Used by
- Discretized adiabatic path simulation schedule Algorithm
- Hypercube continuous-time state transfer Algorithm
- Generator convention matters Counterexample
- Continuous-time Hamiltonian access cost model Definition
- Continuous-time quantum walk Definition
- First-order Lie product formula Definition
- Hamiltonian simulation error and resources Definition
- Hamiltonian-simulation polynomial target Definition
- Small hypercube transfer Example
- Sparse parity-path transfer and norm Lemma
- Suzuki recursive cancellation of error terms Lemma
- Conservative second-order error Theorem
- Correctness of the small-time-aware simulator Theorem
- Exact and approximate success of complete-graph continuous-time search Theorem
- Exact state transfer on the Boolean hypercube Theorem
- Finite adiabatic path simulation from term access Theorem
- First-order commutator error Theorem
- Parameter-shift derivative for a Pauli generator Theorem
- Segmented Taylor error and resources Theorem
- Sparse Hamiltonian no-fast-forwarding Theorem
- Taylor simulation tail bound Theorem
- Unitary and differential identities for finite matrix dynamics Theorem
Dependency tree · two levels
23 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, Chapter 17 §17.1 (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes, Chapter 9 §9.1 (standard reference, not scraped)