1BASIC LOGIC AND QUANTUM ENTANGLEMENT

P. A. Zizzi

Published Nov 10, 2006• 12 citations

Abstract

As it is well known, quantum entanglement is one of the most important features of quantum computing, as it leads to massive quantum parallelism, hence to exponential computational speed-up. In a sense, quantum entanglement is considered as an implicit property of quantum computation itself. But...can it be made explicit? In other words, is it possible to find the connective "entanglement" in a logical sequent calculus for the machine language? And also, is it possible to "teach" the quantum computer to "mimic" the EPR "paradox"? The answer is in the affirmative, if the logical sequent calculus is that of the weakest possible logic, namely Basic logic. A weak logic has few structural rules. But in logic, a weak structure leaves more room for connectives (for example the connective "entanglement"). Furthermore, the absence in Basic logic of the two structural rules of contraction and weakening corresponds to the validity of the no-cloning and no-erase theorems, respectively, in quantum computing.

Related papers

Basic logic and quantum entanglement

P A Zizzi

As it is well known, quantum entanglement is one of the most important features of quantum computing, as it leads to massive quantum parallelism, hence to exponential computational speed-up. In a sense, quantum entanglement is considered as an implicit property of quantum computation itself. But... can it be made explicit? In other words, is it possible to find the connective "entanglement" in a logical sequent calculus for the machine language? And also, is it possible to "teach" the quantum computer to "mimic" the EPR "paradox"? The answer is in the affirmative, if the logical sequent calculus is that of the weakest possible logic, namely Basic logic. - A weak logic has few structural rules. But in logic, a weak structure leaves more room for connectives (for example the connective "entanglement"). Furthermore, the absence in Basic logic of the two structural rules of contraction and weakening corresponds to the validity of the no-cloning and no-erase theorems, respectively, in quantum computing.

arXiv:quant-ph/0611119Journal of Physics Conference SeriesMay 1, 20074 citations

Sequent Calculus and Quantum Parallelism

Giulia Battilotti

In the last years, quantum computational logics have been developed in order to describe the logical setting of quantum computation [1]. An important challenge is the development of proof theoretical tools for quantum computation, so that the physical process of computation can correspond to a logical process of computation. In particular, the challenge is that quantum computational speed up, due to superposition and entanglement, can find an explanation in terms of logical proofs. The object of our research is a sequent calculus developed in the framework of basic logic, that is a logical platform to study extensional logics, including quantum logics [2, 3]. In basic logic, logical connectives and their rules are the result of importing suitable links at the metalevel into the object level. We suppose that a particular kind of dynamics between the object level and the metalevel is created when considering a quantum system rather than a classical one. This is due to a specific treatment of variables, that, in our view, can create the logical setting for a holistic, rather than compositional, treatment of information, proper of entangled states [4]. Then we develop a predicative sequent calculus. In it, superposition is built by quantifying a propo-sition, associated with a quantum system, on a first order domain determined by the experiments on such system. Then a convenient treatment of variables can create dynamically entangled states in logical

Jan 7, 20150 citations

Quantum Simulators and Quantum Repeaters

Mladen Pavičić

Two elements of quantum computation are considered: quantum computer logic and quantum repeater. It is shown that the quantum gate logic does have two different models and that it is therefore ambiguous. It is also shown that without additional conditions imposed on quantum gates one cannot arrive at a general quantum computer machine language. In absence of such conditions quantum entanglement remains a selection protocol which makes quantum computer equivalent to many photon intensity interferometry. As an example for such an entanglement we discuss a quantum optical repeater.

Fortschritte der PhysikMay 1, 20000 citations

A Paraconsistent Approach to Quantum Computing

Juan C. Agudelo, Walter Alexandre Carnielli

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.

Feb 1, 20080 citations

An axiomatization of quantum computational Logic

Vladimir L. Vasyukov

One of the logical proposals that arise from quantum computation is the idea to use the quantum theoretical formalism to represent parallel reasoning. To this aim a quantum computation is considered by means of convenient unitary operators assuming arguments and values in particular sets of qubit systems. Isolating some important unitary operators that have a special role in quantum computation (logical gates or quregisters) we obtain an opportunity to yield the language of Quantum Computational Logic (QCL) (cf. [Cattaneo et al., 2003; Cattaneo et al., 2004; Dalla Chiara et al., 2004]). The basic concept of the semantics of this language is the notion of quantum computational realization such that the meaning associated to any sentence is a quregister. Unlike the semantic of a standard quantum logic QCL-conjunction and QCL-disjunction do not correspond to lattice operations since they are not generally idempotent. Moreover, in QCL the weak distributivity principle breaks down and both the excluded middle and the non contradiction principles are violated. Finally, the axiomatizability of QCL is still an open problem. In the paper an axiomatization of QCL is proposed construing it as a kind of so-called Goldblatt’s binary logic. Some metalogical theorems (paraconsistency and completeness) are proved.

Logical InvestigationsJan 1, 20230 citations

From Quantum Metalanguage to the Logic of Qubits

Paola Zizzi

The main aim of this thesis is to look for a logical deductive calculus (we will adopt sequent calculus, originally introduced in Gentzen, 1935), which could describe quantum information and its properties. More precisely, we intended to describe in logical terms the formation of the qubit (the unit of quantum information) which is a particular linear superposition of the two classical bits 0 and 1. To do so, we had to introduce the new connective "quantum superposition", in the logic of one qubit, Lq, as the classical conjunction cannot describe this quantum link.

arXiv:1003.5976Mar 31, 201014 citations