Logical and algebraic structures from Quantum Computation

The main motivation for this thesis is given by the open problems regarding the axiomatisation of quantum computational logics. This thesis will be structured as follows: in Chapter 2 we will review some basics of universal algebra and functional analysis. In Chapters 3 through 6 the fundamentals of quantum gate theory will be produced. In Chapter 7 we will introduce quasi-MV algebras, a formal study of a suitable selection of algebraic operations associated with quantum gates. In Chapter 8 quasi-MV algebras will be expanded by a unary operation hereby dubbed square root of the inverse, formalising a quantum gate which allows to induce entanglement states. In Chapter 9 we will investigate some categorial dualities for the classes of algebras introduced in Chapters 7 and 8. In Chapter 10 the discriminator variety of linear Heyting quantum computational structures, an algebraic counterpart of the strong quantum computational logic, will be considered. In Chapter 11, we will list some open problems and, at the same time, draw some tentative conclusions. Lastly, in Chapter 12 we will provide a few examples of the previously investigated structures.

Grantor dc:publisher

Università degli Studi di Cagliari

Year dc:date

2008

Author dc:creator

• LEDDA, ANTONIO

• Quantum Computation
• Quasi-MV Algebras
• Settore M-FIL/02 - Logica e Filosofia della Scienza

Language dc:language

eng

Handle dc:identifier

http://hdl.handle.net/11584/265966

OAI identifier oai:identifier

oai:iris.unica.it:11584/265966