Abstract. The main goal of this paper is to apply rewriting termination technology —enjoying a quite mature set of termination results and tools— to the problem of proving auto...
: We study the computational strength of quantum particles (each of finite dimensionality) arranged on a line. First, we prove that it is possible to perform universal adiabatic q...
Dorit Aharonov, Daniel Gottesman, Sandy Irani, Jul...
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
Swarm is a computational model which extends the UNITY model in three important ways: (1) UNITY’s fixed set of variables is replaced by an unbounded set of tuples which are add...