Related papers: Note on the Khaneja Glaser Decomposition

The canonical polyadic decomposition (CPD) is a fundamental tensor decomposition which expresses a tensor as a sum of rank one tensors. In stark contrast to the matrix case, with light assumptions, the CPD of a low rank tensor is…

We study a three dimensional non-commutative space emerging in the context of three dimensional Euclidean quantum gravity. Our starting point is the assumption that the isometry group is deformed to the Drinfeld double D(SU(2)). We…

We study a class of integrable non-linear differential equations related to the A.III-type symmetric spaces. These spaces are realized as factor groups of the form SU(N)/S(U(N-k) x U(k)). We use the Cartan involution corresponding to this…

This paper presents no new results; its goals are purely pedagogical. A special case of the Cartan Decomposition has found much utility in the field of quantum computing, especially in its sub-field of quantum compiling. This special case…

A general scheme is presented to decompose a $d$-by-$d$ unitary matrix as the product of two-level unitary matrices with additional structure and prescribed determinants. In particular, the decomposition can be done by using two-level…

By using gauge transformations, we manage to obtain new solutions of (2+1)-dimensional Kadomtsev-Petviashvili(KP), Kaup-Kuperschmidt(KK) and Sawada-Kotera(SK) equations from non-zero seeds. For each of the preceding equations, a Galilean…

Unitary decomposition is a widely used method to map quantum algorithms to an arbitrary set of quantum gates. Efficient implementation of this decomposition allows for translation of bigger unitary gates into elementary quantum operations,…

We prove a universal substitution formula that compares generating series of Euler characteristics of Nakajima quiver varieties associated with affine ADE diagrams at generic and at certain nongeneric stability conditions via a study of…

We consider a generic elementary gate sequence which is needed to implement a general quantum gate acting on n qubits -- a unitary transformation with 4^n degrees of freedom. For synthesizing the gate sequence, a method based on the…

Let $G$ be a split (minimal) Kac-Moody group over $\mathbb{R}$ or $\mathbb{C}$ with maximal torus $T$, and let $\theta$ be a Cartan-Chevalley involution of $G$, twisted by complex conjugation, and satisfying that $\theta(T)=T$. Furthermore,…

Decomposing an algebraic variety into irreducible or equidimensional components is a fundamental task in classical algebraic geometry and has various applications in modern geometry engineering. Several researchers studied the problem and…

We introduce a new scalable variational Gaussian process approximation which provides a high fidelity approximation while retaining general applicability. We propose the harmonic kernel decomposition (HKD), which uses Fourier series to…

By carrying out a rational transformation on the base curve $\mathbb{CP}^1$ of the Seiberg-Witten curve for $\mathcal{N}=2$ supersymmetric pure $\mathrm{SU}(2)$-gauge theory, we obtain a family of Jacobian elliptic K3 surfaces of Picard…

The symmetries described by Pin groups are the result of combining a finite number of discrete reflections in (hyper)planes. The current work shows how an analysis using geometric algebra provides a picture complementary to that of the…

Spectral graph convolutional network (SGCN) is a kind of graph neural networks (GNN) based on graph signal filters, and has shown compelling expressivity for modeling graph-structured data. Most SGCNs adopt polynomial filters and learn the…

All quantum gates with one and two qubits may be described by elements of $Spin$ groups due to isomorphisms $Spin(3) \simeq SU(2)$ and $Spin(6) \simeq SU(4)$. However, the group of $n$-qubit gates $SU(2^n)$ for $n > 2$ has bigger dimension…

A new algorithm to compute the restricted singular value decomposition of dense matrices is presented. Like Zha's method \cite{Zha92}, the new algorithm uses an implicit Kogbetliantz iteration, but with four major innovations. The first…

We show the applicability of the Cartan decomposition of Lie algebras to quantum circuits. This approach can be used to synthesize circuits that can efficiently implement any desired unitary operation. Our method finds explicit quantum…

We prove a combinatorial rule for a complete decomposition, in terms of Langlands parameters, for representations of p-adic $GL_n$ that appear as parabolic induction from a large family (ladder representations). Our rule obviates the need…

Let $\frak g$ be the finite dimensional simple Lie algebra associated to an indecomposable and symmetrizable generalized Cartan matrix $C=(a_{ij})_{n\times n}$ of finite type and let $\frak d$ be a finite dimensional Lie algebra related to…