Related papers: On Computational Complexity of Clifford Algebra
We consider a variant of the clustering problem for a complete weighted graph. The aim is to partition the nodes into clusters maximizing the sum of the edge weights within the clusters. This problem is known as the clique partitioning…
Censor-Hillel et al. [PODC'15] recently showed how to efficiently implement centralized algebraic algorithms for matrix multiplication in the congested clique model, a model of distributed computing that has received increasing attention in…
In this article, we develop an algebraic framework of axioms which abstracts various high-level properties of multi-qudit representations of generalized Clifford algebras. We further construct an explicit model and prove that it satisfies…
The Cluster Deletion problem takes a graph $G$ as input and asks for a minimum size set of edges $X$ such that $G-X$ is the disjoint union of complete graphs. An equivalent formulation is the Clique Partition problem, which asks to find a…
In this paper, theory and construction of spinor representations of real Clifford algebras $\cl_{p,q}$ in minimal left ideals are reviewed. Connection with a general theory of semisimple rings is shown. The actual computations can be found…
The power of Clifford or, geometric, algebra lies in its ability to represent geometric operations in a concise and elegant manner. Clifford algebras provide the natural generalizations of complex, dual numbers and quaternions into…
We suggest Clifford algebra as a useful simplifying language for present quantum dynamics. Clifford algebras arise from representations of the permutation groups as they arise from representations of the rotation groups. Aggregates using…
The geometric calculus based on Clifford algebra is a very useful tool for geometry and physics. It describes a geometric structure which is much richer than the ordinary geometry of spacetime. A Clifford manifold (C-space) consists not…
Clifford gates are a winsome class of quantum operations combining mathematical elegance with physical significance. The Gottesman-Knill theorem asserts that Clifford computations can be classically efficiently simulated but this is true…
Finding the maximum clique is a known NP-Complete problem and it is also hard to approximate. This work proposes two efficient algorithms to obtain it. Nevertheless, the first one is able to fins the maximum for some special cases, while…
Clifford algebras are a natural generalization of the real numbers, the complex numbers, and the quaternions. So far, solely Clifford algebras of the form $Cl_{p,q}$ (i.e., algebras without nilpotent base vectors) have been studied in the…
While graphs and abstract data structures can be large and complex, practical instances are often regular or highly structured. If the instance has sufficient structure, we might hope to compress the object into a more succinct…
We formulate a Boolean algebra in the set of idempotents of Clifford algebra Cl($R^{n,n}$) and within this frame we examine different formulations of the Boolean Satisfiability Problem in Clifford algebra. Exploiting the isomorphism between…
In these lectures, we discuss some well-known facts about Clifford algebras: matrix representations, Cartan's periodicity of 8, double coverings of orthogonal groups by spin groups, Dirac equation in different formalisms, spinors in $n$…
We propose models of quantum neural networks through Clifford algebras, which are capable of capturing geometric features of systems and to produce entanglement. Due to their representations in terms of Pauli matrices, the Clifford algebras…
I apply the algebraic framework introduced in arXiv:1101.4542v3[math.MG] to Minkowski (pseudo-Euclidean) spaces in 2, 3, and 4 dimensions. The exposition follows the template established in arXiv:1307.2917[math.MG] for Euclidean spaces. The…
For certain problems involving vector fields, it is possible to find an associated imaginary field that, in conjunction with the first, forms a complex field for which the equation can be solved. This result is generalized to arbitrary…
In this paper we study a max-min $k$-partition problem on a weighted graph, that could model a robust $k$-coalition formation. We settle the computational complexity of this problem as complete for class $\Sigma_2^P$. This hardness holds…
Is there more to Dirac's gamma matrices than meets the eye? It turns out that gamma zero can be factorized into a product of three operators. This revelation facilitates the expansion of Dirac's space-time algebra to Clifford algebra…
We derive a set of Clifford-algebraic formulas for two major nonlinear conformal transformations of the physical quantities related to Maxwell's equations. The superiority of these formulas over their vector-tensorial counterparts are…