相关论文: A Symbolic Algorithm for Computation of Non-degene…
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…
We provide a generalized definition for the quantized Clifford algebra introduced by Hayashi using another parameter $k$ that we call the twist. For a field of characteristic not equal to $2$, we provide a basis for our quantized Clifford…
Recent results by Harrow et. al. and by Ta-Shma, suggest that quantum computers may have an exponential advantage in solving a wealth of linear algebraic problems, over classical algorithms. Building on the quantum intuition of these…
Existing computer algebra packages do not fully support quantum mechanics calculations in Dirac's notation. I present the foundation for building such support: a mathematical system for the symbolic manipulation of expressions used in the…
A constructive method for decomposing finite dimensional representations of semisimple real Lie algebras is developed. The method is illustrated by an example. We also discuss an implementation of the algorithm in the language of the…
In this paper we combine methods from projective geometry, Klein's model, and Clifford algebra. We develop a Clifford algebra whose Pin group is a double cover of the group of regular projective transformations. The Clifford algebra we use…
In this paper, the author present a reliable symbolic computational algorithm for inverting a general comrade matrix by using parallel computing along with recursion. The computational cost of our algorithm is O(n^2). The algorithm is…
A polynomial transform is the multiplication of an input vector $x\in\C^n$ by a matrix $\PT_{b,\alpha}\in\C^{n\times n},$ whose $(k,\ell)$-th element is defined as $p_\ell(\alpha_k)$ for polynomials $p_\ell(x)\in\C[x]$ from a list…
Gradient descent method, as one of the major methods in numerical optimization, is the key ingredient in many machine learning algorithms. As one of the most fundamental way to solve the optimization problems, it promises the function value…
In this work, we develop a graphical calculus for multi-qudit computations with generalized Clifford algebras, building off the algebraic framework developed in our prior work. We build our graphical calculus out of a fixed set of graphical…
The overlap Dirac operator in lattice QCD requires the computation of the sign function of a matrix. While this matrix is usually Hermitian, it becomes non-Hermitian in the presence of a quark chemical potential. We show how the action of…
We develop an algorithm for computing generalized Seifert matrices for colored links given as closures of colored braids. The algorithm has been implemented by the second author as a computer program called Clasper. Clasper also outputs the…
We present a quantum compilation algorithm that maps Clifford encoders, encoding maps for stabilizer quantum codes, to a unique graphical representation in the ZX calculus. Specifically, we develop a canonical form in the ZX calculus and…
In this paper we provide, first, a general symbolic algorithm for computing the symmetries of a given rational surface, based on the classical differential invariants of surfaces, i.e. Gauss curvature and mean curvature. In practice, the…
We present a series of algorithms for computing geometric and representation-theoretic invariants of Calogero-Moser spaces and rational Cherednik algebras associated to complex reflection groups. Especially, we are concerned with…
In this paper, we propose an incremental algorithm for computing cylindrical algebraic decompositions. The algorithm consists of two parts: computing a complex cylindrical tree and refining this complex tree into a cylindrical tree in real…
Previous work has made use of a parameterized plane curve polynomial representation for mathematical handwriting, with the polynomials represented in a Legendre or Legendre-Sobolev graded basis. This provides a compact geometric…
Representations of Spin groups and Clifford algebras derived from the structure of qubit trees are introduced in this work. For ternary trees the construction is more general and reduction to binary trees is formally defined by deletion of…
This paper describes a formalization of discrete real closed fields in the Coq proof assistant. This abstract structure captures for instance the theory of real algebraic numbers, a decidable subset of real numbers with good algorithmic…
Building on the work [18], where some standard basis for the queer $q$-Schur superalgebra $\mathcal{Q}_q(n,r;R)$ is defined by a labelling set of matrices and their associated double coset representatives, we investigate the matrix…