Related papers: Simultaneous unitary equivalences
The problem of classifying all unitary R-matrices of arbitrary finite dimension that have precisely two distinct eigenvalues is described, working up to a natural equivalence relation given by the characters of their braid group…
Cohn and Umans proposed a framework for developing fast matrix multiplication algorithms based on the embedding computation in certain groups algebras. In subsequent work with Kleinberg and Szegedy, they connected this to the search for…
We characterize all maximally entangling bipartite unitary operators, acting on systems $A,B$ of arbitrary finite dimensions $d_A\le d_B$, when use of ancillary systems by both parties is allowed. Several useful and interesting consequences…
Consider the collection of all binary matrices having a specific sequence of row and column sums and consider sampling binary matrices uniformly from this collection. Practical algorithms for exact uniform sampling are not known, but there…
This paper continues the authors' work on the question of unitary equivalence of matrices with entries in the complex-valued functions of a topological space (matrices over spaces). Specifically, we here consider the question of unitary…
A unitary matrix model is proposed as the large-N matrix formulation of M theory on flat space with toroidal topology. The model reproduces the motion of elementary D-particles on the compact space, and admits membrane states with nonzero…
It is well known that a set of non-defect matrices can be simultaneously diagonalized if and only if the matrices commute. In the case of non-commuting matrices, the best that can be achieved is simultaneous block diagonalization. Here we…
We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…
The current paper is dedicated to the problem of finding the number of mutually non isomorphic bipartite graphs of the type $g=\langle R_g ,C_g ,E_g \rangle$ at given $n=|R_g |$ and $m=|C_g |$, where $R_g$ and $C_g$ are the two disjoint…
It is well known that two finite sequences of vectors in inner product spaces are unitarily equivalent if and only if their respective inner products (Gram matrices) are equal. Here we present a corresponding result for the projective…
We make use of the complex implicit representation in order to provide a deterministic algorithm for checking whether or not two implicit algebraic curves are related by a similarity, a central question in Pattern Recognition and Computer…
Cluster algebras are a recent topic of study and have been shown to be a useful tool to characterize structures in several knowledge fields. An important problem is to establish whether or not a given cluster algebra is of finite type.…
In this paper, we give algorithms for determining the existence of isomorphism between two finite-dimensional Lie algebras and compute such an isomorphism in the affirrmative case. We also provide algorithms for determining algebraic…
We consider one-plaquette unitary matrix model at finite $N$ using exact expression of the partition function for both SU($N$) and U($N$) groups.
Let A and B be finite dimensional simple real algebras with division gradings by an abelian group G. In this paper we give necessary and sufficient conditions for the coincidence of the graded identities of A and B. We also prove that every…
We look at spaces of infinite-by-infinite matrices, and consider closed subsets that are stable under simultaneous row and column operations. We prove that up to symmetry, any of these closed subsets is defined by finitely many equations.
In this article, we consider birational equivalence of exponential matrices. In characteristic zero, we give a birational classification of exponential matrices of size $n$-by-$n$ $(n \geq 2)$, which consists of two types. And in positive…
We explore the set of unitary matrices characterized by a given structure in the context of their applications in the field of Quantum Information. In the first part of the Thesis we focus on classification of special classes of unitary…
We analyze the set of real and complex Hadamard matrices with additional symmetry constrains. In particular, we link the problem of existence of maximally entangled multipartite states of $2k$ subsystems with $d$ levels each to the set of…
A novel and deterministic algorithm is presented to detect whether two given rational plane curves are related by means of a similarity, which is a central question in Pattern Recognition. As a by-product it finds all such similarities, and…