Related papers: 2-State 3-Symbol Universal Turing Machines Do Not …
Consider a qubit-qutrit ($2 \times 3$) composite state space. Let $C(\{1}{2}I_2, \{1}{3}I_3)$ be a convex set of all possible states of composite system whose marginals are given by $\{1}{2}I_2$ and $\{1}{3}I_3$ in two and three dimensional…
By closely rereading the original Turing's 1936 article, we can gain insight about that it is based on the claim to have defined a number which is not computable, arguing that there can be no machine computing the diagonal on the…
Recently, it has been argued that no extension of quantum theory can have improved predictive power under a strong assumption of free choice of the experimental settings and validity of quantum mechanics. Here, under a different free choice…
We start by an introduction to the basic concepts of computability theory and the introduction of the concept of Turing machine and computation universality. Then se turn to the exploration of trade-offs between different measures of…
Pure states are very important in any theory since they represent states of maximal information about the system within the theory. Here, we show that no non-trivial (not local realistic) extremal states (boxes) of general no-signaling…
The diagonal method is often used to show that Turing machines cannot solve their own halting problem. There have been several recent attempts to show that this method also exposes either contradiction or arbitrariness in other theoretical…
In this article, we study an opposite problem of universal quantum state comparison, that is unambiguous determining whether multiple unknown quantum states from a Hilbert space are orthogonal or not. We show that no unambiguous quantum…
The 2-block intersection graph (2-BIG) of a twofold triple system (TTS) is the graph whose vertex set is composed of the blocks of the TTS and two vertices are joined by an edge if the corresponding blocks intersect in exactly two elements.…
The $\textbf{P}$ vs. $\textbf{NP}$ problem is an important problem in contemporary mathematics and theoretical computer science. Many proofs have been proposed to this problem. This paper proposes a theoretic proof for $\textbf{P}$ vs.…
We prove that universal quantum computation is possible using only (i) the physically natural measurement on two qubits which distinguishes the singlet from the triplet subspace, and (ii) qubits prepared in almost any three different…
In a recent historical overview, Cristian S. Calude, Elena Calude, and Solomon Marcus identify eight stages in the development of the concept of a mathematical proof in support of an ambitious conjecture: we can express classical…
In this note we show that any logic gates in a quantum computer is informationally dependent on another quantum logic gate.
This paper explores and clarifies several issues surrounding Zeno machines and the issue of running a Turing machine for infinite time. Without a minimum hypothetical bound on physical conditions, any magical machine can be created, and…
In conventional quantum mechanics, quantum no-deleting and no-cloning theorems indicate that two different and nonorthogonal states cannot be perfectly and deterministically deleted and cloned, respectively. Here, we investigate the quantum…
We consider the problem of deriving the no-signaling condition from the assumption that, as seen from a complexity theoretic perspective, the universe is not an exponential place. A fact that disallows such a derivation is the existence of…
We establish the non-existence of a universal Hadamard gate for arbitrary unknown qubits, by considering two different principles; namely, no-superluminal signalling and non-increase of entanglement under LOCC. It is also shown that these…
No-cloning theorem is fundamental for quantum mechanics and for quantum information science that states an unknown quantum state cannot be cloned perfectly. However, we can try to clone a quantum state approximately with the optimal…
In order to relate the probabilistic predictions of quantum theory uniquely to measurement results, one has to conceive of an ensemble of identically prepared copies of the quantum system under study. Since the universe is the total domain…
In classical computation, a "write-only memory" (WOM) is little more than an oxymoron, and the addition of WOM to a (deterministic or probabilistic) classical computer brings no advantage. We prove that quantum computers that are augmented…
We consider the problem of estimating the total probability of all symbols that appear with a given frequency in a string of i.i.d. random variables with unknown distribution. We focus on the regime in which the block length is large yet no…