相关论文: Random Generator of Orthogonal Matrices in Finite …

The matrices that can be exactly represented by a circuit over the Toffoli-Hadamard gate set are the orthogonal matrices of the form $M/ \sqrt{2}{}^k$, where $M$ is an integer matrix and $k$ is a nonnegative integer. The exact synthesis…

An algorithm is proposed to convert arbitrary unitary matrix to a sequence of $X$ gates and fully controlled $R_y, R_z$ and $R_1$ gates. This algorithm is used to generate Q# implementation for arbitrary unitary matrix. Some optimizations…

We study a method of producing approximately diagonal 1-qubit gates. For each positive integer, the method provides a sequence of gates that are defined iteratively from a fixed diagonal gate and an arbitrary gate. These sequences are…

We present two algorithms to list certain classes of monomino-domino coverings which conform to the \emph{tatami} restriction; no four tiles meet. Our methods exploit structural features of tatami coverings in order to create the lists in…

While existing algorithms may be used to solve a linear system over a general field in matrix-multiplication time, the complexity of constructing a symmetric triangular factorization (LDL) has received relatively little formal study. The…

We discuss how to generate random unitary matrices from the classical compact groups U(N), O(N) and USp(N) with probability distributions given by the respective invariant measures. The algorithm is straightforward to implement using…

We present a prescription for forming matrices with specified eigenvalues and known eigenvectors. With this method, we can form Hermitian, anti-Hermitian, symmetric and general matrices with arbitrary eigenvalues. In addition we propose an…

Let M be a random (alpha n) x n matrix of rank r<<n, and assume that a uniformly random subset E of its entries is observed. We describe an efficient algorithm that reconstructs M from |E| = O(rn) observed entries with relative root mean…

Orthogonal array and a large set of orthogonal arrays are important research objects in combinatorial design theory, and they are widely applied to statistics, computer science, coding theory and cryptography. In this paper, some new series…

This paper is devoted to the general problem of projection onto a polyhedral convex cone generated by a finite set of generators.This problem is reformulated into projection onto the polytope obtained by simple truncation of the original…

After extending the classic notion of a tight Heffter array H$(m,n)$ to any group of order $2mn+1$, we give direct constructions for elementary abelian tight Heffter arrays, hence in particular for prime tight Heffter arrays. If $q=2mn+1$…

We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertices of its representation by a reduced graph such as can be…

We introduce a new set of algorithms to compute Jacobi matrices associated with measures generated by infinite systems of iterated functions. We demonstrate their relevance in the study of theoretical problems, such as the continuity of…

We present a class of fast subspace tracking algorithms based on orthogonal iterations for structured matrices/pencils that can be represented as small rank perturbations of unitary matrices. The algorithms rely upon an updated data sparse…

We give an account of lax orthogonal factorisation systems on order-enriched categories. Among them, we define and characterise the KZ-reflective ones, in a way that mirrors the characterisation of reflective orthogonal factorisation…

We propose a method to construct universal order parameters for quantum phase transitions in many-body lattice systems. The method exploits the $H$-orthogonality of a few near-degenerate lowest states of the Hamiltonian describing a given…

Randomized sampling has recently been proven a highly efficient technique for computing approximate factorizations of matrices that have low numerical rank. This paper describes an extension of such techniques to a wider class of matrices…

We introduce a new constructive recognition algorithm for finite special linear groups in their natural representation. Given a group $G$ generated by a set of $d\times d$ matrices over a finite field $\mathbb{F}_q$, known to be isomorphic…

Let $\lambda$ be a partition of an integer $n$ and ${\mathbb F}_q$ be a finite field of order $q$. Let $P_\lambda(q)$ be the number of strictly upper triangular $n\times n$ matrices of the Jordan type $\lambda$. It is known that the…

The need to estimate a positive definite solution to an overdetermined linear system of equations with multiple right hand side vectors arises in several process control contexts. The coefficient and the right hand side matrices are…