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:0802.4057 · IEEE International Symposium on Multiple-Valued Logic (ISMVL)

A Qualitative Modal Representation of Quantum Register Transformations

Andrea Masini, Luca Viganò, Margherita Zorzi

Published May 1, 2008• 11 citations
arXivHTMLPDF

Abstract

We introduce two modal natural deduction systems that are suitable to represent and reason about transformations of quantum registers in an abstract, qualitative, way. Quantum registers represent quantum systems, and can be viewed as the structure of quantum data for quantum operations. Our systems provide a modal framework for reasoning about operations on quantum registers (unitary transformations and measurements) in terms of possible worlds (as abstractions of quantum registers) and accessibility relations between these worlds. We give a Kripke--style semantics that formally describes quantum register transformations, and prove the soundness and completeness of our systems with respect to this semantics.

DOI
10.1109/ismvl.2008.36

Related papers

A LOGIC-ALGEBRAIC FRAMEWORK FOR CONTEXTUALITY AND MODALITY IN QUANTUM SYSTEMS

Héctor Freytes

In this work we develop a modal structure for the simultaneous treatment of \nactual and possible properties of quantum systems. A logical system based on \northomodular lattices enriched with a modal operator is given, obtaining algebraic \ncompleteness and completeness with respect to a Kripke-style semantic. \nWe show that, in spite of the fact that, the language is enriched with the addition \nof a modal operator, contextuality remains a central feature of quantum \nsystems.

•Mar 5, 2014•0 citations

Quantum modal logic

Kenji Tokuo

Abstract A modal logic based on quantum logic is formalized in its simplest possible form. Specifically, a relational semantics and a sequent calculus are provided, and the soundness and the completeness theorems connecting both notions are demonstrated. This framework is intended to serve as a basis for formalizing various modal logics over quantum logic, such as quantum alethic logic, quantum temporal logic, quantum epistemic logic, and quantum dynamic logic.

arXiv:2511.10188•Logic Journal of IGPL•Nov 12, 2024•3 citations

CONCEPTUAL FOUNDATIONS OF QUANTUM MECHANICS: THE ROLE OF EVIDENCE THEORY, QUANTUM SETS, AND MODAL LOGIC

Germano Resconi, George J. Klir, Eliano Pessa

Recognizing that syntactic and semantic structures of classical logic are not sufficient to understand the meaning of quantum phenomena, we propose in this paper a new interpretation of quantum mechanics based on evidence theory. The connection between these two theories is obtained through a new language, quantum set theory, built on a suggestion by J. Bell. Further, we give a modal logic interpretation of quantum mechanics and quantum set theory by using Kripke's semantics of modal logic based on the concept of possible worlds. This is grounded on previous work of a number of researchers (Resconi, Klir, Harmanec) who showed how to represent evidence theory and other uncertainty theories in terms of modal logic. Moreover, we also propose a reformulation of the many-worlds interpretation of quantum mechanics in terms of Kripke's semantics. We thus show how three different theories — quantum mechanics, evidence theory, and modal logic — are interrelated. This opens, on one hand, the way to new applications of quantum mechanics within domains different from the traditional ones, and, on the other hand, the possibility of building new generalizations of quantum mechanics itself.

International Journal of Modern Physics C•Feb 1, 1999•24 citations

High-level quantum structured programs as quantum registers compositions

David Chamizo, Jose Garcia-Alonso, Juan M. Murillo

Current quantum programs are mainly designed at the level of quantum gates acting on individual qubits; on a large scale and for complex problems this may involve a high cognitive load on the programmer, making the program specification nontrivial and error-prone. In this context, providing quantum programming with higher abstraction mechanisms will assist in making this task more manageable and robust against design errors. In this work, a conceptual framework is addressed following the notion of the whole quantum computation as a structure composed of quantum registers representing each an undivided entity. Thus, computation progresses through semantically well-defined transformations that act on, or entangle, quantum registers, thereby modifying the global state. Ultimately, the program reaches the desired state by following a specific composition strategy. With this in mind, high-level syntax is presented through an algebraic formalism that bridges them with their low-level semantics. Proposed syntax is based on certain well-know operations used on quantum algorithms that apply phase shifts upon logical condition satisfaction or leverage on parallel evaluation. Based solely on the formalized operations, a quantum satisfiability modulo theories (SMT) solver can be designed. At its core, this work contributes to establishing some methodological principles towards realizing a high-level quantum structured programming.

quant-pharXiv:2608.03873•Aug 5, 2026•0 citations

MODAL SEMANTICS MODIFIED TO REPRESENT MANY-WORLDS INTERPRETATION OF QUANTUM MECHANICS

I. Petik

This short paper proposes the project of a modal logical semantics that will represent not the classical modalities but the many-worlds interpretation for the physical theory of quantum mechanics. It also views some problematic methodological questions of the doctrine such as measurement and a role of an interpreter. Special attention is given to the famous paradoxes of the QM such as EPR Paradox and Schrodinger’s Cat. The paper will be interesting for logicians, physicists and philosophers of science.

•Aug 22, 2022•0 citations

Systems of quantum logic

R I G Hughes

