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:1902.05162

Quantum Language Processing

Nathan Wiebe, Alex Bocharov, Paul Smolensky, Matthias Troyer, Krysta M. Svore

Published Feb 13, 2019• 42 citations
arXivHTMLPDF

Abstract

We present a representation for linguistic structure that we call a Fock-space representation, which allows us to embed problems in language processing into small quantum devices. We further develop a formalism for understanding both classical as well as quantum linguistic problems and phrase them both as a Harmony optimization problem that can be solved on a quantum computer which we show is related to classifying vectors using quantum Boltzmann machines. We further provide a new training method for learning quantum Harmony operators that describe a language. This also provides a new algorithm for training quantum Boltzmann machines that requires no approximations and works in the presence of hidden units. We additionally show that quantum language processing is BQP-complete, meaning that it is polynomially equivalent to the circuit model of quantum computing which implies that quantum language models are richer than classical models unless BPP=BQP. It also implies that, under certain circumstances, quantum Boltzmann machines are more expressive than classical Boltzmann machines. Finally, we examine the performance of our approach numerically for the case of classical harmonic grammars and find that the method is capable of rapidly parsing even non-trivial grammars. This suggests that the work may have value as a quantum inspired algorithm beyond its initial motivation as a new quantum algorithm.

DOI
10.48550/arxiv.1902.05162

Related papers

Quantum Algorithms for Compositional Text Processing

Tuomas Laakkonen, Konstantinos Meichanetzidis, Bob Coecke

Quantum computing and AI have found a fruitful intersection in the field of natural language processing. We focus on the recently proposed DisCoCirc framework for natural language, and propose a quantum adaptation, QDisCoCirc. This is motivated by a compositional approach to rendering AI interpretable: the behavior of the whole can be understood in terms of the behavior of parts, and the way they are put together. For the model-native primitive operation of text similarity, we derive quantum algorithms for fault-tolerant quantum computers to solve the task of question-answering within QDisCoCirc, and show that this is BQP-hard; note that we do not consider the complexity of question-answering in other natural language processing models. Assuming widely-held conjectures, implementing the proposed model classically would require super-polynomial resources. Therefore, it could provide a meaningful demonstration of the power of practical quantum processors. The model construction builds on previous work in compositional quantum natural language processing. Word embeddings are encoded as parameterized quantum circuits, and compositionality here means that the quantum circuits compose according to the linguistic structure of the text. We outline a method for evaluating the model on near-term quantum processors, and elsewhere we report on a recent implementation of this on quantum hardware. In addition, we adapt a quantum algorithm for the closest vector problem to obtain a Grover-like speedup in the fault-tolerant regime for our model. This provides an unconditional quadratic speedup over any classical algorithm in certain circumstances, which we will verify empirically in future work.

arXiv:2408.06061•Electronic Proceedings in Theoretical Computer Science•Aug 9, 2024•14 citations

Quantum-Enhanced Artificial Intelligence: Framework for Hybrid Computing and Natural Language Processing

Ravi Kumar Ireddy

The convergence of quantum computing and artificial intelligence represents a paradigm shift in computational capability, enabling solutions to previously intractable optimization problems, accelerated machine learning training, and enhanced natural language understanding through quantum state exploitation. This paper presents a comprehensive framework encompassing five distinct quantum artificial intelligence architectures: Quantum Machine Learning utilizing quantum circuit-based training and inference, Quantum-Inspired AI implementing quantum algorithmic principles on classical hardware, Hybrid Quantum-Classical AI leveraging collaborative processing between central processing units and quantum processing units, Quantum Optimization AI for solving complex combinatorial problems, and Quantum Natural Language Processing exploiting quantum superposition for semantic reasoning. The quantum machine learning architecture implements variational quantum eigensolvers and quantum kernel methods for feature space transformation, achieving exponential speedup in specific classification tasks. The quantum-inspired approach applies tensor network decomposition and quantum annealing simulation on classical systems, demonstrating polynomial speedup for optimization problems. The hybrid quantum-classical framework orchestrates workload partitioning between conventional processors and quantum accelerators through dynamic task allocation algorithms, optimizing for quantum circuit depth and classical preprocessing overhead. Quantum optimization leverages quantum annealing and quantum approximate optimization algorithms for solving large-scale combinatorial problems in logistics, finance, and molecular simulation. Quantum natural language processing implements quantum word embeddings in Hilbert space, enabling superposition-based semantic analysis with logarithmic dimensional complexity compared to classical word vector representations. This research establishes theoretical foundations and architectural blueprints for quantum-enhanced artificial intelligence systems, positioning quantum computing as a transformative technology for next-generation machine learning, optimization, and cognitive computing applications.

