相关论文: Permutation Equivalence Classes of Kronecker Produ…
An invertible matrix is called a Perron similarity if one of its columns and the corresponding row of its inverse are both nonnegative or both nonpositive. Such matrices are of relevance and import in the study of the nonnegative inverse…
The properties and applications of kronecker product in quantum theory is studied thoroughly. The use of kronecker product in quantum information theory to get the exact spin Hamiltonian is given. The proof of non-commutativity of matrices,…
We define and investigate a family of permutations matrices, called shuffling matrices, acting on a set of $N=n_1\cdots n_m$ elements, where $m\geq 2$ and $n_i\geq 2$ for any $i=1,\ldots, m$. These elements are identified with the vertices…
Quantum mechanics requires the operation of quantum computers to be unitary, and thus makes it important to have general techniques for developing fast quantum algorithms for computing unitary transforms. A quantum routine for computing a…
We investigate the iterated Kronecker product of a square matrix with itself and prove an invariance property for symmetric subspaces. This motivates the definition of an iterated symmetric Kronecker product and the derivation of an…
Compound matrices play an important role in many fields of mathematics and have recently found new applications in systems and control theory. However, the explicit formulas for these compounds are non-trivial and not always easy to use.…
We describe the inequalities on the possible eigenvalues of products of unitary matrices in terms of quantum Schubert calculus. Related problems are the existence of flat connections on the punctured two-sphere with prescribed holonomies,…
Complicated mathematical equations involving products of tensors with permutation symmetries, frequently encountered in fields such as general relativity and quantum chemistry (e.g., equations in high-order coupled cluster theories),…
There is a natural equivalence relation on representations of the states of a given quantum system in a Hilbert space, two representations being equivalent iff they are related by a unitary transformation. There are two equivalence classes,…
Permutation symmetries of multipartite quantum states are defined only when the constituent subsystems are of equal dimensions. In this work we extend this notion of permutation symmetry to heterogeneous systems, that is, systems composed…
In this paper we disprove the Haagerup statement that all complex Hadamard matrices of order five are equivalent with the Fourier matrix $F_5$ by constructing circulant matrices that lead to new Hadamard matrices. An important item is the…
We study two new families of symmetric functions arising from a species-theoretic construction motivated by cycle structure. For each partition of $n$, we define two combinatorial species that decompose into molecules indexed by the same…
The quantum Fourier transform (QFT), a quantum analog of the classical Fourier transform, has been shown to be a powerful tool in developing quantum algorithms. However, in classical computing there is another class of unitary transforms,…
This is a presentation of recent work on quantum permutation groups, complex Hadamard matrices, and the connections between them. A long list of problems is included. We include as well some conjectural statements, about matrix models.
Matrix-product codes over finite fields are an important class of long linear codes by combining several commensurate shorter linear codes with a defining matrix over finite fields. The construction of matrix-product codes with certain…
To any complex Hadamard matrix we associate a quantum permutation group. The correspondence is not one-to-one, but the quantum group encapsulates a number of subtle properties of the matrix. We investigate various aspects of the…
The purpose of this paper is to study the equivalence relation on unitary bases defined by R. F. Werner [{\it J. Phys. A: Math. Gen.} {\bf 34} (2001) 7081], relate it to local operations on maximally entangled vectors bases, find an…
Given its widespread application in machine learning and optimization, the Kronecker product emerges as a pivotal linear algebra operator. However, its computational demands render it an expensive operation, leading to heightened costs in…
This work lies across three areas (in the title) of investigation that are by themselves of independent interest. A problem that arose in quantum computing led us to a link that tied these areas together. This link consists of a single…
The fast Fourier transform (FFT) is one of the most successful numerical algorithms of the 20th century and has found numerous applications in many branches of computational science and engineering. The FFT algorithm can be derived from a…