相关论文: 2-State 3-Symbol Universal Turing Machines Do Not …

A proof of quantumness is a protocol through which a classical machine can test whether a purportedly quantum device, with comparable time and memory resources, is performing a computation that is impossible for classical computers.…

We investigate the universal cover of a topological group that is not necessarily connected. Its existence as a topological group is governed by a Taylor cocycle, an obstruction in 3-cohomology. Alternatively, it always exists as a…

Classical models of computation traditionally resort to halting schemes in order to enquire about the state of a computation. In such schemes, a computational process is responsible for signalling an end of a calculation by setting a halt…

We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating that "a real is c.e. and random iff it is the halting…

Quantum theory demands that, in contrast to classical physics, not all properties can be simultaneously well defined. The Heisenberg Uncertainty Principle is a manifestation of this fact. Another important corollary arises that there can be…

It is well known that the kind of P systems involved in the definition of the P conjecture is able to solve problems in the complexity class $\mathbf{P}$ by leveraging the uniformity condition. Here we show that these systems are indeed…

We present Schmidt decomposition formulas for mutually orthogonal two-qubit pure states and classify orthonormal sets based on their entanglement structure. First, we derive explicit Schmidt decomposition formulas for any pure state and…

We show that the state-independent violation of inequalities for noncontextual hidden variable theories introduced in [Phys. Rev. Lett. 101, 210401 (2008)] is universal, i.e., occurs for any quantum mechanical system in which…

The problem of finding perfect Euler cuboids or proving their non-existence is an old unsolved problem in mathematics. The third cuboid conjecture is the last of the three propositions suggested as intermediate stages in proving the…

Majorana stars, the $2j$ spin coherent states that are orthogonal to a spin-$j$ state, offer a visualization of general quantum states and may disclose deep structures in quantum states and their evolutions. In particular, the genuine…

Contrary to the classical case, the relation between quantum programming languages and quantum Turing Machines (QTM) has not being fully investigated. In particular, there are features of QTMs that have not been exploited, a notable example…

Multi-stack machines and Turing machines can simulate to each other. In this note, we give a succinct definition of multi-stack machines, and from this definition it is clearly seen that pushdown automata and deterministic finite automata…

I show that physical devices that perform observation, prediction, or recollection share an underlying mathematical structure. I call devices with that structure "inference devices". I present a set of existence and impossibility results…

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 prove that the 2D Ising model is complete in the sense that the partition function of any classical q-state spin model (on an arbitrary graph) can be expressed as a special instance of the partition function of a 2D Ising model with…

Two thought experiments are analyzed, revealing that the quantum state of the universe does not contain definitive evidence of the wavefunction collapse. The first thought experiment shows that unitary quantum evolution alone can account…

We define a family of generalizations of $\operatorname{SL}_2$-tilings to higher dimensions called $\boldsymbol{\epsilon}$-$\operatorname{SL}_2$-tilings. We show that, in each dimension 3 or greater,…

We show that universal quantum computation can be achieved in the standard pure-state circuit model while, at any time, the entanglement entropy of all bipartitions is small---even tending to zero with growing system size. The result is…

Manin, Feynman, and Deutsch have viewed quantum computing as a kind of universal physical simulation procedure. Much of the writing about quantum logic circuits and quantum Turing machines has shown how these machines can simulate an…

Recently, it has been argued that quantum mechanics is a complete theory, and that different quantum states do necessarily correspond to different elements of reality, under the assumptions that quantum mechanics is correct and that…