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.
Continuous-Time Quantum Walks — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Boolean Circuits and Nonuniform Complexity
- 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 Coordinate and Path Transport
- Complex Differentiability and the Cauchy–Riemann Equations
- 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
- 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
- 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
- Partitions of Unity and Paracompactness
- 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
- Separation Axioms: the Hierarchy
- 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 Cantor Set, Baire Category, and Measure Zero in ℝ
- 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 Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- 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 calculate the one- and two-dimensional hypercube transfers, the complete-graph search matrix and its spectral gap, and two failures of generator-convention invariance. Reversing a Laplacian sign can change the same-time measurement law; normalizing adjacency can rescale the time required to reach a specified ray. The page is a logical leaf.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Generator convention matters
Statement refuted
For every finite undirected graph, every initial unit pure state, and every time, replacing by leaves the computational-basis measurement law unchanged. For every finite graph with positive degrees, replacing by also leaves the minimum nonnegative time needed to reach any specified walk output ray unchanged.
Facts & Assumptions
Given: The graph-generator conventions and finite matrix evolution in the preceding definitions. Produce finite counterexamples to both claims.
Graph adjacency and Laplacian generator conventions: , , and when every degree is positive, .
Finite Hermitian matrix dynamics: for self-adjoint , .
, and the complex exponential extends the real exponential: for complex .
, , and : and for real .
Sine and cosine defined by their real power series: sine and cosine are given by their real power series.
The alternating series test: if is nonincreasing with then converges, the sum lies between any two consecutive partial sums, and the error after terms is at most : for decreasing nonnegative terms tending to zero, the alternating sum lies between consecutive partial sums.
Quarter-turn values and shifts by pi/2 and pi: , , and shifts by negate sine and cosine.
The zero sets of sine and cosine and the least positive common period 2 pi: exactly when for an integer .
Finite registers and their ordered computational bases and The computational basis is orthonormal: the ordered basis of is the standard orthonormal basis.
The measurement law for a finite continuous-time walk: for self-adjoint and unit , measuring in an orthonormal basis assigns each basis line its squared-coordinate probability.
Counterexample
For the two-vertex graph with one edge, in basis the adjacency swaps the basis vectors, and , and . Thus , , and . Put , , and . Direct inner-product calculations using [F9] give and ; direct application of gives and . Thus is an orthonormal eigenbasis.
For the three-vertex path with ordered vertices , the degrees are and , , . Thus All degrees are positive, so [F1] defines . Put , , and . By direct coordinate inner products in the standard orthonormal basis [F9], is an orthonormal basis; direct multiplication gives , , and . The vectors , , and also have unit norm and pairwise zero inner products. Direct multiplication gives , , and . Hence the four generator spectra are , , , and . This directly compares adjacency, normalized adjacency, and both Laplacian signs on the irregular graph.
The spectral definition [F2] gives eigenphases for on and for . By [F3]–[F4], these are equivalently and : on and , respectively, the coefficients are and . The coordinate after is ; after it is . Thus [F10] gives and .
Put , which is unit by step 1.2, and fix the target ray , since by [F4], [F7]. For any real , and by [F1]–[F2]. Since the coefficient is the same nonzero number in both target and output, equality of rays forces the scalar multiple to be and is equivalent to equality of the displayed relative phases.
At , the cosine-series magnitudes and sine-series magnitudes decrease to zero: each next factorial multiplies the denominator by a factor at least , so both sequences tend to zero. By [F5]–[F6], the cosine sum lies above its two-term partial sum , and the sine sum lies above . Therefore . The two Laplacian signs give different same-time measurement laws.
If , then . By [F3]–[F4], this forces and ; [F8] puts the angle at , and [F7] shows must be even. Thus . For this is at least ; for it is at most . Hence its least nonnegative value is . The same argument for gives , whose least nonnegative value is . For the second family, gives , every gives a larger time, and every gives a negative time. Thus the least nonnegative time is . These runtimes differ because .
Small hypercube transfer
Example
For the one-dimensional Boolean hypercube, . For the two-dimensional Boolean hypercube in the ordered basis , Compute the exact evolution from at time and verify the measured opposite corner.
Facts & Assumptions
Given: The edge adjacency , the ordered tensor register, and the finite-matrix evolution .
Hypercube continuous-time state transfer: and the input is .
Finite registers and their ordered computational bases: the qubit basis is the ordered standard basis and the tensor-register basis is ordered lexicographically.
Ordered tensor registers, their inner product, and wire permutations: specified factor bases give their lexicographically ordered product basis; the product inner product is the product of the factor inner products, and the empty tensor is .
The computational basis is orthonormal: the listed register basis is orthonormal.
Finite Hermitian matrix dynamics: acts on a eigenvector of by .
, , and : for real .
The measurement law for a finite continuous-time walk: basis measurement probability is the squared modulus of the corresponding output coordinate.
Exact state transfer on the Boolean hypercube: for each , and the measured output is with probability one.
Tensor products of finitely many linear maps: tensor maps act factorwise on elementary tensors, including the empty tensor map as the identity.
Verification
Put and . By [F2]–[F4] they form an orthonormal basis, and direct multiplication gives and . By [F5], acts on these vectors by and . On , acts by ; on it acts by , using [F6]–[F7]. Thus the two maps agree on a basis. At , [F8] yields , so .
The displayed matrix for follows by applying to each of the four basis vectors in [F2] using the tensor-map action [F11]. The four vectors , , , and form a basis by [F2]–[F3]. On with , has eigenvalue ; [F5]–[F6] give evolution coefficient , which is exactly the coefficient of by [F11]. The operators therefore agree on a basis, and step 1.1 gives . Hence .
In the case, step 1.1 gives outcome amplitude ; in the case, step 2.1 gives outcome amplitude . Both have squared modulus , so [F9] gives the opposite-corner outcome with probability one in each case. These calculations are the instances of [F10].
Complete-graph search matrix and gap
Example
For the complete graph search instance with any finite , let be the marked vertex and let be the uniform vector on the unmarked vertices. Compute the invariant generator matrix in the ordered basis and its eigenvalue gap. Include the boundary case . Also verify the supplied uniform preparation for and against the one- and two-qubit Hadamard circuits.
Facts & Assumptions
Given: , the encoded complete-graph adjacency, marked projector, and Hamiltonian of the algorithm.
Complete-graph continuous-time search: on the active label basis, , , and .
Graph adjacency and Laplacian generator conventions: symmetric graph adjacency is Hermitian and the ordered vertex basis is fixed.
Dirac Notation Conversion: acts by .
Finite registers and their ordered computational bases and The computational basis is orthonormal: distinct encoded labels are orthonormal basis vectors.
Exact and approximate success of complete-graph continuous-time search: with the supplied uniform preparation, exact evolution under at gives marked-label probability exactly .
Hadamard preparation of a uniform binary state: for , the standard-binary uniform state is , with Hadamard gates when primitive.
Verification
The unmarked encoded basis vectors are pairwise orthonormal by [F4], so is unit and orthogonal to the unit vector . The uniform vector is , whose squared coefficient norms sum to .
By [F1], . For , each summand contains once, so its coefficient is ; for each unmarked , the sum contains once for each , hence times. Thus .
The two vectors span an invariant subspace for by step 2.1. By [F3], and , so also preserves this span. The symmetric adjacency is Hermitian by [F2], and the generator matrix is
Put . Direct multiplication gives , and . Equivalently, its characteristic polynomial is , so its eigenvalues are . Therefore the eigenvalues of are , and their gap is .
At , is the single unmarked basis vector and the formula in step 3.1 becomes . The shifted matrix has eigenvalues , so the gap is ; all normalizations and denominators used above remain valid.
For the uniform input in step 1.1, [F5] gives marked-label probability after exact evolution at . The invariant matrix and its gap were derived locally in steps 3.1–4.1.
Specialize to the standard binary encoding for and . For , the preparation is , which is the required uniform state with one Hadamard gate. For , applying the second factor gives , the required uniform state with two Hadamard gates. These are the cases of [F6]; no preparation or gate cost is inferred from the search matrix.