Alphabeta Math
Pipeline-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.

Continuous-Time Quantum Walks — Examples

1 · Prerequisites

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

CounterexampleConstruction: AI-generatedVerification: AI-generatedOpen item page →

Generator convention matters

Statement refuted

For every finite undirected graph, every initial unit pure state, and every time, replacing D−A by A−D leaves the computational-basis measurement law unchanged. For every finite graph with positive degrees, replacing A by D−1/2AD−1/2 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.

[F1]

Graph adjacency and Laplacian generator conventions: L+=D−A, L−=A−D=−L+, and when every degree is positive, Anorm=D−1/2AD−1/2.

[F2]

Finite Hermitian matrix dynamics: for self-adjoint H, UH(t)=∑λe−itλPλ.

[F4]
[F5]

Sine and cosine defined by their real power series: sine and cosine are given by their real power series.

[F7]

Quarter-turn values and shifts by pi/2 and pi: cos⁡π=−1, sin⁡π=0, and shifts by π negate sine and cosine.

[F8]

The zero sets of sine and cosine and the least positive common period 2 pi: sin⁡x=0 exactly when x=kπ for an integer k.

[F9]

Finite registers and their ordered computational bases and The computational basis is orthonormal: the ordered basis of Cd is the standard orthonormal basis.

[F10]

The measurement law for a finite continuous-time walk: for self-adjoint H and unit ψ, measuring UH(t)ψ in an orthonormal basis assigns each basis line its squared-coordinate probability.

Counterexample

1.1givenF1F9algebra

For the two-vertex graph with one edge, in basis (e0,e1) the adjacency swaps the basis vectors, Ae0=e1 and Ae1=e0, and D=I. Thus L+=I−A, L−=−L+, and Anorm=A. Put u+=(e0+e1)/2, u−=(e0−e1)/2, and ψ=(e0+ie1)/2. Direct inner-product calculations using [F9] give ∥u+∥=∥u−∥=∥ψ∥=1 and ⟨u+,u−⟩=0; direct application of A gives Au+=u+ and Au−=−u−. Thus (u+,u−) is an orthonormal eigenbasis.

1.2givenF1F9algebra

For the three-vertex path with ordered vertices 0,1,2, the degrees are (1,2,1) and Ae0=e1, Ae1=e0+e2, Ae2=e1. Thus A=(010101010),D=(100020001),Anorm=D−1/2AD−1/2=A/2,L+=D−A,L−=A−D=−L+. All degrees are positive, so [F1] defines Anorm. Put u0=(e0−e2)/2, u+=(e0+2e1+e2)/2, and u−=(e0−2e1+e2)/2. By direct coordinate inner products in the standard orthonormal basis [F9], (u0,u+,u−) is an orthonormal basis; direct multiplication gives Au0=0, Au+=2u+, and Au−=−2u−. The vectors c=(e0+e1+e2)/3, u0, and v=(e0−2e1+e2)/6 also have unit norm and pairwise zero inner products. Direct multiplication gives L+c=0, L+u0=u0, and L+v=3v. Hence the four generator spectra are σ(A)={0,±2}, σ(Anorm)={0,±1}, σ(L+)={0,1,3}, and σ(L−)={0,−1,−3}. This directly compares adjacency, normalized adjacency, and both Laplacian signs on the irregular graph.

2.1givenF2F3F4F9F10step 1.1algebra

The spectral definition [F2] gives eigenphases 1,e−2i for UL+(1) on (u+,u−) and 1,e2i for UL−(1). By [F3]–[F4], these are equivalently e−i(cos⁡1 I+isin⁡1 A) and ei(cos⁡1 I−isin⁡1 A): on u+ and u−, respectively, the coefficients are 1,e−2i and 1,e2i. The e1 coordinate after UL+(1) is e−ii(cos⁡1+sin⁡1)/2; after UL−(1) it is eii(cos⁡1−sin⁡1)/2. Thus [F10] gives p+(1)=(cos⁡1+sin⁡1)2/2 and p−(1)=(cos⁡1−sin⁡1)2/2.

2.2givenF1F2F3F4F7step 1.2algebra

Put ξ=(u0+u+)/2, which is unit by step 1.2, and fix the target ray [ζ]:=[UA(π/2)ξ]=[(u0−u+)/2], since e−iπ=−1 by [F4], [F7]. For any real t, UA(t)ξ=(u0+e−i2tu+)/2 and UAnorm(t)ξ=(u0+e−itu+)/2 by [F1]–[F2]. Since the u0 coefficient is the same nonzero number in both target and output, equality of rays forces the scalar multiple to be 1 and is equivalent to equality of the displayed relative phases.

