Related papers: Unique builders for classes of matrices
We suggest that a certain one-to-one parametrization of completely positive maps on the matrix algebra might be useful in the study of quantum channels. This is illustrated in the case of binary quantum channels. While the algorithm is…
In this note we are dealing with a particular class of quadratic algebras -- the so-called quantum matrix algebras. The well-known examples are the algebras of quantized functions on classical Lie groups (the RTT algebras). We consider the…
Many well-known and well-studied four by four universal quantum logic gates in the literature are of a specific form, the so called eight-vertex form \eqref{8vertexform} \cite{kaufman etal 05-1,kaufman etal 05-2}, or {\it similar} to it. We…
To treat a problem with a Quantum Processing Unit (QPU), it must be transformed into a sequence of quantum operations, or gates: this is the quantum description of the problem. These operations are either packed into a query (i.e. quantum…
One of the principal obstacles on the way to quantum computers is the lack of distinguished basis in the space of unitary evolutions and thus the lack of the commonly accepted set of basic operations (universal gates). A natural choice,…
Unitary transformations and density matrices are central objects in quantum physics and various tasks require to introduce them in a parameterized form. In the present article we present a parameterization of the unitary group…
We give a new proof of the fact that any finite quadratic module can be decomposed into indecomposable ones. For any indecomposable finite quadratic module, we construct a lattice, and a positive definite lattice, both of which are of the…
An arithmetic matroid is weakly multiplicative if the multiplicity of at least one of its bases is equal to the product of the multiplicities of its elements. We show that if such an arithmetic matroid can be represented by an integer…
A novel algebra underlying integrable systems is shown to generate and unify a large class of quantum integrable models with given $R$-matrix, through reductions of an ancestor Lax operator and its different realizations. Along with known…
We sketch a simplification of proofs of old results on the arithmeticity of the group generated by opposing integral unipotent radicals in higher rank arithmetic groups
Unitary error bases have a great number of applications across quantum information and quantum computation, and are fundamentally linked to quantum teleportation, dense coding and quantum error correction. Werner's combinatorial…
We introduce a new structure, the critical multi-cubic lattice. Notably the critical multi-cubic lattice is the first true generalization of the cubic lattice to higher dimensional spaces. We then introduce the notion of a homomorphism in…
We introduce a construction that, given a pair (u,v) of complex Hadamard matrices of the same order, generates infinitely many biunitary matrices of varying (and distinct) orders. As a key application, this framework yields nested sequences…
Hermitian and unitary matrices are two representatives of the class of normal matrices whose full eigenvalue decomposition can be stably computed in quadratic computing com plexity. Recently, fast and reliable eigensolvers dealing with low…
We propose a construction of lattices from (skew-) polynomial codes, by endowing quotients of some ideals in both number fields and cyclic algebras with a suitable trace form. We give criteria for unimodularity. This yields integral and…
Recent investigations suggest that the discrete linear unitary group $U(N)$ can be represented by interlacing a finite sequence of diagonal phase operations with an intervening unitary operator. However, despite rigorous numerical…
We present a necessary and sufficient condition for a 3 by 3 matrix to be unitarily equivalent to a symmetric matrix with complex entries, and an algorithm whereby an arbitrary 3 by 3 matrix can be tested. This test generalizes to a…
Quantum programs today are written at a low level of abstraction - quantum circuits akin to assembly languages - and the unitary parts of even advanced quantum programming languages essentially function as circuit description languages.…
Design methods for paraunitary matrices from complete orthogonal sets of idempotents and related matrix structures are presented. These include techniques for designing non-separable multidimensional paraunitary matrices. Properties of the…
First some old as well as new results about P.I. algebras, Ore extensions, and degrees are presented. Then quantized $n\times r$ matrices as well as quantized factor algebras of $M_q(n)$ are analyzed. The latter are the quantized function…