Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1002.5025

Quantum computational logic with mixed states

Héctor Freytes, Graciela Domenech

Published Feb 26, 2010• 0 citations
arXivHTMLPDF

Abstract

Using an algebraic framework we solve a problem posed in [5] and [7] about the axiomatizability of a quantum computational type logic related to fuzzy logic. A Hilbert-style calculus is developed obtaining an algebraic strong completeness theorem.
DOI
10.48550/arxiv.1002.5025

Related papers

Quantum computational logic with mixed states

Héctor Freytes, Graciela Domenech

Abstract 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.

Mathematical logic quarterly•Jan 25, 2013•15 citations

Quantum Computational Fuzzy Logics

Cesarino Bertini, Roberto Leporini

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 for the treatment of quantum information.

•Jan 1, 2007•0 citations

An Axiomatic System Suggested by Quantum Computation

Cesarino Bertini, Roberto Leporini

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.

Journal of Logic and Computation•Feb 27, 2009•0 citations

RESEARCH ARTICLE Some generalizations of fuzzy structures in quantum computational logic

Roberto Giuntini, Antonio Ledda, Giuseppe Sergioli +1 more

Quantum computational logics provide a fertile common ground for a unied treatment of vagueness and uncertainty. In this paper we describe an approach to the logic of quantum computation that has been recently taken up and developed by the present authors. Special attention will be devoted to a generalisation of Chang's MV algebras (called quasi-MV alge- bra) which abstracts over the algebra whose universe is the set of qumixes of the 2-dimensional complex Hilbert space, as well as to its expansions by additional quantum connectives. We fur- thermore explore some future research perspectives, also in the light of some recent limitative results whose general signicance will be duly assessed.

•Jan 1, 2009•0 citations

A Basic Modal Logic for the Abstract Treatment of Quantum Mixed States

Tomoaki Kawano

Quantum logic has developed in various directions since its inception.However, many existing logical approaches either focus only on pure states, or use Hilbert-space models in which the abstract relationship between pure states, mixed states, and probabilities is not made explicit.In this work, we introduce a model designed to handle quantum mixed states abstractly.Furthermore, we construct a proof system for the proposed logic and establish its completeness with respect to the intended semantics.

Electronic Proceedings in Theoretical Computer Science•Oct 25, 2026•0 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 Investigations•Jan 1, 2023•0 citations
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 for the treatment of quantum information.
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.
Quantum computational logics provide a fertile common ground for a unied treatment of vagueness and uncertainty. In this paper we describe an approach to the logic of quantum computation that has been recently taken up and developed by the present authors. Special attention will be devoted to a generalisation of Chang's MV algebras (called quasi-MV alge- bra) which abstracts over the algebra whose universe is the set of qumixes of the 2-dimensional complex Hilbert space, as well as to its expansions by additional quantum connectives. We fur- thermore explore some future research perspectives, also in the light of some recent limitative results whose general signicance will be duly assessed.
Quantum logic has developed in various directions since its inception.However, many existing logical approaches either focus only on pure states, or use Hilbert-space models in which the abstract relationship between pure states, mixed states, and probabilities is not made explicit.In this work, we introduce a model designed to handle quantum mixed states abstractly.Furthermore, we construct a proof system for the proposed logic and establish its completeness with respect to the intended semantics.
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.