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

National Conference on Artificial Intelligence

High Level Quantum Structures in Linguistics and Multi Agent Systems

Mehrnoosh Sadrzadeh

Published Jan 1, 2006• 13 citations
OpenAlex

Abstract

We present two applications to AI of recently introduced high level quantum structures.These structures are the categorical quantum logic of (Abramsky & Coecke 2004) and the quantale quantum logic of (Coecke, Moore, & Stubbe 2001).Firstly, we show how the diagrammatic toolkit of categorical quantum logic, when restricted to its pregroup fragment (Lambek 1999; 2001), simplifies analysis of sentence structure of different languages.Moreover, the quantitative values that arise in these diagrams signify different degrees of complexity of sentences, which turn out to vary for different languages.Secondly, we show how expanding the quantale quantum logic with epistemic modalities provides a powerful system to reason about information update in multi-agent systems.Finally, we indicate how the above two applications to non-quantum domains can themselves be 're-quantized', providing applications to quantum informatics of distributed systems.

Related papers

Automated Quantum Reasoning: Non Logic - Semi-Logic - Hyper-Logic.

Bob Coecke

Quantum theory does not necessitate the breakdown of full-blown deduction. On the contrary, it comes with substantially enhanced logical reasoning power as compared to its classical counterpart. It features a co-deductive mechanism besides a deductive one, resulting in a sound purely graphical calculus which admits an information-flow interpretation. (Abramsky & Coecke 2004; Coecke 2005a; 2005b; Coecke & Pavlovic 2006). The key physical concept represented by the logic is the interaction of quantum systems i.e. the tensor product structure, contra (Birkhoff & von Neumann 1936)-logic which only addresses individual systems. The trace structure, important in IR applications (van Rijsbergen 2004), is an intrincic part of the logic, together with many other quantitative concepts, again contra BvN-logic where the trace only arises indirectly via Glea-son’s theorem. Hence we provide a powerful high-level formalism for designing, controlling and even au-tomating quantum informatic tasks, which can involve multiple agents. We also mention several existing ap-plications to non-quantum domains such as linguistics, multi-agent systems and concurrency.

National Conference on Artificial Intelligence•Jan 1, 2007•3 citations

Quantum teleportation and quantum epistemic semantics

Enrico G. Beltrametti, Maria L. Dalla Chiara, Roberto Giuntini +1 more

Abstract Quantum information gives rise to some puzzling epistemic problems that can be interestingly investigated from a logical point of view. A characteristic example is represented by teleportation phenomena, where knowledge and actions of observers (epistemic agents) play a relevant role. By abstracting from teleportation, we propose a simplified semantics for a language that consists of two parts: 1)the quantum computational sub-language, whose sentences α represent pieces of quantum information (which are supposed to be stored by some quantum systems)2)the classical epistemic sub-language, whose atomic sentences have the following forms: agent a has a probabilistic information about the sentence α; agent a knows the sentence α. Interestingly enough, some conceptual difficulties of standard epistemic logics can be avoided in this framework.

Mathematica Slovaca•Dec 1, 2012•12 citations

MIXING CATEGORIES AND MODAL LOGICS IN THE QUANTUM SETTING

Giovanni Cinà

The study of the foundations of Quantum Mechanics, especially after the advent of Quantum Computation and Information, has benefited from the application of category-theoretic tools and modal logics to the analysis of Quantum processes: we witness a wealth of theoretical frameworks casted in either of the two languages. This paper explores the interplay of the two formalisms in the peculiar context of Quantum Theory. After a review of some influential abstract frameworks, we show how different modal logic frames can be extracted from the category of finite dimensional Hilbert spaces, connecting the Categorical Quantum Mechanics approach to some modal logics that have been proposed for Quantum Computing. We then apply a general version of the same technique to two other categorical frameworks, the ‘topos approach’ of Doering and Isham and the sheaf-theoretic work on contextuality by Abramsky and Brandenburger, suggesting how some key features can be expressed with modal languages.

•Jul 24, 2016•0 citations

Category Theory for Quantum Natural Language Processing

Alexis Toumi

This thesis introduces quantum natural language processing (QNLP) models based on a simple yet powerful analogy between computational linguistics and quantum mechanics: grammar as entanglement. The grammatical structure of text and sentences connects the meaning of words in the same way that entanglement structure connects the states of quantum systems. Category theory allows to make this language-to-qubit analogy formal: it is a monoidal functor from grammar to vector spaces. We turn this abstract analogy into a concrete algorithm that translates the grammatical structure onto the architecture of parameterised quantum circuits. We then use a hybrid classical-quantum algorithm to train the model so that evaluating the circuits computes the meaning of sentences in data-driven tasks. The implementation of QNLP models motivated the development of DisCoPy (Distributional Compositional Python), the toolkit for applied category theory of which the first chapter gives a comprehensive overview. String diagrams are the core data structure of DisCoPy, they allow to reason about computation at a high level of abstraction. We show how they can encode both grammatical structures and quantum circuits, but also logical formulae, neural networks or arbitrary Python code. Monoidal functors allow to translate these abstract diagrams into concrete computation, interfacing with optimised task-specific libraries. The second chapter uses DisCopy to implement QNLP models as parameterised functors from grammar to quantum circuits. It gives a first proof-of-concept for the more general concept of functorial learning: generalising machine learning from functions to functors by learning from diagram-like data. In order to learn optimal functor parameters via gradient descent, we introduce the notion of diagrammatic differentiation: a graphical calculus for computing the gradients of parameterised diagrams.

