Clifford algebras, random graphs, and quantum random variables

MaRDI QIDQ3400673zbMATH OpenFDO

Authors R. Schott, G. S. Staples

Publication date 5 February 2010

zbMATH Keywords

graphsquantum probabilityHamiltonian cyclesquantum computingrandom graphsClifford algebrageometric algebrafermionsself-avoiding walks

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Random matrices (probabilistic aspects) (60B20) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Sums of independent random variables; random walks (60G50) Noncommutative dynamical systems (46L55) Selfadjoint operator theory in quantum theory, including spectral analysis (81Q10) Quantum state spaces, operational and probabilistic concepts (81P16) Clifford algebras, spinors (15A66)

Recommendations

• Reductions in computational complexity using Clifford algebras
• Computational complexity reductions using Clifford algebras
• Norms and generating functions in Clifford algebras
• Nilpotent adjacency matrices, random graphs and quantum random variables
• Spinorial formulations of graph problems

Cited in

(7)

• Graph-theoretic approach to stochastic integrals with Clifford algebras
• Spinorial formulations of graph problems
• Nilpotent adjacency matrices, random graphs and quantum random variables
• A new adjacency matrix for finite graphs
• Constructing Clifford algebras for windmill and Dutch windmill graphs; a new proof of the friendship theorem
• Reductions in computational complexity using Clifford algebras
• Computational complexity reductions using Clifford algebras

This page was built for publication: Clifford algebras, random graphs, and quantum random variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3400673)