Quantum Computation via Paraconsistent Computation

Details Quantum Computation via Paraconsistent Computation Quantum Computation via Paraconsistent Computation

2006-07-14

arxiv.org/abs/quant-ph/0607100v1

Physics

Quantum Physics

Scientific paper

We present an original model of paraconsistent Turing machines (PTMs), a generalization of the classical Turing machines model of computation using a paraconsistent logic. Next, we briefl y describe the standard models of quantum computation: quantum Turing machines and quantum circuits, and revise quantum algorithms to solve the so-called Deutsch's problem and Deutsch-Jozsa problem. Then, we show the potentialities of the PTMs model of computation simulating the presented quantum algorithms via paraconsistent algorithms. This way, we show that PTMs can resolve some problems in exponentially less time than any classical deterministic Turing machine. Finally, We show that it is not possible to simulate all characteristics (in particular entangled states) of quantum computation by the particular model of PTMs here presented, therefore we open the possibility of constructing a new model of PTMs by which it is feasible to simulate such states.

Affiliated with

Also associated with

No associations

Rating

Quantum Computation via Paraconsistent Computation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum Computation via Paraconsistent Computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Computation via Paraconsistent Computation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-96780