Related papers: Probabilistic Turing Machine and Landauer Limit
We investigate the relation between the scaling of block entropies and the efficient simulability by Matrix Product States (MPS), and clarify the connection both for von Neumann and Renyi entropies (see Table I). Most notably, even states…
The simulation of quantum systems is a task for which quantum computers are believed to give an exponential speedup as compared to classical ones. While ground states of one-dimensional systems can be efficiently approximated using Matrix…
This paper shows how to compute, for probabilistic hybrid systems, the clock approximation and linear phase-portrait approximation that have been proposed for non probabilistic processes by Henzinger et al. The techniques permit to define a…
A theory of one-tape (one-head) linear-time Turing machines is essentially different from its polynomial-time counterpart since these machines are closely related to finite state automata. This paper discusses structural-complexity issues…
The tube model is a central concept in polymer physics, and allows to reduce the complex many-filament problem of an entangled polymer solution to a single filament description. We investigate the probability distribution function of…
We determine the complexity of counting models of bounded size of specifications expressed in Linear-time Temporal Logic. Counting word models is #P-complete, if the bound is given in unary, and as hard as counting accepting runs of…
Landauer's Principle relates entropy decrease and heat dissipation during logically irreversible processes. Most theoretical justifications of Landauer's Principle either use thermodynamic reasoning or rely on specific models based on…
The power of real-time Turing machines using sublinear space is investigated. In contrast to a claim appearing in the literature, such machines can accept non-regular languages, even if working in deterministic mode. While maintaining a…
Beginning with Turing's seminal work in 1950, artificial intelligence proposes that consciousness can be simulated by a Turing machine. This implies a potential theory of everything where the universe is a simulation on a computer, which…
We consider a variant of Glauber dynamics of Ising spins on a one-dimensional lattice, where each spin flips according to the relative state of the spin to its left. Moreover, each bond allows for two rates; flips which equalize nearest…
We consider a Glauber dynamics associated with the Ising model on a large two-dimensional box with with minus boundary conditions and in the limit of a vanishing positive external magnetic field. The volume of this box increases…
We investigate the correspondence between the time and space recognition complexity of languages. For this purpose, we will code the long-continued computations of deterministic two-tape Turing machines by the relatively short-length…
We explore the relationship between Turing completeness and topological entropy of dynamical systems. We first prove that a natural class of Turing machines that we call "branching Turing machines" (which includes most of the known examples…
We consider Glauber dynamics of classical spin systems of Ising type in the limit when the temperature tends to zero in finite volume. We show that information on the structure of the most profound minima and the connecting saddle points of…
We extend in a natural way the operation of Turing machines to infinite ordinal time, and investigate the resulting supertask theory of computability and decidability on the reals. The resulting computability theory leads to a notion of…
Quantum mechanical unitarity in our universe is challenged both by the notion of the big bang, in which nothing transforms into something, and the expansion of space, in which something transforms into more something. This motivates the…
The time evolution of a bounded quantum system is considered in the framework of the orthogonal, unitary and symplectic circular ensembles of random matrix theory. For an $N$ dimensional Hilbert space we prove that in the large $N$ limit…
We consider systems of stochastic evolutionary equations of the $p$-Laplace type. We establish convergence rates for a finite-element based space-time approximation, where the error is measured in a suitable quasi-norm. Under natural…
Time evolution and scattering simulation in phenomenological models are of great interest for testing and validating the potential for near-term quantum computers to simulate quantum field theories. Here, we simulate one-particle…
We assess two different non-equilibrium quantum Landauer bounds: the traditional approach based on the change in entropy, referred to as the `entropic bound', and one based on the details of the dynamical map, referred to as the…