Related papers: On the completeness of quantum computation models
Universal memcomputing machines (UMMs) [IEEE Trans. Neural Netw. Learn. Syst. 26, 2702 (2015)] represent a novel computational model in which memory (time non-locality) accomplishes both tasks of storing and processing of information. UMMs…
The theory of quantum computation is presented in a self contained way from a computer science perspective. The basics of classical computation and quantum mechanics is reviewed. The circuit model of quantum computation is presented in…
The mathematical notion of incompleteness (eg of rational numbers, Turing-computable functions, and arithmetic proof) does not play a key role in conventional physics. Here, a reformulation of the kinematics of quantum theory is attempted,…
This paper examines conceptual models and their application to computational thinking. Computational thinking is a fundamental skill for everybody, not just for computer scientists. It has been promoted as skills that are as fundamental for…
The nature of quantum computation is discussed. It is argued that, in terms of the amount of information manipulated in a given time, quantum and classical computation are equally efficient. Quantum superposition does not permit quantum…
We establish a fundamental impossibility result for a `perfect hypervisor', one that (1) preserves every observable behavior of any program exactly as on bare metal and (2) adds zero timing or resource overhead. Within this model we prove…
There are several forms of irreducibility in computing systems, ranging from undecidability to intractability to nonlinearity. This paper is an exploration of the conceptual issues that have arisen in the course of investigating speed-up…
The notion of quantum-mechanical completeness is adapted to situations where the only adequate description is in terms of quantum field theory in curved space-times. It is then shown that Schwarzschild black holes, although geodesically…
We consider the quantum processor based on a chain of trapped ions to propose an architecture wherein the motional degrees of freedom of trapped ions (position and momentum) could be exploited as the computational Hilbert space. We adopt a…
Algebraic approach to quantum non - separability is applied to the case of two qubits. It is based on the partition of the algebra of observables into independent subalgebras and the tensor product structure of the Hilbert space is not…
Based on Gandy's principles for models of computation we give category-theoretic axioms describing locally deterministic updates to finite objects. Rather than fixing a particular category of states, we describe what properties such a…
A scheme of universal quantum computation on a chain of qubits is described that does not require local control. All the required operations, an Ising-type interaction and spatially uniform simultaneous one-qubit gates, are…
Quantum channel capacities are fundamental to quantum information theory. Their definition, however, does not limit the computational resources of sender and receiver. In this work, we initiate the study of computational quantum capacities.…
Fault-tolerant quantum computers offer the promise of dramatically improving machine learning through speed-ups in computation or improved model scalability. In the near-term, however, the benefits of quantum machine learning are not so…
Causality serves as an abstract notion of time for concurrent systems. A computation is causal, or simply valid, if each observation of a computation event is preceded by the observation of its causes. The present work establishes that this…
There is good evidence that quantum computers are more powerful than classical computers, and that various simple modifications of quantum theory yield computational power that is dramatically greater still. However, these modifications…
Quantum theory is a well-defined local theory with a clear interpretation. No "measurement problem" or any other foundational matters are waiting to be settled.
A preliminary overview of measurement-based quantum computation in the setting of symmetry and topological phases of quantum matter is given. The underlying mechanism for universal quantum computation by teleportation or symmetry are…
An intense effort is being made today to build a quantum computer. Instead of presenting what has been achieved, I invoke here analogies from the history of science in an attempt to glimpse what the future might hold. Quantum computing is…
Ever since entanglement was identified as a computational and cryptographic resource, researchers have sought efficient ways to tell whether a given density matrix represents an unentangled, or separable, state. This paper gives the first…