3.1F5F6step 2.1algebra

At 1, the cosine-series magnitudes bk=1/(2k)! and sine-series magnitudes ck=1/(2k+1)! decrease to zero: each next factorial multiplies the denominator by a factor at least 2, so both sequences tend to zero. By [F5]–[F6], the cosine sum lies above its two-term partial sum 1−1/2=1/2, and the sine sum lies above 1−1/6=5/6. Therefore p+(1)−p−(1)=2sin⁡1cos⁡1≥5/6>0. The two Laplacian signs give different same-time measurement laws.

4.1F3F4F7F8step 2.2algebra∎

If [UA(t)ξ]=[ζ], then e−i(2t−π)=1. By [F3]–[F4], this forces sin⁡(2t−π)=0 and cos⁡(2t−π)=1; [F8] puts the angle at kπ, and [F7] shows k must be even. Thus t=π/2+k2π. For k≥0 this is at least π/2; for k≤−1 it is at most π/2−2π<0. Hence its least nonnegative value is π/2. The same argument for Anorm gives t=π+2kπ, whose least nonnegative value is π. For the second family, k=0 gives t=π, every k≥1 gives a larger time, and every k≤−1 gives a negative time. Thus the least nonnegative time is π. These runtimes differ because 2>1.

ExampleConstruction: Literature-sourcedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

Small hypercube transfer

Example

For the one-dimensional Boolean hypercube, A1=X. For the two-dimensional Boolean hypercube in the ordered basis (∣00⟩,∣01⟩,∣10⟩,∣11⟩), A2=X⊗I+I⊗X=(0110100110010110). Compute the exact evolution from ∣0n⟩ at time π/2 and verify the measured opposite corner.

Facts & Assumptions

Given: The edge adjacency X, the ordered tensor register, and the finite-matrix evolution UH(t).

[F1]

Hypercube continuous-time state transfer: An=∑j<nXj and the input is e0n.

[F2]

Finite registers and their ordered computational bases: the qubit basis is the ordered standard basis (e0,e1) and the tensor-register basis is ordered lexicographically.

[F3]

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 C.

[F4]

The computational basis is orthonormal: the listed register basis is orthonormal.

[F5]

Finite Hermitian matrix dynamics: UH(t) acts on a λ eigenvector of H by e−itλ.

[F8]

Quarter-turn values and shifts by pi/2 and pi: cos⁡(π/2)=0 and sin⁡(π/2)=1.

[F9]

The measurement law for a finite continuous-time walk: basis measurement probability is the squared modulus of the corresponding output coordinate.

[F10]

Exact state transfer on the Boolean hypercube: for each n≥0, UAn(π/2)e0n=(−i)ne1n and the measured output is 1n with probability one.

[F11]

Tensor products of finitely many linear maps: tensor maps act factorwise on elementary tensors, including the empty tensor map as the identity.

Verification

technique · direct
1.1givenF2F3F4F5F6F7F8algebra

Put f+=(e0+e1)/2 and f−=(e0−e1)/2. By [F2]–[F4] they form an orthonormal basis, and direct multiplication gives Xf+=f+ and Xf−=−f−. By [F5], UX(t) acts on these vectors by e−it and eit. On f+, cos⁡t I−isin⁡t X acts by cos⁡t−isin⁡t=e−it; on f− it acts by cos⁡t+isin⁡t=eit, using [F6]–[F7]. Thus the two maps agree on a basis. At t=π/2, [F8] yields UX(π/2)=−iX, so UX(π/2)e0=−ie1.

2.1F1F2F3F5F6F11step 1.1algebra

The displayed matrix for A2 follows by applying X⊗I+I⊗X to each of the four basis vectors in [F2] using the tensor-map action [F11]. The four vectors f+⊗f+, f+⊗f−, f−⊗f+, and f−⊗f− form a basis by [F2]–[F3]. On fϵ⊗fη with ϵ,η∈{1,−1}, A2 has eigenvalue ϵ+η; [F5]–[F6] give evolution coefficient e−iπ(ϵ+η)/2=e−iπϵ/2e−iπη/2, which is exactly the coefficient of UX(π/2)⊗UX(π/2) by [F11]. The operators therefore agree on a basis, and step 1.1 gives UA2(π/2)=−X⊗X. Hence UA2(π/2)e00=−e11.

