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 adiabatic path model
Definition
Let be a nonzero finite-dimensional complex inner-product space with inner product linear in its first argument. A finite adiabatic path is a family of linear endomorphisms (Linear map between vector spaces over the same field) indexed by , whose matrix entries are twice continuously differentiable in and such that for every . A coherently followed spectral band is a norm-continuous family of orthogonal projections indexed by , of one fixed rank , commuting with , whose range is a sum of full eigenspaces and which locally continues the same isolated cluster. For a finite union of positively oriented circles , define as the sum of the parameterized integrals over its circle components. Local continuation means that on each neighborhood there is such a contour enclosing exactly the selected cluster and With , define the full gap If , the full gap is . Admissible gapped paths have a uniform full gap . Distinct eigenvalues inside the band may cross; its total rank remains .
For a real parameter , the slow-time propagator is the unique solution of Identifying complex coordinates with real and imaginary parts reduces this to a real finite matrix ODE (Linear matrix ODEs have unique global solutions on a fixed interval); differentiating shows it stays unitary.
An instance also supplies an explicit preparation isometry with image and its declared preparation cost. For a rank-one band this means a specified unit vector and a circuit preparing it; for a rank- band it is an orthonormal frame, not just the matrix or the projector . Given an input density operator on , the evolved output is . This is a density operator: for , by isometry and unitarity; hence is nonnegative by its quadratic form, and by trace cyclicity (Non-negative and positive operators, The basis-independent trace of an endomorphism of a finite-dimensional vector space, For and , ). A rank-one input is the pure-state projector (Pure state and ray, Density operator). A supplied target density operator on is compared with by trace distance (Trace Distance). A finite output POVM on and an accepting outcome set may be supplied; its success probability is the sum of the corresponding POVM probabilities (Finite POVMs and their outcome law, POVM outcome weights are probabilities). A finite projective measurement on may also be supplied, with success probability given by its projective outcome law (Finite projective measurements, Projective measurement outcome weights are probabilities); this is a special case of the POVM interface. The model is mathematical and includes no physical postulate.
Depends on
- Self-adjoint and normal endomorphisms of a finite-dimensional real or complex inner product space
- Linear map between vector spaces over the same field
- The adjoint $T^*:W\to V$ is characterised by $\langle Tv,w\rangle_W=\langle v,T^*w\rangle_V$
- Every linear map between finite-dimensional inner product spaces has a unique adjoint
- Adjoints satisfy $(S+T)^*=S^*+T^*$, $(\lambda T)^*=\overline\lambda T^*$, $(ST)^*=T^*S^*$, and $T^{**}=T$
- Non-negative and positive operators
- The basis-independent trace of an endomorphism of a finite-dimensional vector space
- For $A\in M_{m\times n}(F)$ and $B\in M_{n\times m}(F)$, $\operatorname{tr}(AB)=\operatorname{tr}(BA)$
- Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely
- The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||
- Pure state and ray
- Density operator
- Trace Distance
- Finite projective measurements
- Finite POVMs and their outcome law
- Projective measurement outcome weights are probabilities
- POVM outcome weights are probabilities
- Circuit-family and computation cost model
- Full-list uniform quantum circuit family
- Linear matrix ODEs have unique global solutions on a fixed interval
Used by
- Discretized adiabatic path simulation schedule Algorithm
- Five-local history-state adiabatic path Algorithm
- Gap closing invalidates a uniform adiabatic bound Counterexample
- Adiabatic path access and resource model Definition
- Finite adiabatic braid compilation input Definition
- Physical braid implementation interface Definition
- Two-level avoided crossing Example
- Finite gapped spectral projection regularity Lemma
- Finite spectral-band derivative estimates for adiabatic paths Lemma
- Finite adiabatic path simulation from term access Theorem
- Finite JRS adiabatic projector bound Theorem
Dependency tree · two levels
67 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
- Sabine Jansen, Mary-Beth Ruskai, and Ruedi Seiler, Bounds for the adiabatic approximation with applications to quantum computation (standard reference, not scraped)
- Andrew M. Childs, Lecture Notes on Quantum Algorithms (standard reference, not scraped)