Related papers: Unique builders for classes of matrices
Universally decodable matrices can be used for coding purposes when transmitting over slow fading channels. These matrices are parameterized by positive integers $L$ and $n$ and a prime power $q$. Based on Pascal's triangle we give an…
The purpose of this paper is to prove that we can construct all finite dimensional irreducible nilpotent modules of type 1 inductively by using Schnizer homomorphisms for quantum algebra at roots of unity of type A, B, C, D or G.
We investigate invertible matrices over finite additively idempotent semirings. The main result provides a criterion for the invertibility of such matrices. We also give a construction of the inverse matrix and a formula for the number of…
Unitary decomposition is a widely used method to map quantum algorithms to an arbitrary set of quantum gates. Efficient implementation of this decomposition allows for translation of bigger unitary gates into elementary quantum operations,…
We give a number of algorithms for constructing unitary matrices and tight frames with specialized properties. These were produced at the request of researchers at the Frame Research Center (www.framerc.org) to help with their research on…
We study algebras generated by positive matrices, i.e., matrices with nonnegative entries. Some of our results hold in more general setting of vector lattices. We reprove and extend some theorems that have been recently shown by Kandi\'{c}…
We present an infinite number of construction schemes involving unitary error bases, Hadamard matrices, quantum Latin squares and controlled families, many of which have not previously been described. Our results rely on biunitary…
We give unique recovery guarantees for matrices of bounded rank that have undergone permutations of their entries. We even do this for a more general matrix structure that we call ladder matrices. We use methods and results of commutative…
A constructive approach to differential calculus on quantum principal bundles is presented. The calculus on the bundle is built in an intrinsic manner, starting from given graded (differential) *-algebras representing horizontal forms on…
Structured canonical forms under unitary and suitable structure-preserving similarity transformations for normal and (skew-)Hamiltonian as well as normal and per(skew)-Hermitian matrices are proposed. Moreover, an algorithm for computing…
We exactly construct one- and two-qubit holonomic quantum gates in terms of isospectral deformations of an Ising model Hamiltonian. A single logical qubit is constructed out of two spin-1/2 particles; the qubit is a dimer. We find that the…
Any unitary transformation of quantum computational networks is explicitly decomposed, in an exact and unified form, into a sequence of a limited number of one-qubit quantum gates and the two-qubit diagonal gates that have diagonal unitary…
We study the modular representation theory of the symmetric and alternating groups. One of the most natural ways to label the irreducible representations of a given group or algebra in the modular case is to show the unitriangularity of the…
Most algorithms constructing bases of finite-dimensional vector spaces return basis vectors which, apart from orthogonality, do not show any special properties. While every basis is sufficient to define the vector space, not all bases are…
Quantum algorithms may be described by sequences of unitary transformations called quantum gates and measurements applied to the quantum register of n quantum bits, qubits. A collection of quantum gates is called universal if it can be used…
Unitary operators are essential to quantum mechanics, however for discrete systems larger than a qubit, it is difficult to express them in a self-contained way. This report presents just such a description, providing a compact, useful…
In some matrix formations, factorizations and transformations, we need special matrices with some properties and we wish that such matrices should be easily and simply generated and of integers. In this paper, we propose a zero-sum rule for…
The most general structure (in matrix form) of a single-qubit gate is presented. Subsequently, used that to obtain a set of conditions for testing (a) whether a given 2-qubit gate is genuinely a 2-qubit gate, i.e., not decomposable into two…
Kronecker products of unitary Fourier matrices play important role in solving multilevel circulant systems by a multidimensional Fast Fourier Transform. They are also special cases of complex Hadamard (Zeilinger) matrices arising in many…
The practically important classes of equal-input and of monotone Markov matrices are revisited, with special focus on embeddability, infinite divisibility, and mutual relations. Several uniqueness results for the classic Markov embedding…