Quantum Stochastics and Information
CLIFFORD ALGEBRAS, RANDOM GRAPHS, AND QUANTUM RANDOM VARIABLES
René Schott, G. Stacey Staples
Abstract
For fixed n > 0, the space of finite graphs on n vertices is canonically associated with an abelian, nilpotent-generated subalgebra of the Clifford algebra which is canonically isomorphic to the 2n-particle fermion algebra. Using the generators of the subalgebra, an algebraic probability space of “Clifford adjacency matrices” associated with finite graphs is defined. Each Clifford adjacency matrix is a quantum random variable whose m th moment corresponds to the number of m-cycles in the graph G. Each matrix admits a canonical “quantum decomposition” into a sum of three algebraic random variables: a = a Δ + a ϒ + a Λ , where a Δ is classical while a ϒ and a Λ are quantum. Moreover, within the Clifford algebra context the NP problem of cycle enumeration is reduced to matrix multiplication, requiring no more than n 4 Clifford (geo-metric) multiplications within the algebra.