Related papers: Quantum groups and Hadamard matrices
We describe the implications of permutation symmetry for the state space and dynamics of quantum mechanical systems of matrices of general size $N$. We solve the general 11- parameter permutation invariant quantum matrix harmonic oscillator…
We introduce a quantum loop group associated to a general symmetric Cartan matrix, by imposing just enough relations between the usual generators $\{e_{i,k}, f_{i,k}\}_{i \in I, k \in \mathbb{Z}}$ in order for the natural Hopf pairing…
We consider (self-adjoint) families of infinite matrices of noncommutative random variables such that the joint distribution of their entries is invariant under conjugation by a free quantum group. For the free orthogonal and…
We define new compact matrix quantum groups whose intertwiner spaces are dual to tensor categories of three-dimensional set partitions -- which we call spatial partitions. This extends substantially Banica and Speicher's approach of the so…
This paper initiates the study of hidden variables from the discrete, abstract perspective of quantum computing. For us, a hidden-variable theory is simply a way to convert a unitary matrix that maps one quantum state to another, into a…
Motivated by the vast literature of quantum automorphism groups of graphs, we define and study quantum automorphism groups of matroids. A key feature of quantum groups is that there are many quantizations of a classical group, and this…
There is a unique finite group that lies inside the 2-dimensional unitary group but not in the special unitary group, and maps by the symmetric square to an irreducible subgroup of the 3-dimensional real special orthogonal group. In an…
A quantum set is defined to be simply a set of nonzero finite-dimensional Hilbert spaces. Together with binary relations, essentially the quantum relations of Weaver, quantum sets form a dagger compact category. Functions between quantum…
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…
Group convolutions and cross-correlations, which are equivariant to the actions of group elements, are commonly used in mathematics to analyze or take advantage of symmetries inherent in a given problem setting. Here, we provide efficient…
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…
The main notions of the quantum groups: coproduct, action and coaction, representation and corepresentation are discussed using simplest examples: $GL_q(2)$, $sl_q(2)$, $q$-oscillator algebra ${\cal A}(q)$, and reflection equation algebra.…
We present a survey of quantum algorithms, primarily for an intended audience of pure mathematicians. We place an emphasis on algorithms involving group theory.
In these notes we explore a variety of models comprising a large number of constituents. An emphasis is placed on integrals over large Hermitian matrices, as well as quantum mechanical models whose degrees of freedom are organised in a…
We clarify different definitions of the density matrix by proposing the use of different names, the full density matrix for a single-closed quantum system, the compressed density matrix for the averaged single molecule state from an…
We define homological matrices, construct examples of one-dimension restricted homological quantum field theories, and show a relationship between the two theories.
We study permutation groups of given minimal degree without the classical primitivity assumption. We provide sharp upper bounds on the order of a permutation group of minimal degree m and on the number of its elements of any given support.…
We introduce a Sinkhorn-type algorithm for producing quantum permutation matrices encoding symmetries of graphs. Our algorithm generates square matrices whose entries are orthogonal projections onto one-dimensional subspaces satisfying a…
We report some observations concerning two well-known approaches to construction of quantum groups. Thus, starting from a bialgebra of inhomogeneous type and imposing quadratic, cubic or quartic commutation relations on a subset of its…
Various topics concerning the entanglement of composite quantum systems are considered with particular emphasis concerning the strict relations of such a problem with the one of attributing objective properties to the constituents. Most of…