Related papers: A route to quantum computing through the theory of…
The notion of families of quantum invertible maps ($C^*$-algebra homomorphisms satisfying Podle\'s condition) is employed to strengthen and reinterpret several results concerning universal quantum groups acting on finite quantum spaces. In…
We introduce a model of computation based on quaternions, which is inspired on the quantum computing model. Pure states are vectors of a suitable linear space over the quaternions. Other aspects of the theory are the same as in quantum…
Neutral atom technology has steadily demonstrated significant theoretical and experimental advancements, positioning itself as a front-runner platform for running quantum algorithms. One unique advantage of this technology lies in the…
Computations with a future quantum computer will be implemented through the operations by elementary quantum gates. It is now well known that the collection of 1-bit and 2-bit quantum gates are universal for quantum computation, i.e., any…
The discussions in the present paper arise from exploring intrinsically the structure nature of the quantum $n$-space. A kind of braided category $\Cal {GB}$ of $\La$-graded $\th$-commutative associative algebras over a field $k$ is…
In mathematical aspect, we introduce quantum algorithm and the mathematical structure of quantum computer. Quantum algorithm is expressed by linear algebra on a finite dimensional complex inner product space. The mathematical formulations…
Qubits are a great way to build a quantum computer, but a limited way to program one. We replace the usual "states and gates" formalism with a "props and ops" (propositions and operators) model in which (a) the C*-algebra of observables…
In quantum computing, the connectivity of qubits placed on two-dimensional chips limits the scalability and functionality of solid-state quantum computers. This paper presents two approaches to constructing complex quantum networks from…
We develop two approaches to Quantum (or Non-commutative) Graphs based on arbitrary von Neumann algebras $M\subseteq\mathcal B(H)$: one looking at operator bimodules of Hilbert--Schmidt (instead of bounded) operators, and the second looking…
Quantum Computing is a new and exciting field at the intersection of mathematics, computer science and physics. It concerns a utilization of quantum mechanics to improve the efficiency of computation. Here we present a gentle introduction…
Graph inverse semigroups generalize the polycyclic inverse monoids and play an important role in the theory of C*-algebras. This paper has two main goals: first, to provide an abstract characterization of graph inverse semigroups; and…
While stabilizer tableaus have proven useful as a descriptive tool for additive quantum codes, they otherwise offer little guidance for concrete constructions or algorithm analysis. We introduce a representation of stabilizer codes as…
Quantum computer architectures impose restrictions on qubit interactions. We propose efficient circuit transformations that modify a given quantum circuit to fit an architecture, allowing for any initial and final mapping of circuit qubits…
We initiate a systematic study of quantum properties of finite graphs, namely, quantum asymmetry, quantum symmetry, and quantum isomorphism. We define the Schmidt alternative for a class of graphs, which reveals to be a useful tool for…
This paper initiates the study of quantum computing within the constraints of using a polylogarithmic ($O(\log^k n), k\geq 1$) number of qubits and a polylogarithmic number of computation steps. The current research in the literature has…
Let $E$ be a finite directed graph with no sources or sinks and write $X_E$ for the graph correspondence. We study the $C^*$-algebra $C^*(E,Z):=\mathcal{T}(X_E,Z)/\mathcal{K}$ where $\mathcal{T}(X_E,Z)$ is the $C^*$-algebra generated by…
Clifford algebras are used for definition of spinors. Because of using spin-1/2 systems as an adequate model of quantum bit, a relation of the algebras with quantum information science has physical reasons. But there are simple mathematical…
We give a derivation of quantum spectral curve (QSC) - a finite set of Riemann-Hilbert equations for exact spectrum of planar N=4 SYM theory proposed in our recent paper Phys.Rev.Lett. 112 (2014). We also generalize this construction to all…
According to the statistical interpretation of quantum theory, quantum computers form a distinguished class of probabilistic machines (PMs) by encoding n qubits in 2n pbits (random binary variables). This raises the possibility of a…
Quantum information geometry studies families of quantum states by means of differential geometry. A new approach is followed with the intention to facilitate the introduction of a more general theory in subsequent work. To this purpose,…