arXiv:2212.06615•Dec 13, 2022•9 citations

Foundations for Near-Term Quantum Natural Language Processing

Bob Coecke, Giovanni de Felice, Konstantinos Meichanetzidis +1 more

We provide conceptual and mathematical foundations for near-term quantum natural language processing (QNLP), and do so in quantum computer scientist friendly terms. We opted for an expository presentation style, and provide references for supporting empirical evidence and formal statements concerning mathematical generality. We recall how the quantum model for natural language that we employ canonically combines linguistic meanings with rich linguistic structure, most notably grammar. In particular, the fact that it takes a quantum-like model to combine meaning and structure, establishes QNLP as quantum-native, on par with simulation of quantum systems. Moreover, the now leading Noisy Intermediate-Scale Quantum (NISQ) paradigm for encoding classical data on quantum hardware, variational quantum circuits, makes NISQ exceptionally QNLP-friendly: linguistic structure can be encoded as a free lunch, in contrast to the apparently exponentially expensive classical encoding of grammar. Quantum speed-up for QNLP tasks has already been established in previous work with Will Zeng. Here we provide a broader range of tasks which all enjoy the same advantage. Diagrammatic reasoning is at the heart of QNLP. Firstly, the quantum model interprets language as quantum processes via the diagrammatic formalism of categorical quantum mechanics. Secondly, these diagrams are via ZX-calculus translated into quantum circuits. Parameterisations of meanings then become the circuit variables to be learned. Our encoding of linguistic structure within quantum circuits also embodies a novel approach for establishing word-meanings that goes beyond the current standards in mainstream AI, by placing linguistic structure at the heart of Wittgenstein's meaning-is-context.

arXiv:2012.03755•Dec 7, 2020•144 citations

Correlated Information: A Logic for Multi-Partite Quantum Systems

Alexandru Baltag, Sonja Smets

In this paper we analyze classical and quantum correlations using the tools of epistemic logic. Our main contribution consists of two new logical systems. The first one is called General Epistemic Logic (GEL), it extends traditional epistemic logic with operators that allow us to reason about the information carried by a complex system composed of several parts. The second system is called the Logic of Correlated Knowledge (LCK), which extends GEL with sentences that describe the observational capabilities of an agent. On the semantic side we introduce correlation models, as a generalization of the “interpreted systems” semantics. We use this setting to investigate several types of informational correlations (e.g. distributed information, quantum correlated information) that complex systems can exhibit. We also provide an informational-logical characterization of the notion of “quantum entanglement”.

