相关论文: Algebra, Logic and Qubits: Quantum Abacus
The Weyl algebra,- the usual C*-algebra employed to model the canonical commutation relations (CCRs), has a well-known defect in that it has a large number of representations which are not regular and these cannot model physical fields.…
We explicitly construct an Archimedean order unit space whose state space is affinely isomorphic to the set of quantum commuting correlations. Our construction only requires fundamental techniques from the theory of order unit spaces and…
We study the leading corrections to the emergent canonical commutation relations arising in the statistical mechanics of matrix models, by deriving several related Ward identities, and give conditions for these corrections to be small. We…
The operator algebra of fermionic modes is isomorphic to that of qubits, the difference between them is twofold: the embedding of subalgebras corresponding to mode subsets and multiqubit subsystems on the one hand, and the parity…
This paper proposed a quantum analogue of classical queue automata by using the definition of the quantum Turing machine and quantum finite-state automata. However, quantum automata equipped with storage medium of a stack has been…
The quon algebra is an approach to particle statistics in order to provide a theory in which the Pauli exclusion principle and Bose statistics are violated by a small amount. The quons are particles whose annihilation and creation operators…
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 present a survey of recent results, scattered in a series of papers that appeared during past five years, whose common denominator is the use of cubic relations in various algebraic structures. Cubic (or ternary) relations can represent…
The Carroll algebra is constructed as the $c\to0$ limit of the Poincare algebra and is associated to symmetries on generic null surfaces. In this paper, we begin investigations of Carrollian fermions or fermions defined on generic null…
Quantum devices may overcome limitations of classical computers in studies of nuclear structure functions and parton Wigner distributions of protons and nuclei. In this talk, we discuss a worldline approach to compute nuclear structure…
Recent studies on quantum computing algorithms focus on excavating features of quantum computers which have potential for contributing to computational model enhancements. Among various approaches, quantum annealing methods effectively…
It is proved that a quantum computer with fixed and permanent interaction of diagonal type between qubits proposed in the work quant-ph/0201132 is universal. Such computer is controlled only by one-qubit quick transformations, and this…
The mathematical formalism for linear quantum field theory on curved spacetime depends in an essential way on the assumption of global hyperbolicity. Physically, what lie at the foundation of any formalism for quantization in curved…
We consider algebras of $m\times m\times m$-cubic matrices (with $m=1,2,\dots$). Since there are several kinds of multiplications of cubic matrices, one has to specify a multiplication first and then define an algebra of cubic matrices…
It often goes unnoticed that, even for a finite number of degrees of freedom, the canonical commutation relations have many inequivalent irreducible unitary representations; the free particle and a particle in a box provide examples that…
Using von Neumann algebras, we extend the theory of quantum computation on a graph to a theory of computation on an arbitrary topological space.
In the last few years, theoretical study of quantum systems serving as computational devices has achieved tremendous progress. We now have strong theoretical evidence that quantum computers, if built, might be used as a dramatically…
One-dimensional quantum cellular automata (QCA) consist in a line of identical, finite dimensional quantum systems. These evolve in discrete time steps according to a local, shift-invariant unitary evolution. By local we mean that no…
We provide algebraic criteria for the unitarity of linear quantum cellular automata, i.e. one dimensional quantum cellular automata. We derive these both by direct combinatorial arguments, and by adding constraints into the model which do…
We introduce the notion of the full quiver of a representation of an algebra, which is a cover of the (classical) quiver, but which captures properties of the representation itself. Gluing of vertices and of arrows enables one to study…