Related papers: Algebra, Logic and Qubits: Quantum Abacus
We develop a new approach to the representation theory of quantum algebras supporting a torus action via methods from the theory of finite-state automata and algebraic combinatorics. We show that for a fixed number $m$, the torus-invariant…
We show that the lambda-q calculus can efficiently simulate quantum Turing machines by showing how the lambda-q calculus can efficiently simulate a class of quantum cellular automaton that are equivalent to quantum Turing machines. We…
In a recent series of papers we have analyzed a certain deformation of the canonical commutation relations producing an interesting functional structure which has been proved to have some connections with physics, and in particular with…
We propose to represent both $n$--qubits and quantum gates acting on them as elements in the complex Clifford algebra defined on a complex vector space of dimension $2n.$ In this framework, the Dirac formalism can be realized in…
We show that a class of quantum computations that was recently shown to be efficiently simulatable on a classical computer by Valiant corresponds to a physical model of noninteracting fermions in one dimension. We give an alternative proof…
We explore a way of universal quantum computation with particles which cannot occupy the same position simultaneously and are symmetric under exchange of particle labels. Therefore the associated creation and annihilation operators are…
Let $C$ be a symmetrizable generalized Cartan Matrix, and $q$ an indeterminate. ${\fg}(C)$ is the Kac-Moody Lie algebra and $U=U_q({\fg}(C))$ the associated quantum enveloping algebra over $ k={\Bbb Q}(q)$. The quantum function algebra…
We study characterization of separable (classically correlated) states for composite systems of distinguishable fermions that are represented as CAR algebras.
Let $X=\mathbb R^2$ and let $q\in\mathbb C$, $|q|=1$. For $x=(x^1,x^2)$ and $y=(y^1,y^2)$ from $X^2$, we define a function $Q(x,y)$ to be equal to $q$ if $x^1<y^1$, to $\bar q$ if $x^1>y^1$, and to $\Re q$ if $x^1=y^1$. Let $\partial_x^+$,…
The seven binary quantum numbers that distinguish fundamental fermions have been shown to be conserved in decays and interactions. Here applications of this law are clarified to take account of odd (uct) and even (dsb) parity quarks…
Lie algebroids provide a natural medium to discuss classical systems, however, quantum systems have not been considered. In aim of this paper is to attempt to rectify this situation. Lie algebroids are reviewed and their use in classical…
Particular complexity of linear quantum optical networks is deserved recently certain attention due to possible implications for theory of quantum computation. Two relevant models of bosons are discussed in presented work. Symmetric product…
Quantum computations usually take place under the control of the classical world. We introduce a Classically-controlled Quantum Turing Machine (CQTM) which is a Turing Machine (TM) with a quantum tape for acting on quantum data, and a…
A number of recent studies have proposed that linear representations are appropriate for solving nonlinear dynamical systems with quantum computers, which fundamentally act linearly on a wave function in a Hilbert space. Linear…
In recent work [quant-ph/0405174] by Schumacher and Werner was discussed an abstract algebraic approach to a model of reversible quantum cellular automata (CA) on a lattice. It was used special model of CA based on partitioning scheme and…
Given a skew-symmetric real $n\times n$ matrix $\Theta$ we consider the universal enveloping $C^*$-algebra $\mathsf{CAR}_\Theta$ of the $*$-algebra generated by $a_1, \ldots, a_n$ subject to the relations \[ a_i^* a_i + a_i a_i^* = 1, \ \]…
We consider topological quantum memories for a general class of abelian anyon models defined on spin lattices. These are non-universal for quantum computation when restricting to topological operations alone, such as braiding and fusion.…
Topological quantum computers promise a fault tolerant means to perform quantum computation. Topological quantum computers use particles with exotic exchange statistics called non-Abelian anyons, and the simplest anyon model which allows…
The model of generalized quons is described in a purely algebraic way. Commutation relations and corresponding consistency conditions for our generalized quons system are studied in terms of quantum Weyl algebras. Fock space representation…
This survey article is concerned with the modeling of the kinematical structure of quantum systems in an algebraic framework which eliminates certain conceptual and computational difficulties of the conventional approaches. Relying on the…