Related papers: A route to quantum computing through the theory of…
We introduce a new method of expressing a $k$-graph $C^*$-algebra as a Cuntz-Pimsner algebra. Kumjian, Pask, and Sims have done this directly, using a linking algebra approach and a $(k-1)$-graph algebra. This can be iterated downward. Our…
We present an efficient family of quantum circuits for a fundamental primitive in quantum information theory, the Schur transform. The Schur transform on n d-dimensional quantum systems is a transform between a standard computational basis…
For special universal $C^*$-algebras associated to $k$-semigraphs we present the universal representations of these algebras, prove a Cuntz--Krieger uniqueness theorem, and compute the $K$-theory. These $C^*$-algebras seem to be the most…
Determining the quantum circuit complexity of a unitary operation is an important problem in quantum computation. By using the mathematical techniques of Riemannian geometry, we investigate the efficient quantum circuits in quantum…
Following our previous works on $C^*$-graph algebras and the associated Cuntz-Krieger graph families, in this paper we will try to have a look at the colored version of these structures and to see what a $C^*$-colored graph algebra might…
While stabilizer tableaus have proven exceptionally useful as a descriptive tool for additive quantum codes, they offer little guidance for concrete constructions or coding algorithm analysis. We introduce a representation of stabilizer…
Cuntz algebras $\mathcal{O}_n$, $n>1$, are celebrated examples of a separable infinite simple C*-algebra with a number of fascinating properties. Their K-theory allows an embedding of $\mathcal O_m$ in $\mathcal O_n$ whenever $n-1$ divides…
Here is discussed application of the Weyl pair to construction of universal set of quantum gates for high-dimensional quantum system. An application of Lie algebras (Hamiltonians) for construction of universal gates is revisited first. It…
In this article, we present a new method to study relative Cuntz-Krieger algebras for higher-rank graphs. We only work with edges rather than paths of arbitrary degrees. We then use this method to simplify the existing results about…
In this article, we explore the quantum symmetry of the direct sum of a finite family of Cuntz algebras $\{\mathcal{O}_{n_i} \}_{i=1}^{m}$, viewing them as graph $C^*$-algebras associated to the graphs $\{L_{n_i}\}_{i=1}^{m}$ (where $L_n$…
We employ an algebraic procedure based on quantum mechanics to propose a `quantum number theory' (QNT) as a possible extension of the `classical number theory'. We built our QNT by defining pure quantum number operators ($q$-numbers) of a…
We introduce a new class of C^*-algebras, which is a generalization of both graph algebras and homeomorphism C^*-algebras. This class is very large and also very tractable. We prove the so-called gauge-invariant uniqueness theorem and the…
Borrowing ideas from the relation between simply laced Lie algebras and Dynkin diagrams, a weighted graph theory representation of quantum information is addressed. In this way, the density matrix of a quantum state can be interpreted as a…
Topological quantum computation may provide a robust approach for encoding and manipulating information utilizing the topological properties of anyonic quasi-particle excitations. We develop an efficient means to map between dense and…
A quantum graph $\mathcal{G}$ housed by a matrix algebra $M_n$ can be encoded as an operator system $\mathcal S=\mathcal{S}_{\mathcal{G}}\le M_n$. There are two sensible notions of quantum automorphism group for any such:…
Universal quantum computation can be realised using both continuous-time and discrete-time quantum walks. We present a version based on single particle discrete-time quantum walk to realize multi-qubit computation tasks. The scalability of…
We study quantum automorphism group of vertex-transitive graphs using intertwinner spaces of the magic unitary matrix associated to this quantum subgroups of $S_n^+$. We also give some applications to quantum symmetries of circulant graphs…
Different graphical calculi have been proposed to represent quantum computation. First the ZX- calculus [4], followed by the ZW-calculus [12] and then the ZH-calculus [1]. We can wonder if new Z*-calculi will continue to be proposed…
We present a conceptually new approach to describe state-of-the-art photonic quantum experiments using Graph Theory. There, the quantum states are given by the coherent superpositions of perfect matchings. The crucial observation is that…
We develop new techniques for the construction and classification of representations of row-finite and locally convex higher-rank graph C*-algebras O. This class includes Cuntz--Krieger algebras associated to row-finite directed graphs. Our…