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.
Adiabatic Computation and Circuit Equivalence — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Adiabatic Computation and Circuit Equivalence
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Circuit Syntax, Denotational Semantics, and Measurement
- Clifford+T Exact and Approximate Synthesis
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Continuous-Gate Universality and Exact Synthesis
- Continuous-Time Quantum Walks
- Controlled Gates, Phase, and Entanglement
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Euclidean Ordinary Differential Equations with Smooth Dependence
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Dimensional Normed Spaces and Riesz Lemma
- Finite-Dimensional Complex Inner-Product Spaces and Matrix Interfaces
- Formal Languages, Encodings, and Decision Problems
- Foundations of the Real Numbers for Analysis
- Free Modules, Exact Sequences, Projective and Injective Modules
- Fundamental Trigonometric Identities
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hamiltonian Simulation and Product Formulas
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Recurrences and Rational Generating Functions
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurements, POVMs, and Instruments
- Metric Spaces
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Picard-Lindelöf and First-Order Ordinary Differential Equations
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Properties of the Integral and the Working FTC
- Pure and Mixed States, Ensembles, and Schmidt Decomposition
- Qubits, Bloch Sphere, Pauli Algebra, and One-Qubit Gates
- Registers, Tensor Products, and Partial Trace
- Relations, Functions, and Quotients
- Resource Bounds and Machine Invariance
- Reversible Computation, Ancillas, and Coherent Oracles
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Strongly Continuous Semigroups and Hille Yosida
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tensor Products of Modules
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Trace Distance, Fidelity, and Information Limits
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Turing Machines, Configurations, and Computation
- Uniform Circuit Families, Promise Problems, and Complexity
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
These examples compute an avoided-crossing gap and its finite JRS bound, show explicitly why a path with a closing gap can fail to follow its ground state, and expand a padded two-gate history state together with its propagation terms. The examples use the conventions and hypotheses from adiabatic-computation-and-circuit-equivalence.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Two-level avoided crossing
Statement
Consider on , where and . Compute its full ground-to-excited gap, derivative bounds, and rank-one JRS error bound.
Facts & Assumptions
Given: The finite path and rank-one JRS estimate from Finite adiabatic path model and Finite JRS adiabatic projector bound.
The eigenvalues of a finite Hermitian matrix determine its ground band and gap (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely).
For a rank-one band, the JRS bound is (Finite JRS adiabatic projector bound).
Proof
Put . Direct multiplication gives , so its eigenvalues are . The ground-to-excited gap is therefore , whose minimum is at and whose endpoint values are . The ground band is uniformly isolated and has rank one.
Differentiating gives and . Since , for every .
Substituting the endpoint values and derivatives from steps 1.1–1.2 into [F2] gives endpoint contribution . For the integral, with , using the antiderivative . Hence .
The JRS conclusion consequently bounds the projector deviation by and the transition probability out of the ground band by its square. For example, any makes the projector deviation at most .
Gap closing invalidates a uniform adiabatic bound
Statement
The path has a closing gap and its exact evolution from the initial ground state ends orthogonal to the final ground state. Thus regularity alone does not imply ground-state following or satisfy the uniform-gap hypothesis of the finite JRS theorem.
Facts & Assumptions
Given: The finite path and the uniform positive-gap hypothesis of Finite adiabatic path model and Finite JRS adiabatic projector bound.
The eigenvalues of a finite Hermitian matrix determine its ground state and gap (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely).
Proof
The path is linear in , hence twice continuously differentiable. Since , its eigenvalues are and ; the gap is , which vanishes at . Therefore no positive uniform full gap exists.
At , has unique ground vector ; at , has unique ground vector . The Hamiltonians commute for all times and are diagonal, so the solution of maps to a scalar phase times . Its final overlap with the final ground vector is zero, and its transition probability out of the final ground space is exactly for every .
The path satisfies the smoothness assumption but violates the strictly positive uniform-gap hypothesis in Finite JRS adiabatic projector bound. Step 1.2 shows directly that the desired ground-state-following conclusion can fail completely when that hypothesis is removed.
Two-gate padded history state
Example
Take the algebraic one-qubit macro-gate circuit , and tolerance . Applying the propagation formula at this macro-step level gives , , and . Write its legal clocks as . This is an algebraic illustration of the propagation formula, rather than a literal fixed-alphabet input to the uniform-circuit construction: expanding and changes the gate count and padding. The normalized history state is
Facts & Assumptions
Given: The unary-clock propagation formula and padded circuit conventions from Five-local history-state adiabatic path and History state and padded output.
Each propagation term couples only its two adjacent legal clocks and its kernel condition on their data amplitudes is (History state and padded output).
Dirac kets denote the corresponding computational basis vectors (Dirac Notation Conversion).
Verification
At the algebraic macro-step level, the padding count is , so . The prefix states are , , and . Since are identities, all later prefix states remain . Substitution in the history-state formula of [F1] gives the displayed normalized vector.
For , the endpoint patterns are on clock bits ; for , the internal patterns are on bits ; for , the endpoint patterns are on bits . On every adjacent pair , the data amplitudes in step 1.1 satisfy : the first two transitions apply and , and the last four apply .
By [F1], each restricted to its pattern pair has quadratic form . Step 2.1 makes this zero for each ; all other legal clock amplitudes are outside that term's two-pattern support. Thus every propagation term annihilates , and the sum does as well.
Sources
- Sabine Jansen, Mary-Beth Ruskai, and Ruedi Seiler, Bounds for the adiabatic approximation with applications to quantum computation
- Andrew M. Childs, Lecture Notes on Quantum Algorithms
- Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, and Oded Regev, Adiabatic Computation is Equivalent to Standard Quantum Computation