Related papers: A Theory for Valiant's Matchcircuits (Extended Abs…

By using the quasi-determinant the construction of Gel'fand et al. leads to the inverse of a matrix with noncommuting entries. In this work we offer a new method that is more suitable for physical purposes and motivated by deformation…

Closed-form generating functions for counting one-face rooted hypermaps with a known number of darts by number of vertices and edges is found, using matrix integral expressions relating to the reduced density operator of a bipartite quantum…

We present verification protocols to gain confidence in the correct performance of the realization of an arbitrary universal quantum computation. The derivation of the protocols is based on the fact that matchgate computations, which are…

A tournament is a directed graph resulting from an orientation of the complete graph; so, if $M$ is a tournament's adjacency matrix, then $M + M^T$ is a matrix with $0$s on its diagonal and all other entries equal to $1$. An outstanding…

We present a collection of results concerning the structure of reversible gate classes over non-binary alphabets, including (1) a reversible gate class over non-binary alphabets that is not finitely generated (2) an explicit set of…

Let $A$ be a matrix with nonnegative real entries. A nonnegative factorization of size $k$ is a representation of $A$ as a sum of $k$ nonnegative rank-one matrices. The space of all such factorizations is a bounded semialgebraic set, and we…

This paper generalizes the results obtained in an earlier paper (math.OA/0003087) for finite factors to infinite but still semifinite factors. First we give a characterization of cyclic and separating vectors for infinite semifinite factors…

In this article we show how the structure of Coxeter groups are present in gate sets of reversible and quantum computing. These groups have efficient word problems which means that circuits built from these gates have potential to be…

Immanants are polynomial functions of n by n matrices attached to irreducible characters of the symmetric group S_n, or equivalently to Young diagrams of size n. Immanants include determinants and permanents as extreme cases. Valiant proved…

We consider the actions of different groups G on the space M of m x n matrices with entries in the formal power series ring K[[x1,..., xs]], K an arbitrary field. G acts on M by analytic change of coordinates, combined with the…

In this paper, we study matricial representations of certain finitely presented groups with N-generators of order-2. As an application, we consider a group algebra under our representations. Specifically, we characterize the inverses of all…

In this paper, closed formulas for the eigenvectors of a particular class of matrices generated by generalized permutation matrices, named generalized circulant matrices, are presented.

Let $\mathcal{A}=(A_{1},...,A_{n},...)$ be a finite or infinite sequence of $2\times2$ matrices with entries in an integral domain. We show that, except for a very special case, $\mathcal{A}$ is (simultaneously) triangularizable if and only…

A vector-circulant matrix is a natural generalization of the classical circulant matrix and has applications in constructing additive codes. This article formulates the concept of a vector-circulant matrix over finite fields and gives an…

In this paper, we are concerned with the inversion of circulant matrices and their quantized tensor-train (QTT) structure. In particular, we show that the inverse of a complex circulant matrix $A$, generated by the first column of the form…

Computational problems concerning the orbit of a point under the action of a matrix group occur throughout computer science, including in program analysis, complexity theory, quantum computation, and automata theory. In many cases the focus…

This paper presents new approaches for finding the determinant and inverse of a matrix. The choice of pivot selection is kept arbitrary and can be made according to the users need. So the ill conditioned matrices can be handled easily. The…

This paper studies the set of $n\times n$ matrices for which all row and column sums equal zero. By representing these matrices in a lower dimensional space, it is shown that this set is closed under addition and multiplication, and…

Motivated by the recent work of Xiao and Zhong [AIMS Math. 9 (2024), 35125--35150: MR4840882], we propose a generalized inverse for a hyper-dual matrix called hyper-dual group generalized inverse (HDGGI). Under certain necessary and…

We present a low-depth randomised algorithm for the estimation of entanglement fidelity between an $n$-qubit matchgate circuit $\mathcal{U}$ and its noisy implementation $\mathcal{E}$. Our procedure makes use of a modified Pauli-Liouville…