Related papers: Littlewood's algorithm and quaternion matrices
A highly anticipated use of quantum computers is the simulation of complex quantum systems including molecules and other many-body systems. One promising method involves directly applying a linear combination of unitaries (LCU) to…
In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore…
A novel method to obtain parametrizations of complex inverse orthogonal matrices is provided. These matrices are natural generalizations of complex Hadamard matrices which depend on non zero complex parameters. The method we use is via…
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…
The saturation theorem of [Knutson-Tao '99] concerns the nonvanishing of Littlewood-Richardson coefficients. In combination with work of [Klyachko '98], it implies [Horn '62]'s conjecture about eigenvalues of sums of Hermitian matrices.…
Presented here is a matrix inversion method utilizing quantum searching algorithm. In this method, huge Hilbert space as a whole spanned by myriad of eigen states is searched and evaluated efficiently by sequential reduction in dimension…
A novel framework for a unifying treatment of quaternion valued adaptive filtering algorithms is introduced. This is achieved based on a rigorous account of quaternion differentiability, the proposed I-gradient, and the use of augmented…
A simple and efficient variational method is introduced to accelerate the convergence of the eigenenergy computations for a Hamiltonian H with singular potentials. Closed-form analytic expressions in N dimensions are obtained for the matrix…
We construct affinization of the algebra $gl_{\lambda}$ of ``complex size'' matrices, that contains the algebras $\hat{gl_n}$ for integral values of the parameter. The Drinfeld--Sokolov Hamiltonian reduction of the algebra…
This paper deals with three technical ingredients of geometry for quantum information. Firstly, we give an algorithm to obtain diagonal basis matrices for submodules of the Z_{d}-module Z_{d}^{n} and we describe the suitable computational…
The interior structure of arbitrary sets of quaternion units is analyzed using general methods of the theory of matrices. It is shown that the units are composed of quadratic combinations of fundamental objects having a dual mathematical…
A real square matrix is Perron-like if it has a real eigenvalue $s$, called the principal eigenvalue of the matrix, and $\mbox{Re}\,\mu<s$ for any other eigenvalue $\mu$. Nonnegative matrices and symmetric ones are typical examples of this…
A new hybrid algorithm for LDU-factorization for large sparse matrix combining iterative solver, which can keep the same accuracy as the classical factorization, is proposed. The last Schur complement will be generated by iterative solver…
The canonical quantum Hamiltonian eigenvalue problem for an anharmonic oscillator with a Lagrangian L = \dot{\phi}^2/2 - m^2 \phi^2/2 - g m^3 \phi^4 is numerically solved in two ways. One of the ways uses a plain cutoff on the number of…
Starting with a quaternion difference equation with boundary conditions, a parameterized sequence which is complete in finite dimensional quaternion Hilbert space is derived. By employing the parameterized sequence as the kernel of discrete…
A Littlewood identity is an identity equating a sum of Schur functions with an infinite product. A bounded Littlewood identity is one where the sum is taken over the partitions with a bounded number of rows or columns. The price to pay is…
This paper formulates an elementary algorithm for resolution of singularities in a neighborhood of a singular point over a field of characteristic zero. The algorithm is composed of finite sequences of Newton polyhedra and monomial…
Matrices are typically considered over fields or rings. Motivated by applications in parametric differential equations and data-driven modeling, we suggest to study matrices with entries from a Hilbert space and present an elementary theory…
The QZ algorithm computes the Schur form of a matrix pencil. It is an iterative algorithm and at some point, it must decide that an eigenvalue has converged and move on with another one. Choosing a criterion that makes this decision is…
Littlewood--Paley theory is a fundamental tool for frequency localization, square-function control, and multiplier analysis, yet a systematic counterpart in the fractional Fourier transform (FrFT) setting has remained incomplete. We develop…