Related papers: Expressing the operations of quantum computing in …
We describe stabilizer states and Clifford group operations using linear operations and quadratic forms over binary vector spaces. We show how the n-qubit Clifford group is isomorphic to a group with an operation that is defined in terms of…
Quantum computing has been increasingly applied in nuclear physics. In this work, we combine quantum computing with the complex scaling method to address the resonance problem. Due to the non-Hermiticity introduced by complex scaling,…
We propose a feasible scheme to achieve quantum computation based on geometric manipulation of ensembles of atoms, and analyze it for neutral rubidium atoms magnetically trapped in planoconcave microcavities on an atom chip. The geometric…
In this paper we present a survey of the use of differential geometric formalisms to describe Quantum Mechanics. We analyze Schr\"odinger framework from this perspective and provide a description of the Weyl-Wigner construction. Finally,…
With a view towards models of quantum computation and/or the interpretation of linear logic, we define a functional language where all functions are linear operators by construction. A small step operational semantic (and hence an…
The formalism of geometric algebra can be described as deformed super analysis. The deformation is done with a fermionic star product, that arises from deformation quantization of pseudoclassical mechanics. If one then extends the…
{\sc CLIFFORD} is a Maple package for computations in Clifford algebras $\cl (B)$ of an arbitrary symbolic or numeric bilinear form B. In particular, B may have a non-trivial antisymmetric part. It is well known that the symmetric part g of…
The natural Hilbert Space of quantum particles can implement maximum-likelihood (ML) decoding of classical information. The 'Quantum Product Algorithm' (QPA) is computed on a Factor Graph, where function nodes are unitary matrix operations…
The Clifford algebra over the three-dimensional real linear space includes its linear structure and its exterior algebra, the subspaces spanned by multivectors of the same degree determine a gradation of the Clifford algebra. Through these…
A new model of quantum computing has recently been proposed which, in analogy with a classical lambda-calculus, exploits quantum processes which operate on other quantum processes. One such quantum meta-operator takes N unitary…
The existing relation between the tomographic description of quantum states and the convolution algebra of certain discrete groupoids represented on Hilbert spaces will be discussed. The realizations of groupoid algebras based on qudit,…
The field of quantum algorithms is vibrant. Still, there is currently a lack of programming languages for describing quantum computation on a practical scale, i.e., not just at the level of toy problems. We address this issue by introducing…
Deformation quantization and geometric quantization on K\"ahler manifolds give the mathematical description of the algebra of quantum observables and the Hilbert spaces respectively, where the later forms a representation of quantum…
It is shown that the generators of Clifford algebras behave as creation and annihilation operators for fermions and bosons. They can create extended objects, such as strings and branes, and can induce curved metric of our spacetime. At a…
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…
A generalized Clifford manifold is proposed in which there are coordinates not only for the basis vector generators, but for each element of the Clifford group, including the identity scalar. These new quantities are physically interpreted…
In spite of their evident logical character, particle statistics symmetries are not among the inherently quantum features exploited in quantum computation. A difficulty may be that, being a constant of motion of a unitary evolution, a…
Quantum computations that involve only Clifford operations are classically simulable despite the fact that they generate highly entangled states; this is the content of the Gottesman-Knill theorem. Here we isolate the ingredients of the…
As in classical reversible computing, Quantum Arithmetic is typically seen as a set of tools that process binary data encoded into a quantum register to set the value of another quantum register. This article presents another approach to…
Quantum computers are expected to be able to solve mathematical problems that cannot be solved using conventional computers. Many of these problems are of practical importance, especially in the areas of cryptography and secure…