Related papers: Paraconsistent Machines and their Relation to Quan…
Fault-tolerant quantum computations require alternating quantum and classical computations, where the classical computations prove vital in detecting and correcting errors in the quantum computation. Recently, interest in using these…
In this work, we present a logical formalism for reasoning about quantum systems in finite dimension. Contrary to the usual approach in quantum logic, our formalism is based classical first-order logic, which allows us to use the tools of…
Although the Turing-machine model of computation is widely used in computer science it is fundamentally inadequate as a foundation for the theory of modern scientific computation. The real-number model is described as an alternative.…
Particle-style token machines are a way to interpret proofs and programs, when the latter are written following the principles of linear logic. In this paper, we show that token machines also make sense when the programs at hand are those…
Recently Quantum Computation has generated a lot of interest due to the discovery of a quantum algorithm which can factor large numbers in polynomial time. The usefulness of a quantum com puter is limited by the effect of errors. Simulation…
Quantum computers facing chaos. Quantum parallelism allows to perform computation in a radically new manner. A quantum computer based on these new principles may resolve certain problems exponentially faster than a classical computer. We…
The Turing machine, as it was presented by Turing himself, models the calculations done by a person. This means that we can compute whatever any Turing machine can compute, and therefore we are Turing complete. The question addressed here…
Full formal descriptions of algorithms making use of quantum principles must take into account both quantum and classical computing components, as well as communications between these components. Moreover, to model concurrent and…
Classical transport equations with probabilistic initial conditions can be viewed as quantum systems. In a discrete version they are probabilistic automata. The time-local probabilistic information is encoded in a classical wave function.…
We explore in the framework of Quantum Computation the notion of {\em Computability}, which holds a central position in Mathematics and Theoretical Computer Science. A quantum algorithm for Hilbert's tenth problem, which is equivalent to…
Quantum computers are considered as a part of the family of the reversible, lineary-extended, dynamical systems (Quanputers). For classical problems an operational reformulation is given. A universal algorithm for the solving of classical…
An integrable anharmonic oscillator is presumably simulable by a classical computer and therefore by a quantum computer. An integrable anharmonic oscillator whose Hamiltonian is of normal type and quartic in the canonical coordinates is not…
Instead of producing quantum languages that are fit for current quantum computers, we build a language from standard classical assembler and augment it with quantum capabilities so that quantum algorithms become a subset of it. This paves…
Quantum Computing is a new and exciting field at the intersection of mathematics, computer science and physics. It concerns a utilization of quantum mechanics to improve the efficiency of computation. Here we present a gentle introduction…
Computational problems are classified into computable and uncomputable problems. If there exists an effective procedure (algorithm) to compute a problem then the problem is computable otherwise it is uncomputable. Turing machines can…
Computer science theory provides many different measures of complexity of a system including Kolmogorov complexity, logical depth, computational depth, and Levin complexity. However, these measures are all defined only for deterministic…
We use semi--classical and perturbation methods to establish the quantum theory of the Neumann model, and explain the features observed in previous numerical computations.
A non-classical, non-quantum theory, or NCQ, is any fully consistent theory that differs fundamentally from both the corresponding classical and quantum theories, while exhibiting certain features common to both. Such theories are of…
We propose an implementation of a quantum computer to solve Deutsch's problem, which requires exponential time on a classical computer but only linear time with quantum parallelism. By using a dual-rail qubit representation as a simple form…
Hybrid quantum-classical algorithms are central to much of the current research in quantum computing, particularly when considering the noisy intermediate-scale quantum (NISQ) era, with a number of experimental demonstrations having already…