3.1step 1.1step 2.1F9F10algebra∎

In the n=1 case, step 1.1 gives outcome 1 amplitude −i; in the n=2 case, step 2.1 gives outcome 11 amplitude −1. Both have squared modulus 1, so [F9] gives the opposite-corner outcome with probability one in each case. These calculations are the n=1,2 instances of [F10].

ExampleConstruction: Literature-sourcedVerification: AI-generatedOpen item page →

Complete-graph search matrix and gap

Example

For the complete graph search instance with any finite N≥2, let ∣w⟩ be the marked vertex and let ∣r⟩ be the uniform vector on the N−1 unmarked vertices. Compute the invariant 2×2 generator matrix in the ordered basis (∣w⟩,∣r⟩) and its eigenvalue gap. Include the boundary case N=2. Also verify the supplied uniform preparation for N=2 and N=4 against the one- and two-qubit Hadamard circuits.

Facts & Assumptions

Given: N≥2, the encoded complete-graph adjacency, marked projector, and Hamiltonian H=−A/N−Pw of the algorithm.

[F1]

Complete-graph continuous-time search: on the active label basis, A∣x⟩=∑y≠x∣y⟩, Pw=∣w⟩⟨w∣, and H=−A/N−Pw.

[F2]

Graph adjacency and Laplacian generator conventions: symmetric graph adjacency is Hermitian and the ordered vertex basis is fixed.

[F3]

Dirac Notation Conversion: ∣x⟩⟨y∣ acts by z↦⟨z,y⟩x.

[F4]
[F5]

Exact and approximate success of complete-graph continuous-time search: with the supplied uniform preparation, exact evolution under H=−A/N−Pw at t=πN/2 gives marked-label probability exactly 1.

[F6]

Hadamard preparation of a uniform binary state: for N=2n, the standard-binary uniform state is H⊗n∣0n⟩, with n Hadamard gates when primitive.

Verification

technique · direct
1.1givenF4choosealgebra

The N−1 unmarked encoded basis vectors are pairwise orthonormal by [F4], so ∣r⟩=(N−1)−1/2∑x≠w∣x⟩ is unit and orthogonal to the unit vector ∣w⟩. The uniform vector is ∣s⟩=N−1/2∣w⟩+(N−1)/N∣r⟩, whose squared coefficient norms sum to 1.

2.1givenF1step 1.1algebra

By [F1], A∣w⟩=∑x≠w∣x⟩=N−1∣r⟩. For ∣r⟩, each summand A∣x⟩ contains ∣w⟩ once, so its ∣w⟩ coefficient is N−1; for each unmarked y, the sum contains ∣y⟩ once for each x≠y,w, hence N−2 times. Thus A∣r⟩=N−1∣w⟩+(N−2)∣r⟩.

3.1F1F2F3step 2.1algebra

The two vectors span an invariant subspace for A by step 2.1. By [F3], Pw∣w⟩=∣w⟩ and Pw∣r⟩=0, so Pw also preserves this span. The symmetric adjacency is Hermitian by [F2], and the generator matrix is H=(−1−N−1/N−N−1/N−(N−2)/N).

4.1step 3.1algebra

Put K=H+(N−1)I/N. Direct multiplication gives K2=I/N, and tr⁡K=0. Equivalently, its characteristic polynomial is λ2−1/N, so its eigenvalues are ±1/N. Therefore the eigenvalues of H are −(N−1)/N±1/N, and their gap is 2/N.

5.1step 1.1step 3.1step 4.1algebra

At N=2, ∣r⟩ is the single unmarked basis vector and the formula in step 3.1 becomes H=(−1−1/2−1/20). The shifted matrix has eigenvalues ±1/2, so the gap is 2; all normalizations and denominators used above remain valid.

5.2F5step 1.1step 3.1step 4.1

For the uniform input ∣s⟩ in step 1.1, [F5] gives marked-label probability 1 after exact evolution at t=πN/2. The invariant matrix and its gap were derived locally in steps 3.1–4.1.

6.1F1F2F6algebra∎

Specialize to the standard binary encoding for N=2 and N=4. For N=2, the preparation is H∣0⟩=(∣0⟩+∣1⟩)/2, which is the required uniform state with one Hadamard gate. For N=4, applying the second factor gives H⊗2∣00⟩=(∣00⟩+∣01⟩+∣10⟩+∣11⟩)/2, the required uniform state with two Hadamard gates. These are the n=1,2 cases of [F6]; no preparation or gate cost is inferred from the search matrix.

Sources