Related papers: Quantum Matrices by Paths
The main aim of this paper is to establish a deep link between the totally nonnegative grassmannian and the quantum grassmannian. More precisely, under the assumption that the deformation parameter $q$ is transcendental, we show that…
The algebraic formulation of the quantum group gauge models in the framework of the $R$-matrix approach to the theory of quantum groups is given. We consider gauge groups taking values in the quantum groups and noncommutative gauge fields…
We construct a topos of quantum sets and embed into it the classical topos of sets. We show that the internal logic of the topos of sets, when interpreted in the topos of quantum sets, provides the Birkhoff-von Neumann quantum propositional…
The aim of this paper is to study the representation theory of quantum Schubert cells. Let $\g$ be a simple complex Lie algebra. To each element $w$ of the Weyl group $W$ of $\g$, De Concini, Kac and Procesi have attached a subalgebra…
Adapting a recent work of Brannan et al., on extending graph $C^*$-algebras to Quantum graphs, we introduce "Quantum Quivers" as an analogue of quivers where the edge and vertex set has been replaced by a $C^*$-algebra and the maps between…
The theory of quantum mechanics is examined using non-standard real numbers, called quantum real numbers (qr-numbers), that are constructed from standard Hilbert space entities. Our goal is to resolve some of the paradoxical features of the…
In this article, we provide an explicit description of a set of generators for any ideal of an ultragraph Leavitt path algebra. We provide several additional consequences of this description, including information about generating sets for…
Quantum resources exist in a hierarchy of multiple levels. At order zero, quantum states are transformed by linear maps (channels, or gates) in order to perform computations or simulate other states. At order one, gates and channels are…
This paper contains a survey of some ring-theoretic aspects of quantized coordinate rings, with primary focus on the prime and primitive spectra. For these algebras, the overall structure of the prime spectrum is governed by a partition…
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…
General algebraic properties of the algebras of vector fields over quantum linear groups $GL_q(N)$ and $SL_q(N)$ are studied. These quantum algebras appears to be quite similar to the classical matrix algebra. In particular, quantum…
Let G be a finite graph on [n] = {1,2,3,...,n}, X a 2 times n matrix of indeterminates over a field K, and S = K[X] a polynomial ring over K. In this paper, we study about ideals I_G of S generated by 2-minors [i,j] of X which correspond to…
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…
To any toric ideal $I_A$, encoded by an integer matrix $A$, we associate a matroid structure called {\em the bouquet graph} of $A$ and introduce another toric ideal called {\em the bouquet ideal} of $A$. We show how these objects capture…
We introduce the concept of regular quantum graphs and construct connected quantum graphs with discrete symmetries. The method is based on a decomposition of the quantum propagator in terms of permutation matrices which control the way…
It is first pointed out that there is a common mathematical model for the universe and the quantum computer. The former is called the histories approach to quantum mechanics and the latter is called measurement based quantum computation.…
Based on our previous works, and in order to relate them with the theory of quantum graphs and the quantum computing principles, we once again try to introduce some newly developed technical structures just by relying on our toy example,…
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,…
We introduce the Mixed-Integer Quadratically Constrained Quadratic Programming framework for the quantum compilation problem and apply it in the context of topological quantum computing. In this setting, quantum gates are realized by…
Associated to a finite graph $X$ is its quantum automorphism group $G$. The main problem is to compute the Poincar\'e series of $G$, meaning the series $f(z)=1+c_1z+c_2z^2+...$ whose coefficients are multiplicities of 1 into tensor powers…