{
  "annotation_id": "c9129851-6e4f-46d1-957f-b5cff2f53495",
  "date_created": "2026-03-02T18:02:27.661000Z",
  "date_modified": "2026-03-02T18:02:27.661000Z",
  "file_hash": "8c2f5e7f69698d94a81f7d31ffabf870b05ffa45a74351fa4f629dcbad86f5e3",
  "private": false,
  "record": {
    "abstract": "We present an original model of paraconsistent Turing machines (PTMs), a\ngeneralization of the classical Turing machines model of computation using a\nparaconsistent logic. Next, we briefl y describe the standard models of quantum\ncomputation: quantum Turing machines and quantum circuits, and revise quantum\nalgorithms to solve the so-called Deutsch\u0027s problem and Deutsch-Jozsa problem.\nThen, we show the potentialities of the PTMs model of computation simulating\nthe presented quantum algorithms via paraconsistent algorithms. This way, we\nshow that PTMs can resolve some problems in exponentially less time than any\nclassical deterministic Turing machine. Finally, We show that it is not\npossible to simulate all characteristics (in particular entangled states) of\nquantum computation by the particular model of PTMs here presented, therefore\nwe open the possibility of constructing a new model of PTMs by which it is\nfeasible to simulate such states.",
    "arxiv_id": "quant-ph/0607100",
    "authors": [
      "Juan C. Agudelo",
      "Walter Carnielli"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Quantum Computation via Paraconsistent Computation",
    "url": "https://arxiv.org/abs/quant-ph/0607100"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "b6fbbec7-361b-4e2b-878c-aabe8742c463",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}