Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generated
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 V be a nonzero finite-dimensional complex inner-product space with inner product linear in its first argument. A finite adiabatic path is a family H(s):V→V of linear endomorphisms (Linear map between vector spaces over the same field) indexed by s∈[0,1], whose matrix entries are twice continuously differentiable in s and such that H(s)=H(s)∗ for every s∈[0,1]. A coherently followed spectral band is a norm-continuous family of orthogonal projections P(s):V→V indexed by s∈[0,1], of one fixed rank m≥1, commuting with H(s), 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 ∮ΓF(z) dz as the sum of the parameterized integrals ∫02πF(c+reit)ireit dt over its circle components. Local continuation means that on each neighborhood there is such a contour enclosing exactly the selected cluster and P(s)=−12πi∮Γ(H(s)−zI)−1 dz. With Q(s)=I−P(s), define the full gap g(s)=min⁡{∣λ−μ∣:λ∈σ(H(s)∣ran⁡P(s)), μ∈σ(H(s)∣ran⁡Q(s))}. If Q(s)=0, the full gap is +∞. Admissible gapped paths have a uniform full gap inf⁡s∈[0,1]g(s)>0. Distinct eigenvalues inside the band may cross; its total rank remains m.

For a real parameter T∈R, the slow-time propagator UT is the unique solution of iddsUT(s)=TH(s)UT(s),UT(0)=I. 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 UT(s)∗UT(s) shows it stays unitary.

An instance also supplies an explicit preparation isometry A0:Cm→V with image ran⁡P(0) and its declared preparation cost. For a rank-one band this means a specified unit vector ψ0∈ran⁡P(0) and a circuit preparing it; for a rank-m band it is an orthonormal frame, not just the matrix H(0) or the projector P(0). Given an input density operator ρin on Cm, the evolved output is ρT=UT(1)A0ρinA0∗UT(1)∗. This is a density operator: for W=UT(1)A0, W∗W=A0∗UT(1)∗UT(1)A0=I by isometry and unitarity; hence WρinW∗ is nonnegative by its quadratic form, and tr⁡(WρinW∗)=tr⁡(ρinW∗W)=1 by trace cyclicity (Non-negative and positive operators, The basis-independent trace of an endomorphism of a finite-dimensional vector space, For A∈Mm×n(F) and B∈Mn×m(F), tr⁡(AB)=tr⁡(BA)). A rank-one input is the pure-state projector (Pure state and ray, Density operator). A supplied target density operator σ on V is compared with ρT by trace distance D(ρT,σ) (Trace Distance). A finite output POVM on V 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 V 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

Used by

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