Abstract.
The n-dimensional hypercube is a simple graph on 2n vertices labeled by binary strings, or words, of length n. Pairs of vertices are adjacent if and only if they differ in exactly one position as binary words; i.e., the Hamming distance between the words is one. A discrete-time random walk is easily defined on the hypercube by “flipping” a randomly selected digit from 0 to 1 or vice-versa at each time step. By associating the words as blades in a Clifford algebra of particular signature, combinatorial properties of the geometric product can be used to represent this random walk as a sequence within the algebra. A closed-form formula is revealed which yields probability distributions on the vertices of the hypercube at any time k ≥ 0 by a formal power series expansion of elements in the algebra. Furthermore, by inducing a walk on a larger Clifford algebra, probabilities of self-avoiding walks and expected first hitting times of specific vertices are recovered. Moreover, because the Clifford algebras used in the current work are canonically isomorphic to fermion algebras, everything appearing here can be rewritten using fermion creation/annihilation operators, making the discussion relevant to quantum mechanics and/or quantum computing.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Staples, G.S. Clifford-algebraic random walks on the hypercube. Adv. Appl. Clifford Algebras 15, 213–232 (2005). https://doi.org/10.1007/s00006-005-0014-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00006-005-0014-z