International Journal For Multidisciplinary Research•Sep 12, 2025•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

Towards Scalable and Accurate QNLP Models: A ZX-Calculus and Hilbert Space Approach

Bojja Sreedhar, Saroja Pathapati, Satyapriya Krishna +3 more

Quantum Natural language processing (QNLP) is the new technology that incorporates the theory of quantum computing with the linguistic theory to make more effective and transparent models of comprehending natural language. The paper proposes QNLP model of type combining the vector space semantics and the graphical ZX-calculus, applicable to quantum computing to describe, process, and interpret the sentences structure as a quantum circuit. Its approach includes a sentence parsing with a categorial grammar, a mapping of the semantic constituents to products of high dimensional Hilbert spaces and a representation of their interaction with the so-called ZX-diagrams. Such circuits are compiled into quantum instructions and emulated on quantum devices such as Qiskit. The model was compared in terms of the accuracy of parse, preservation of semantics, diagrammatic effectiveness, quantum fidelity and sentence reprehensibility. This has been demonstrated to match the outputs of classical and quantum semantics, by 86 percent on parsing accuracy and above 96% on quantum circuit fidelity. The paper shows ZX-calculus is a potentially powerful and understandable framework to construct large-scale and semantically rich QNLP systems, given near-term quantum hardware.

International Conference on Sustainable Computing and Data Communication Systems (ICSCDS)•Aug 6, 2025•0 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

Quantum Natural Language Processing: A Comprehensive Survey of Models, Architectures, and Evaluation Methods

Arpita Vats, Ashish Kattamuri, Rahul Raja +1 more

Quantum Natural Language Processing (QNLP) is an emerging interdisciplinary field at the intersection of quantum computing, natural language understanding, and formal linguistic theory. As advances in quantum hardware and algorithms accelerate, QNLP promises new paradigms for representation learning, semantic modeling, and efficient computation. However, existing literature remains fragmented, with no unified synthesis across modeling, encoding, and evaluation dimensions.In this work, we present the first systematic and taxonomy driven survey of QNLP that holistically organizes research spanning three core dimensions: computational models, encoding paradigms, and evaluation frameworks. First, we analyze foundational approaches that map linguistic structures into quantum formalism, including categorical compositional models, variational quantum circuits, and hybrid quantum classical architectures. Second, we introduce a unified taxonomy of encoding strategies, ranging from quantum tokenization and state preparation to embedding based encodings, highlighting tradeoffs in scalability, noise resilience, and expressiveness. Third, we provide the first comparative synthesis of evaluation methodologies, benchmark datasets, and performance metrics, while identifying reproducibility and standardization gaps.We further contrast quantum inspired NLP methods with fully quantum implemented systems, offering insights into resource efficiency, hardware feasibility, and real world applicability. Finally, we outline open challenges such as integration with LLMs and unified benchmark design, and propose a research agenda for advancing QNLP as a scalable and reliable discipline.

