A Paraconsistent Approach to Quantum Computing
Juan C. Agudelo, Walter Alexandre Carnielli · 2008
We propose a method to define axiomatic theories for deterministic Turing machine computations. This method, when applied to axiomatizing computations in non-deterministic Turing machines, produces (in some cases) contradictory theories, therefore trivial theories (considering classical logic as the underlying logic). Substituting in such theories the underlying logic by the paraconsistent logic LFI1 ∗ permits us to define a new model of computation which we call paraconsistent Turing machine. We show that this initial model of computation allows the simulation of important quantum computing features. In particular, it allows to simulate the quantum solution of the well-known Deutsch’s and Deutsch-Jozsa problems. However, we show that this initial model of computation does not adequately represent the notion of entangled states, a key feature in quantum computing. In this way, the construction is refined by defining a paraconsistent logic with a connective expressing entangled states in a logical fashion, and this logic is used to define a more sharpened model of paraconsistent Turing machines, better approaching the quantum computing features. Finally, we define complexity classes for the models introduced and establish some surprising relationships with classical complexity classes.