Related papers: 2-State 3-Symbol Universal Turing Machines Do Not …
The world of mathematics is often considered abstract, with its symbols, concepts, and topics appearing unrelated to physical objects. However, it is important to recognize that the development of mathematics is fundamentally influenced by…
Which gates are universal for quantum computation? Although it is well known that certain gates on two-level quantum systems (qubits), such as the controlled-not (CNOT), are universal when assisted by arbitrary one-qubit gates, it has only…
We advance a Bayesian concept of 'intrinsic asymptotic universality' taking to its final conclusions previous conceptual and numerical work based upon a concept of a reprogrammability test and an investigation of the complex qualitative…
The paper explores known results related to the problem of identifying if a given program terminates on all inputs -- this is a simple generalization of the halting problem. We will see how this problem is related and the notion of proof…
It is shown that in two-state quantum theory, a generic quantum state can be described by a non-computable real number. In terms of this, the criterion for measurement outcome is simply and deterministically defined. This demonstration is…
We study the problem of universality in the anyon model described by the $SU(2)$ Witten-Chern-Simons theory at level $k$. A classic theorem of Freedman-Larsen-Wang states that for $k \geq 3, \ k \neq 4$, braiding of the anyons of…
A universal entangler (UE) is a unitary operation which maps all pure product states to entangled states. It is known that for a bipartite system of particles $1,2$ with a Hilbert space $\mathbb{C}^{d_1}\otimes\mathbb{C}^{d_2}$, a UE exists…
We outline the construction of a molecular system that could, in principle, implement a thermodynamically reversible Universal Turing Machine (UTM). By proposing a concrete-albeit idealised-design and operational protocol, we reveal…
We explore the sense in which the state of a physical system may or may not be regarded (an) observable in quantum mechanics. Simple and general arguments from various lines of approach are reviewed which demonstrate the following no-go…
We provide partial implementations of von Neumann's universal constructor and universal copier, starting out with three types of simple building blocks using minimal assumptions. Using the same principles, we also construct Turing machines.…
We introduce the zeta number, natural halting probability and natural complexity of a Turing machine and we relate them to Chaitin's Omega number, halting probability, and program-size complexity. A classification of Turing machines…
An algebraic representation of the Turing machines is given, where the configurations of Turing machines are represented by 4 order tensors, and the transition functions by 8 order tensors. Two types of tensor product are defined, one is to…
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…
We investigate the possibility of simulating partially entangled two qubit states by separable states of higher spins. First, we show that all partially entangled isotropic states can be simulated classically. We further investigate…
Thurston conjectured that a closed triangulated 3-manifold in which every edge has degree 5 or 6, and no two edges of degree 5 lie in a common 2-cell, has word-hyperbolic fundamental group. We establish Thurston's conjecture by proving that…
We investigate which entanglement resources allow universal measurement-based quantum computation via single-qubit operations. We find that any entanglement feature exhibited by the 2D cluster state must also be present in any other…
A resource-bounded version of the statement "no algorithm recognizes all non-halting Turing machines" is equivalent to an infinitely often (i.o.) superpolynomial speedup for the time required to accept any coNP-complete language and also…
A classical state-preparation device cannot generate states in relative superposition. We introduce classical models in which devices that are individually unable to generate states with relative superposition can be stochastically…
The superposition principle is one of the landmarks of quantum mechanics. The importance of quantum superpositions provokes questions about the limitations that quantum mechanics itself imposes on the possibility of their generation. In…
The notion of a qubit is ubiquitous in quantum information processing. In spite of the simple abstract definition of qubits as two-state quantum systems, identifying qubits in physical systems is often unexpectedly difficult. There are an…