Related papers: A Constructive Cayley Representation of Orthogonal…
Darboux developed an ingenious algebraic mechanism to construct infinite chains of ''integrable'' second-order differential equations as well as their solutions. After a surprisingly long time, Darboux's results were rediscovered and…
During the noisy intermediate-scale quantum (NISQ) era, it is important to optimize the quantum circuits in circuit depth and gate count, especially entanglement gates, including the CNOT gate. Among all the unitary operators, diagonal…
For standard algorithms verifying positive definiteness of a matrix $A\in\mathbb{M}_n(\mathbb{R})$ based on Sylvester's criterion, the computationally pessimistic case is this when $A$ is positive definite. We present two algorithms…
Matrix completion is the problem of recovering a low rank matrix by observing a small fraction of its entries. A series of recent works [KOM12,JNS13,HW14] have proposed fast non-convex optimization based iterative algorithms to solve this…
There have been several algorithms designed to optimise matrix multiplication. From schoolbook method with complexity $O(n^3)$ to advanced tensor-based tools with time complexity $O(n^{2.3728639})$ (lowest possible bound achieved), a lot of…
The Schur transform is a unitary operator that block diagonalizes the action of the symmetric and unitary groups on an $n$ fold tensor product $V^{\otimes n}$ of a vector space $V$ of dimension $d$. Bacon, Chuang and Harrow \cite{BCH07}…
In this article the hypercomplex orthogonal (homogenous) algebra definition is made. It is shown that 1. the hypercomplex orthogonal algebra is the metric hypercomplex group alternative-elastic algebra for n mod 8 = 0 (the non-alternative…
This paper presents a quantum algorithm for efficiently computing partial sums and specific weighted partial sums of quantum state amplitudes. Computation of partial sums has important applications, including numerical integration,…
This paper uses matrix transformations to provide the Autoone-Takagi decomposition of dual complex symmetric matrices and extends it to dual quaternion $\eta$-Hermitian matrices. The LU decomposition of dual matrices is given using the…
A new, recursive method of calculating matrix elements of polynomial hamiltonians is proposed. It is particularly suitable for the recent algebraic studies of the supersymmetric Yang-Mills quantum mechanics in any dimensions. For the D=2…
The spatially discretized magnetic vector potential formulation of magnetoquasistatic field problems is transformed from an infinitely stiff differential algebraic equation system into a finitely stiff ordinary differential equation (ODE)…
This work presents a novel approach for the optimization of dynamic systems on finite-dimensional Lie groups. We rephrase dynamic systems as so-called neural ordinary differential equations (neural ODEs), and formulate the optimization…
We present an algorithm to solve the Simultaneous Unitary Similarity(S.U.S) problem which is to check if there exists a Similarity transformation determined by a Unitary $U$ s.t $UA_lU^*=B_l$, $l \in \{1,...,p\}$, where $A_l$ and $B_l$ are…
The ability to decompose a signal in an orthonormal basis (a set of orthogonal components, each normalized to have unit length) using a fast numerical procedure rests at the heart of many signal processing methods and applications. The…
In this paper we develop algorithms for orthogonal similarity transformations of skew-symmetric matrices to simpler forms. The first algorithm is similar to the algorithm for the block antitriangular factorization of symmetric matrices, but…
Algorithms for numerical tasks in finite precision simultaneously seek to minimize the number of floating point operations performed, and also the number of bits of precision required by each floating point operation. This paper presents an…
Let $D$ be an oriented link diagram with the set of regions $\operatorname{r}_{D}$. We define a symmetric map (or matrix) $\operatorname{\tau}_{D}\colon\operatorname{r}_{D}\times \operatorname{r}_{D} \to \mathbb{Z}[x]$ that gives rise to an…
In general dimension, there is no known total polynomial algorithm for either convex hull or vertex enumeration, i.e. an algorithm whose complexity depends polynomially on the input and output sizes. It is thus important to identify…
We describe an efficient quantum algorithm for the quantum Schur transform. The Schur transform is an operation on a quantum computer that maps the standard computational basis to a basis composed of irreducible representations of the…
We show that, for SU(2) generators of arbitrary dimension $D$, there exist identities that express the completely symmetric product of $D$ matrices in terms of completely symmetric products of fewer number of matrices. We also indicate why…