Skip Navigation



Journal of Logic and Computation Advance Access published online on February 27, 2009
Journal of Logic and Computation, doi:10.1093/logcom/exp008
This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Bertini, C.
Right arrow Articles by Leporini, R.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2009. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Original Papers

An Axiomatic System Suggested by Quantum Computation1

C. Bertini and R. Leporini

Dipartimento di Matematica, Statistica, Informatica e Applicazioni, Università degli Studi di Bergamo, Via dei Caniana 2, Bergamo, 24127, Italy.
E-mail: roberto.leporini{at}unibg.it; cesarino.bertini{at}unibg.it

Received 14 January 2009.

The theory of logical gates in quantum computation has suggested new forms of quantum logic, called quantum computational logics. The basic semantic idea is the following: the meaning of a sentence is identified with a quregister (a system of qubits in a pure state) or, more generally, with a mixture of quregisters (called qumix). Following an approach proposed by Domenech and Freytes, we apply residuated structures associated with fuzzy logic to develop certain aspects of information processing in quantum computing from a logical perspective. For this purpose, we introduce an axiomatic system whose natural interpretation is the irreversible quantum Poincaré algebra. Such a system allows to establish a completeness theorem.

Keywords: Quantum computation; quantum logic; quantum algebra; product Lukasiewicz logic; PMV algebra

1 This work has been supported by MIUR\PRIN project ‘Aspetti matematici e applicazioni emergenti degli automi e dei linguaggi formali’.



References

  1. Birkhoff G, von Neumann J. The logic of quantum mechanics. Annals of Mathematics (1936) 37:823–843.[CrossRef][Web of Science]
  2. Cattaneo G, Dalla Chiara ML, Giuntini R, Leporini R. Quantum computational structures. Mathematica Slovaca (2004) 54:87–108.
  3. Cignoli R, D’Ottaviano IML, Mundici D. Algebraic foundations of many-valued reasoning. (1999) Kluwer.
  4. Dalla Chiara ML, Giuntini R, Leporini R. Logics from quantum computation. International Journal of Quantum Information (2005) 3:293–337.[CrossRef][Web of Science]
  5. Domenech G, Freytes H. Fuzzy propositional logic associated with quantum computational gates. International Journal of Theoretical Physics (2006) 45:237–270.[Web of Science]
  6. Gudder S. Quantum computational logic. International Journal of Theoretical Physics (2003) 42:39–47.[CrossRef][Web of Science]
  7. Hajek P. Metamathematics of Fuzzy Logic (1998) Kluwer.
  8. Hajek P, Godo L, Esteva F. A complete many-valued logic with product conjunction. Archive for Mathematical Logic (1996) 35:1–19.[Web of Science]
  9. Ledda A, Konig M, Paoli F, Giuntini R. MV algebras and quantum computation. Studia Logica (2006) 82:245–270.[CrossRef]
  10. Montagna F. An algebraic approach to propositional fuzzy logic. Journal of Logic, Language and Information (2000) 9:91–124.[CrossRef]
  11. Petri CA. Grundsätzliches zur Beschreibung diskreter Prozesse. In: Proceedings of the 3rd Colloquium über Automatentheorie (Hannover, 1965)—Genrich HJ, Thiagarajan PS, eds. (1967) Birkhäuser Verlag. 121–140. English version: Fundamentals of the Representation of Discrete Processes. ISF Report 82.04 (1982).
  12. Qiu DW. Automata theory based on quantum logic: some characterizations. Information and Computation (2004) 190:179–195.[CrossRef][Web of Science]
  13. Rawling JP, Selesnick SA. Orthologic and quantum logic: models and computational elements. Journal of the ACM (2000) 47:721–751.[CrossRef][Web of Science]
  14. Selesnick SA. Foundation for quantum computing. International Journal of Theoretical Physics (2003) 42:383–426.[CrossRef][Web of Science]
  15. Toffoli T. Reversible computing. In: Automata, Languages and Programming—de Bakker JW, van Leeuwen J, eds. (1980) Springer. 632–644. Available as TechnicalMemo MIT/LCS/TM-151, MIT Laboratory for Computer Science, February 1980.
  16. Ying MS. Automata theory based on quantum logic I. International Journal of Theoretical Physics (2000) 39:985–995.[CrossRef][Web of Science]
  17. Ying MS. Automata theory based on quantum logic II. International Journal of Theoretical Physics (2000) 39:2545–2557.[CrossRef][Web of Science]
  18. Zawirski Z. Relation of many–valued logic to probability calculus. (1934) (in Polish, original title: Stosunek logiki wielowartosciowej do rachunku prawdopodobienstwa), Poznanskie Towarzystwo Przyjaciól Nauk.

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?



This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Bertini, C.
Right arrow Articles by Leporini, R.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?