Related papers: A local model of quantum Turing machines
Foundations of the theory of quantum Turing machines are investigated. The protocol for the preparation and the measurement of quantum Turing machines is discussed. The local transition functions are characterized for fully general quantum…
Foundations of the notion of quantum Turing machines are investigated. According to Deutsch's formulation, the time evolution of a quantum Turing machine is to be determined by the local transition function. In this paper, the local…
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 success of tensor network approaches in simulating strongly correlated quantum systems crucially depends on whether the many body states that are relevant for the problem can be encoded in a local tensor network. Despite numerous…
Modeling joint probability distributions over sequences has been studied from many perspectives. The physics community developed matrix product states, a tensor-train decomposition for probabilistic modeling, motivated by the need to…
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 investigate the iteration of a sequence of local and pair unitary transformations, which can be interpreted to result from a Turing-head (pseudo-spin $S$) rotating along a closed Turing-tape ($M$ additional pseudo-spins). The dynamical…
The status of locality in quantum mechanics is analyzed from a nonstandard point of view. It is assumed that quantum states are relative, they depend on and are defined with respect to some bigger physical system which contains the former…
Machine learning is a promising application of quantum computing, but challenges remain as near-term devices will have a limited number of physical qubits and high error rates. Motivated by the usefulness of tensor networks for machine…
Tensor network algorithms seek to minimize correlations to compress the classical data representing quantum states. Tensor network algorithms and similar tools---called tensor network methods---form the backbone of modern numerical methods…
Quantum state tomography is a daunting challenge of experimental quantum computing even in moderate system size. One way to boost the efficiency of state tomography is via local measurements on reduced density matrices, but the…
Classical machine learning theory and theory of quantum computations are among of the most rapidly developing scientific areas in our days. In recent years, researchers investigated if quantum computing can help to improve classical machine…
Entanglement allows for the nonlocality of quantum theory, which is the resource behind device-independent quantum information protocols. However, not all entangled quantum states display nonlocality, and a central question is to determine…
For quantum Turing machines we present three elements: Its components, its time evolution operator and its local transition function. The components are related with the components of deterministic Turing machines, the time evolution…
Quantum technologies are increasingly pervasive, underpinning the operation of numerous electronic, optical and medical devices. Today, we are also witnessing rapid advancements in quantum computing and communication. However, access to…
The present exploratory paper deals with tensor products in the locality framework {developed in previous work}, a natural setting for an algebraic formulation of the locality principle in quantum field theory. Locality tensor products of…
Recently, several claims have been made that certain fundamental problems of distributed computing, including Leader Election and Distributed Consensus, begin to admit feasible and efficient solutions when the model of distributed…
An approach to the simulation of locally interacting systems is demonstrated and assayed. The proposal is built upon the concept of folding of bosonic modes previously introduced in the context of linear dynamics and can be seen as an…
We study the conditions under which Matrix Product States (MPS) or Matrix Product Operators are exact eigenvectors of an extensive local operator, such as a Hamiltonian. By suitably choosing the local operator, this covers a wide range of…
Quantum computers will work by evolving a high tensor power of a small (e.g. two) dimensional Hilbert space by local gates, which can be implemented by applying a local Hamiltonian H for a time t. In contrast to this quantum engineering,…