Electronic Notes in Theoretical Computer Science•Feb 1, 2011•11 citations
We present two applications to AI of recently introduced high level quantum structures.These structures are the categorical quantum logic of (Abramsky & Coecke 2004) and the quantale quantum logic of (Coecke, Moore, & Stubbe 2001).Firstly, we show how the diagrammatic toolkit of categorical quantum logic, when restricted to its pregroup fragment (Lambek 1999; 2001), simplifies analysis of sentence structure of different languages.Moreover, the quantitative values that arise in these diagrams signify different degrees of complexity of sentences, which turn out to vary for different languages.Secondly, we show how expanding the quantale quantum logic with epistemic modalities provides a powerful system to reason about information update in multi-agent systems.Finally, we indicate how the above two applications to non-quantum domains can themselves be 're-quantized', providing applications to quantum informatics of distributed systems.
Quantum theory does not necessitate the breakdown of full-blown deduction. On the contrary, it comes with substantially enhanced logical reasoning power as compared to its classical counterpart. It features a co-deductive mechanism besides a deductive one, resulting in a sound purely graphical calculus which admits an information-flow interpretation. (Abramsky & Coecke 2004; Coecke 2005a; 2005b; Coecke & Pavlovic 2006). The key physical concept represented by the logic is the interaction of quantum systems i.e. the tensor product structure, contra (Birkhoff & von Neumann 1936)-logic which only addresses individual systems. The trace structure, important in IR applications (van Rijsbergen 2004), is an intrincic part of the logic, together with many other quantitative concepts, again contra BvN-logic where the trace only arises indirectly via Glea-son’s theorem. Hence we provide a powerful high-level formalism for designing, controlling and even au-tomating quantum informatic tasks, which can involve multiple agents. We also mention several existing ap-plications to non-quantum domains such as linguistics, multi-agent systems and concurrency.
Abstract Quantum information gives rise to some puzzling epistemic problems that can be interestingly investigated from a logical point of view. A characteristic example is represented by teleportation phenomena, where knowledge and actions of observers (epistemic agents) play a relevant role. By abstracting from teleportation, we propose a simplified semantics for a language that consists of two parts: 1)the quantum computational sub-language, whose sentences α represent pieces of quantum information (which are supposed to be stored by some quantum systems)2)the classical epistemic sub-language, whose atomic sentences have the following forms: agent a has a probabilistic information about the sentence α; agent a knows the sentence α. Interestingly enough, some conceptual difficulties of standard epistemic logics can be avoided in this framework.
The study of the foundations of Quantum Mechanics, especially after the advent of Quantum Computation and Information, has benefited from the application of category-theoretic tools and modal logics to the analysis of Quantum processes: we witness a wealth of theoretical frameworks casted in either of the two languages. This paper explores the interplay of the two formalisms in the peculiar context of Quantum Theory. After a review of some influential abstract frameworks, we show how different modal logic frames can be extracted from the category of finite dimensional Hilbert spaces, connecting the Categorical Quantum Mechanics approach to some modal logics that have been proposed for Quantum Computing. We then apply a general version of the same technique to two other categorical frameworks, the ‘topos approach’ of Doering and Isham and the sheaf-theoretic work on contextuality by Abramsky and Brandenburger, suggesting how some key features can be expressed with modal languages.
This thesis introduces quantum natural language processing (QNLP) models based on a simple yet powerful analogy between computational linguistics and quantum mechanics: grammar as entanglement. The grammatical structure of text and sentences connects the meaning of words in the same way that entanglement structure connects the states of quantum systems. Category theory allows to make this language-to-qubit analogy formal: it is a monoidal functor from grammar to vector spaces. We turn this abstract analogy into a concrete algorithm that translates the grammatical structure onto the architecture of parameterised quantum circuits. We then use a hybrid classical-quantum algorithm to train the model so that evaluating the circuits computes the meaning of sentences in data-driven tasks. The implementation of QNLP models motivated the development of DisCoPy (Distributional Compositional Python), the toolkit for applied category theory of which the first chapter gives a comprehensive overview. String diagrams are the core data structure of DisCoPy, they allow to reason about computation at a high level of abstraction. We show how they can encode both grammatical structures and quantum circuits, but also logical formulae, neural networks or arbitrary Python code. Monoidal functors allow to translate these abstract diagrams into concrete computation, interfacing with optimised task-specific libraries. The second chapter uses DisCopy to implement QNLP models as parameterised functors from grammar to quantum circuits. It gives a first proof-of-concept for the more general concept of functorial learning: generalising machine learning from functions to functors by learning from diagram-like data. In order to learn optimal functor parameters via gradient descent, we introduce the notion of diagrammatic differentiation: a graphical calculus for computing the gradients of parameterised diagrams.
We provide conceptual and mathematical foundations for near-term quantum natural language processing (QNLP), and do so in quantum computer scientist friendly terms. We opted for an expository presentation style, and provide references for supporting empirical evidence and formal statements concerning mathematical generality. We recall how the quantum model for natural language that we employ canonically combines linguistic meanings with rich linguistic structure, most notably grammar. In particular, the fact that it takes a quantum-like model to combine meaning and structure, establishes QNLP as quantum-native, on par with simulation of quantum systems. Moreover, the now leading Noisy Intermediate-Scale Quantum (NISQ) paradigm for encoding classical data on quantum hardware, variational quantum circuits, makes NISQ exceptionally QNLP-friendly: linguistic structure can be encoded as a free lunch, in contrast to the apparently exponentially expensive classical encoding of grammar. Quantum speed-up for QNLP tasks has already been established in previous work with Will Zeng. Here we provide a broader range of tasks which all enjoy the same advantage. Diagrammatic reasoning is at the heart of QNLP. Firstly, the quantum model interprets language as quantum processes via the diagrammatic formalism of categorical quantum mechanics. Secondly, these diagrams are via ZX-calculus translated into quantum circuits. Parameterisations of meanings then become the circuit variables to be learned. Our encoding of linguistic structure within quantum circuits also embodies a novel approach for establishing word-meanings that goes beyond the current standards in mainstream AI, by placing linguistic structure at the heart of Wittgenstein's meaning-is-context.
In this paper we analyze classical and quantum correlations using the tools of epistemic logic. Our main contribution consists of two new logical systems. The first one is called General Epistemic Logic (GEL), it extends traditional epistemic logic with operators that allow us to reason about the information carried by a complex system composed of several parts. The second system is called the Logic of Correlated Knowledge (LCK), which extends GEL with sentences that describe the observational capabilities of an agent. On the semantic side we introduce correlation models, as a generalization of the “interpreted systems” semantics. We use this setting to investigate several types of informational correlations (e.g. distributed information, quantum correlated information) that complex systems can exhibit. We also provide an informational-logical characterization of the notion of “quantum entanglement”.