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

We show that, given a general mixed state for a quantum system, there are no physical means for {\it broadcasting\/} that state onto two separate quantum systems, even when the state need only be reproduced marginally on the separate…

Turing Machines are universal computing machines in theory. It has been a long debate whether Turing Machines can simulate the consciousness mind behaviors in the materialistic universe. Three different hypotheses come out of such debate,…

We describe a method to axiomatize computations in deterministic Turing machines. When applied to computations in non-deterministic Turing machines, this method may produce contradictory (and therefore trivial) theories, considering…

In this first of two papers, strong limits on the accuracy of physical computation are established. First it is proven that there cannot be a physical computer C to which one can pose any and all computational tasks concerning the physical…

Arbitrary quantum states cannot be copied. In fact, to make a copy we must provide complete information about the system. However, can a quantum system self-replicate? This is not answered by the no-cloning theorem. In the classical…

The hypercomputers compute functions or numbers, or more generally solve problems or carry out tasks, that cannot be computed or solved by a Turing machine. Several numerical simulations of a possible hypercomputational algorithm based on…

We present an original model of paraconsistent Turing machines (PTMs), a generalization of the classical Turing machines model of computation using a paraconsistent logic. Next, we briefl y describe the standard models of quantum…

Entanglement is a purely quantum mechanical phenomenon and thus it has no classical analog. On the other hand, coherence is a well-known phenomenon in classical optics and in quantum mechanics. Recent research shows that quantum coherence…

We show (i) the existence of universal resource states for a certain class of linear Hamiltonians and (ii) the uselessness of highly entangled states for quantum metrology of linear Hamiltonians. We also show that random pure states are…

We study the universality of forms of degrees greater than 2 over rings of integers of totally real number fields. We show that such universal forms always exist, but cannot be characterized by any variant of the 290-Theorem of…

A proof is given, which relies on the commutator algebra of the unitary Lie groups, that quantum gates operating on just two bits at a time are sufficient to construct a general quantum circuit. The best previous result had shown the…

Validation of a presumably universal theory, such as quantum mechanics, requires a quantum mechanical description of systems that carry out theoretical calculations and experiments. The description of quantum computers is under active…

In this note, we give a new nonexistence result of ternary extremal self-dual codes.

It is well known that it is impossible to clone an arbitrary quantum state. However, this inability does not lead directly to no-cloning of quantum coherence. Here, we show that it is impossible to clone the coherence of an arbitrary…

This paper establishes a lower bound on the number of states necessary in the worst case to simulate an $n$-state two-way nondeterministic finite automaton (2NFA) by a one-way unambiguous finite automaton (UFA). It is proved that for every…

We clarify the confusion, misunderstanding and misconception that the physical finiteness of the universe, if the universe is indeed finite, would rule out all hypercomputation, the kind of computation that exceeds the Turing computability,…

Global control offers a promising route to scalable quantum computing. A recent conjecture by Hu et al. (arXiv:2508.19075) proposes that any connected qubit graph equipped with global Ising-type interactions and tunable global transverse…

We establish three impossibility results regarding our knowledge of the quantum state of the universe. Suppose the universal quantum state is a typical unit vector in a high-dimensional subspace $\mathscr{H}_0$ of Hilbert space…

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

How to find universal sets quantum gates (gates whose composition can form any othergate within a given range) is an important part of the development of quantum computation science that has been explored in the past with success. However,…