Related papers: On Computational Complexity of Clifford Algebra
Recently author suggested [quant-ph/0010071] an application of Clifford algebras for construction of a "compiler" for universal binary quantum computer together with later development [quant-ph/0012009] of the similar idea for a non-binary…
In this paper we further develop the method of quaternion typification of Clifford algebra elements suggested by the author in the previous papers. On the basis of new classification of Clifford algebra elements it is possible to find out…
Extended gamma matrix Clifford--Dirac and SO(1,9) algebras in the terms of $8 \times 8$ matrices have been considered. The 256-dimensional gamma matrix representation of Clifford algebra for 8-component Dirac equation is suggested. Two…
We give a graphical calculus for a categorification of a Clifford algebra and its Fock space representation via differential graded categories. The categorical action is motivated by the gluing action between the contact categories of…
We study the polyhedral properties of three problems of constructing an optimal complete bipartite subgraph (a biclique) in a bipartite graph. In the first problem we consider a balanced biclique with the same number of vertices in both…
We develop the method of averaging in Clifford (geometric) algebras suggested by the author in previous papers. We consider operators constructed using two different sets of anticommuting elements of real or complexified Clifford algebras.…
Real Clifford algebras for arbitrary number of space and time dimensions as well as their representations in terms of spinors are reviewed and discussed. The Clifford algebras are classified in terms of isomorphic matrix algebras of real,…
In this paper we present new formulas, which represent commutators and anticommutators of Clifford algebra elements as sums of elements of different ranks. Using these formulas we consider subalgebras of Lie algebras of pseudounitary…
Complex networks contain complete subgraphs such as nodes, edges, triangles, etc., referred to as simplices and cliques of different orders. Notably, cavities consisting of higher-order cliques play an important role in brain functions.…
We propose to represent both $n$--qubits and quantum gates acting on them as elements in the complex Clifford algebra defined on a complex vector space of dimension $2n.$ In this framework, the Dirac formalism can be realized in…
We investigate commutative analogues of Clifford algebras -- algebras whose generators square to $\pm1$ but commute, instead of anti-commuting as they do in Clifford algebras. We observe that commutativity allows for elegant results. We…
We consider the diffeological version of the Clifford algebra of a (diffeological) finite-dimensional vector space; we start by commenting on the notion of a diffeological algebra (which is the expected analogue of the usual one) and that…
A set of valuable universal similarity factorization equalities is established over complex Clifford algebras $\Cn.$ Through them matrix representations of complex Clifford algebras $\Cn$ can directly be derived, and their properties can…
This paper investigates some relationship between the algebraic connectivity and the clique number of graphs. We characterize all extremal graphs which have the maximum and minimum the algebraic connectivity among all graphs of order $n$…
We consider a subclass of tilings, the tilings obtained by cut and projection. Under somewhat standard assumptions, we show that the natural complexity function has polynomial growth. We compute its exponent \alpha in terms of the ranks of…
The structures of the ideals of Clifford algebras which can be both infinite dimensional and degenerate over the real numbers are investigated.
We present CLIPPER+, an algorithm for finding maximal cliques in unweighted graphs for outlier-robust global registration. The registration problem can be formulated as a graph and solved by finding its maximum clique. This formulation…
This article uses Clifford algebra of definite signature to derive octonions and the Lie exceptional algebra G2 from calibrations using Pin(7). This is simpler than the usual exterior algebra derivation and uncovers a subalgebra of Spin(7)…
Clique-width is one of the graph complexity measures leading to polynomial special-case algorithms for generally NP-complete problems, e.g. graph colourability. The best two currently known algorithms for verifying c-colourability of graphs…
In this note, we provide a unifying framework to investigate the computational complexity of classical spin models and give the full classification on spin models in terms of system dimensions, randomness, external magnetic fields and types…