Quantum computational logic with mixed states

In this paper we solve the problem how to axiomatize a system of quantum computational gates known as the Poincaré irreversible quantum computational system. A Hilbert-style calculus is introduced obtaining a strong completeness theorem. © 2013 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Detalles Bibliográficos
Publicado: 2013
Materias:
MV-algebras
PMV-algebras
Quantum computational logic
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_09425616_v59_n1-2_p27_Freytes
http://hdl.handle.net/20.500.12110/paper_09425616_v59_n1-2_p27_Freytes
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires
id paper:paper_09425616_v59_n1-2_p27_Freytes
record_format dspace
spelling paper:paper_09425616_v59_n1-2_p27_Freytes2023-06-08T15:53:36Z Quantum computational logic with mixed states MV-algebras PMV-algebras Quantum computational logic In this paper we solve the problem how to axiomatize a system of quantum computational gates known as the Poincaré irreversible quantum computational system. A Hilbert-style calculus is introduced obtaining a strong completeness theorem. © 2013 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim. 2013 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_09425616_v59_n1-2_p27_Freytes http://hdl.handle.net/20.500.12110/paper_09425616_v59_n1-2_p27_Freytes
institution Universidad de Buenos Aires
institution_str I-28
repository_str R-134
collection Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic MV-algebras
PMV-algebras
Quantum computational logic
spellingShingle MV-algebras
PMV-algebras
Quantum computational logic
Quantum computational logic with mixed states
topic_facet MV-algebras
PMV-algebras
Quantum computational logic
description In this paper we solve the problem how to axiomatize a system of quantum computational gates known as the Poincaré irreversible quantum computational system. A Hilbert-style calculus is introduced obtaining a strong completeness theorem. © 2013 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
title Quantum computational logic with mixed states
title_short Quantum computational logic with mixed states
title_full Quantum computational logic with mixed states
title_fullStr Quantum computational logic with mixed states
title_full_unstemmed Quantum computational logic with mixed states
title_sort quantum computational logic with mixed states
publishDate 2013
url https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_09425616_v59_n1-2_p27_Freytes
http://hdl.handle.net/20.500.12110/paper_09425616_v59_n1-2_p27_Freytes
_version_ 1768544282457669632

Ejemplares similares