Related papers: An Introduction to Cartan's KAK Decomposition for …
Extending the lambda-calculus with a construct for sharing, such as let expressions, enables a special representation of terms: iterated applications are decomposed by introducing sharing points in between any two of them, reducing to the…
To generate arbitrary one- and two-qubit gates, the universal decompositions are usually used in quantum computing, and the universality of these decompositions has been demonstrated. However, in realistic experiments, gate errors may…
The present work stemmed from the study of the problem of harmonic analysis on the infinite-dimensional unitary group U(\infty). That problem consisted in the decomposition of a certain 4-parameter family of unitary representations, which…
We prove a general decomposition theorem for the modal $\mu$-calculus $L_\mu$ in the spirit of Feferman and Vaught's theorem for disjoint unions. In particular, we show that if a structure (i.e., transition system) is composed of two…
An explicit lattice realization of a non-Abelian topological memory is presented. The correspondence between logical and physical states is seen directly by use of the stabilizer formalism. The resilience of the encoded states against…
A proof is given, which relies on the commutator algebra of the unitary Lie groups, that quantum gates operating on just two bits at a time are sufficient to construct a general quantum circuit. The best previous result had shown the…
The Gell-Mann $\lambda$ matrices for Lie algebra su(3) are the natural basis for the Hilbert space of Hermitian operators acting on the states of a three-level system(qutrit). So the construction of EWs for two-qutrit states by using these…
We define and study an analogue of the Baum-Connes assembly map for complex semisimple quantum groups, that is, Drinfeld doubles of $ q $-deformations of compact semisimple Lie groups. Our starting point is the deformation picture of the…
In this paper we consider the problem of deformation quantization of the algebra of polynomial functions on coadjoint orbits of semisimple lie groups. The deformation of an orbit is realized by taking the quotient of the universal…
The decomposition of large unitary matrices into smaller ones is important, because it provides ways to realization of classical and quantum information processing schemes. Today, most of the methods use planar meshes of tunable two-channel…
Completely positive and trace-preserving maps characterize physically implementable quantum operations. On the other hand, general linear maps, such as positive but not completely positive maps, which can not be physically implemented, are…
We show that the quantum affine algebra U_{q}(A_{1}^{(1)}) and the quantum affine superalgebra U_{q}(C(2)^{(2)}) admit unified description. The difference between them consists in the phase factor which is equal to 1 for U_{q}(A_{1}^{(1)})…
This chapter provides an introduction to the use of diagrammatic language, or perhaps more accurately, diagrammatic calculus, in quantum information and quantum foundations. We illustrate the use of diagrammatic calculus in one particular…
Quaternary code (QC) designs form an attractive class of nonregular factorial fractions. We develop a complementary set theory for characterizing optimal QC designs that are highly fractionated in the sense of accommodating a large number…
Various aspects of the theory of quantum integrable systems are reviewed. Basic ideas behind the construction of integrable ultralocal and nonultralocal quantum models are explored by exploiting the underlying algebraic structures related…
An essential element of classical computation is the "if-then" construct, that accepts a control bit and an arbitrary gate, and provides conditional execution of the gate depending on the value of the controlling bit. On the other hand,…
Let $A$ be a finite-dimensional algebra over an algebraically closed field $\Bbbk$. For any finite-dimensional $A$-module $M$ we give a general formula that computes the indecomposable decomposition of $M$ without decomposing it, for which…
Quantum computations promise the ability to solve problems intractable in the classical setting. Restricting the types of computations considered often allows to establish a provable theoretical advantage by quantum computations, and later…
We initiate and study the theory of ``real decomposable maps" between real operator systems. Formally, this is new even in the complex case, which hitherto has restricted itself to the case where the systems are complex C*-algebras. We…
Suppose that a quantum circuit with K elementary gates is known for a unitary matrix U, and assume that U^m is a scalar matrix for some positive integer m. We show that a function of U can be realized on a quantum computer with at most…