According to quantum mechanics, the pure states of a microsystem are represented by vectors in a Hilbert Space. Sentences of the form, "x є L" (where x is the state vector for a system, L a subspace of the appropriate Hilbert space), may be called Q-propositions: such sentences serve to summarise our information about the results of possible experiments on the system. Quantum logic investigates the relations which hold among the Q-propositions about a given physical sys tem. These logical relations correspond to algebraic relations among the subspaces of Hilbert space. The algebra of this set of subspaces is non-Boolean, and may be regarded either as an orthomodular lattice or as a partial Boolean algebra. With each type of structure we can associate a logic. A general approach to the semantics for such a logic is provided in terms of interpretations of a formal language within an algebraic structure; an interpretation maps sentences of the language homomorphically onto elements of the structure. When the structure in question is a Boolean algera, the resulting logic is classical; here we develop a semantics for the logic associated with partial Boolean algebras. Two systems of proof, based on the natural deduction systems of Gentzen, are shown for this logic. With respect to the given sematics, these calculi are sound and weakly complete. Strong completeness is conjectured. Quantum logic deals with the logical relations between sentences, and so is properly called a logic. However, it is the logic appropriate to a limited class of sentences: proposals that it should replace classical logic wherever the latter is used should be viewed with suspicion.

•Jan 1, 2010•0 citations
We introduce two modal natural deduction systems that are suitable to represent and reason about transformations of quantum registers in an abstract, qualitative, way. Quantum registers represent quantum systems, and can be viewed as the structure of quantum data for quantum operations. Our systems provide a modal framework for reasoning about operations on quantum registers (unitary transformations and measurements) in terms of possible worlds (as abstractions of quantum registers) and accessibility relations between these worlds. We give a Kripke--style semantics that formally describes quantum register transformations, and prove the soundness and completeness of our systems with respect to this semantics.
Recognizing that syntactic and semantic structures of classical logic are not sufficient to understand the meaning of quantum phenomena, we propose in this paper a new interpretation of quantum mechanics based on evidence theory. The connection between these two theories is obtained through a new language, quantum set theory, built on a suggestion by J. Bell. Further, we give a modal logic interpretation of quantum mechanics and quantum set theory by using Kripke's semantics of modal logic based on the concept of possible worlds. This is grounded on previous work of a number of researchers (Resconi, Klir, Harmanec) who showed how to represent evidence theory and other uncertainty theories in terms of modal logic. Moreover, we also propose a reformulation of the many-worlds interpretation of quantum mechanics in terms of Kripke's semantics. We thus show how three different theories — quantum mechanics, evidence theory, and modal logic — are interrelated. This opens, on one hand, the way to new applications of quantum mechanics within domains different from the traditional ones, and, on the other hand, the possibility of building new generalizations of quantum mechanics itself.
Current quantum programs are mainly designed at the level of quantum gates acting on individual qubits; on a large scale and for complex problems this may involve a high cognitive load on the programmer, making the program specification nontrivial and error-prone. In this context, providing quantum programming with higher abstraction mechanisms will assist in making this task more manageable and robust against design errors. In this work, a conceptual framework is addressed following the notion of the whole quantum computation as a structure composed of quantum registers representing each an undivided entity. Thus, computation progresses through semantically well-defined transformations that act on, or entangle, quantum registers, thereby modifying the global state. Ultimately, the program reaches the desired state by following a specific composition strategy. With this in mind, high-level syntax is presented through an algebraic formalism that bridges them with their low-level semantics. Proposed syntax is based on certain well-know operations used on quantum algorithms that apply phase shifts upon logical condition satisfaction or leverage on parallel evaluation. Based solely on the formalized operations, a quantum satisfiability modulo theories (SMT) solver can be designed. At its core, this work contributes to establishing some methodological principles towards realizing a high-level quantum structured programming.
This short paper proposes the project of a modal logical semantics that will represent not the classical modalities but the many-worlds interpretation for the physical theory of quantum mechanics. It also views some problematic methodological questions of the doctrine such as measurement and a role of an interpreter. Special attention is given to the famous paradoxes of the QM such as EPR Paradox and Schrodinger’s Cat. The paper will be interesting for logicians, physicists and philosophers of science.
According to quantum mechanics, the pure states of a microsystem are represented by vectors in a Hilbert Space. Sentences of the form, "x є L" (where x is the state vector for a system, L a subspace of the appropriate Hilbert space), may be called Q-propositions: such sentences serve to summarise our information about the results of possible experiments on the system. Quantum logic investigates the relations which hold among the Q-propositions about a given physical sys tem. These logical relations correspond to algebraic relations among the subspaces of Hilbert space. The algebra of this set of subspaces is non-Boolean, and may be regarded either as an orthomodular lattice or as a partial Boolean algebra. With each type of structure we can associate a logic. A general approach to the semantics for such a logic is provided in terms of interpretations of a formal language within an algebraic structure; an interpretation maps sentences of the language homomorphically onto elements of the structure. When the structure in question is a Boolean algera, the resulting logic is classical; here we develop a semantics for the logic associated with partial Boolean algebras. Two systems of proof, based on the natural deduction systems of Gentzen, are shown for this logic. With respect to the given sematics, these calculi are sound and weakly complete. Strong completeness is conjectured. Quantum logic deals with the logical relations between sentences, and so is properly called a logic. However, it is the logic appropriate to a limited class of sentences: proposals that it should replace classical logic wherever the latter is used should be viewed with suspicion.