•Nov 5, 2025•3 citations
We present a representation for linguistic structure that we call a Fock-space representation, which allows us to embed problems in language processing into small quantum devices. We further develop a formalism for understanding both classical as well as quantum linguistic problems and phrase them both as a Harmony optimization problem that can be solved on a quantum computer which we show is related to classifying vectors using quantum Boltzmann machines. We further provide a new training method for learning quantum Harmony operators that describe a language. This also provides a new algorithm for training quantum Boltzmann machines that requires no approximations and works in the presence of hidden units. We additionally show that quantum language processing is BQP-complete, meaning that it is polynomially equivalent to the circuit model of quantum computing which implies that quantum language models are richer than classical models unless BPP=BQP. It also implies that, under certain circumstances, quantum Boltzmann machines are more expressive than classical Boltzmann machines. Finally, we examine the performance of our approach numerically for the case of classical harmonic grammars and find that the method is capable of rapidly parsing even non-trivial grammars. This suggests that the work may have value as a quantum inspired algorithm beyond its initial motivation as a new quantum algorithm.
Quantum computing and AI have found a fruitful intersection in the field of natural language processing. We focus on the recently proposed DisCoCirc framework for natural language, and propose a quantum adaptation, QDisCoCirc. This is motivated by a compositional approach to rendering AI interpretable: the behavior of the whole can be understood in terms of the behavior of parts, and the way they are put together. For the model-native primitive operation of text similarity, we derive quantum algorithms for fault-tolerant quantum computers to solve the task of question-answering within QDisCoCirc, and show that this is BQP-hard; note that we do not consider the complexity of question-answering in other natural language processing models. Assuming widely-held conjectures, implementing the proposed model classically would require super-polynomial resources. Therefore, it could provide a meaningful demonstration of the power of practical quantum processors. The model construction builds on previous work in compositional quantum natural language processing. Word embeddings are encoded as parameterized quantum circuits, and compositionality here means that the quantum circuits compose according to the linguistic structure of the text. We outline a method for evaluating the model on near-term quantum processors, and elsewhere we report on a recent implementation of this on quantum hardware. In addition, we adapt a quantum algorithm for the closest vector problem to obtain a Grover-like speedup in the fault-tolerant regime for our model. This provides an unconditional quadratic speedup over any classical algorithm in certain circumstances, which we will verify empirically in future work.
The convergence of quantum computing and artificial intelligence represents a paradigm shift in computational capability, enabling solutions to previously intractable optimization problems, accelerated machine learning training, and enhanced natural language understanding through quantum state exploitation. This paper presents a comprehensive framework encompassing five distinct quantum artificial intelligence architectures: Quantum Machine Learning utilizing quantum circuit-based training and inference, Quantum-Inspired AI implementing quantum algorithmic principles on classical hardware, Hybrid Quantum-Classical AI leveraging collaborative processing between central processing units and quantum processing units, Quantum Optimization AI for solving complex combinatorial problems, and Quantum Natural Language Processing exploiting quantum superposition for semantic reasoning. The quantum machine learning architecture implements variational quantum eigensolvers and quantum kernel methods for feature space transformation, achieving exponential speedup in specific classification tasks. The quantum-inspired approach applies tensor network decomposition and quantum annealing simulation on classical systems, demonstrating polynomial speedup for optimization problems. The hybrid quantum-classical framework orchestrates workload partitioning between conventional processors and quantum accelerators through dynamic task allocation algorithms, optimizing for quantum circuit depth and classical preprocessing overhead. Quantum optimization leverages quantum annealing and quantum approximate optimization algorithms for solving large-scale combinatorial problems in logistics, finance, and molecular simulation. Quantum natural language processing implements quantum word embeddings in Hilbert space, enabling superposition-based semantic analysis with logarithmic dimensional complexity compared to classical word vector representations. This research establishes theoretical foundations and architectural blueprints for quantum-enhanced artificial intelligence systems, positioning quantum computing as a transformative technology for next-generation machine learning, optimization, and cognitive computing applications.
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.
Quantum Natural language processing (QNLP) is the new technology that incorporates the theory of quantum computing with the linguistic theory to make more effective and transparent models of comprehending natural language. The paper proposes QNLP model of type combining the vector space semantics and the graphical ZX-calculus, applicable to quantum computing to describe, process, and interpret the sentences structure as a quantum circuit. Its approach includes a sentence parsing with a categorial grammar, a mapping of the semantic constituents to products of high dimensional Hilbert spaces and a representation of their interaction with the so-called ZX-diagrams. Such circuits are compiled into quantum instructions and emulated on quantum devices such as Qiskit. The model was compared in terms of the accuracy of parse, preservation of semantics, diagrammatic effectiveness, quantum fidelity and sentence reprehensibility. This has been demonstrated to match the outputs of classical and quantum semantics, by 86 percent on parsing accuracy and above 96% on quantum circuit fidelity. The paper shows ZX-calculus is a potentially powerful and understandable framework to construct large-scale and semantically rich QNLP systems, given near-term quantum hardware.
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.
Quantum Natural Language Processing (QNLP) is an emerging interdisciplinary field at the intersection of quantum computing, natural language understanding, and formal linguistic theory. As advances in quantum hardware and algorithms accelerate, QNLP promises new paradigms for representation learning, semantic modeling, and efficient computation. However, existing literature remains fragmented, with no unified synthesis across modeling, encoding, and evaluation dimensions.In this work, we present the first systematic and taxonomy driven survey of QNLP that holistically organizes research spanning three core dimensions: computational models, encoding paradigms, and evaluation frameworks. First, we analyze foundational approaches that map linguistic structures into quantum formalism, including categorical compositional models, variational quantum circuits, and hybrid quantum classical architectures. Second, we introduce a unified taxonomy of encoding strategies, ranging from quantum tokenization and state preparation to embedding based encodings, highlighting tradeoffs in scalability, noise resilience, and expressiveness. Third, we provide the first comparative synthesis of evaluation methodologies, benchmark datasets, and performance metrics, while identifying reproducibility and standardization gaps.We further contrast quantum inspired NLP methods with fully quantum implemented systems, offering insights into resource efficiency, hardware feasibility, and real world applicability. Finally, we outline open challenges such as integration with LLMs and unified benchmark design, and propose a research agenda for advancing QNLP as a scalable and reliable discipline.