Quantum Natural Language Processing on Near-Term Quantum Computers

Abstract

In this work, we describe a full-stack pipeline for natural language processing on near-term quantum computers, aka QNLP. The language-modelling framework we employ is that of compositional distributional semantics (DisCoCat), which extends and complements the compositional structure of pregroup grammars. Within this model, the grammatical reduction of a sentence is interpreted as a diagram, encoding a specific interaction of words according to the grammar. It is this interaction which, together with a specific choice of word embedding, realises the meaning (or "semantics") of a sentence. Building on the formal quantum-like nature of such interactions, we present a method for mapping DisCoCat diagrams to quantum circuits. Our methodology is compatible both with NISQ devices and with established Quantum Machine Learning techniques, paving the way to near-term applications of quantum technology to natural language processing.

arXiv commentIn Proceedings QPL 2020, arXiv:2109.01534. This work was originally commissioned by Cambridge Quantum Computing (CQC) and was carried out independently by the CQC team and the Hashberg team

References in corpus (16)

• Quantum Computing in the NISQ era and beyond
• Supervised learning with quantum enhanced feature spaces
• An introduction to quantum machine learning
• Parameterized quantum circuits as machine learning models
• Quantum machine learning: a classical perspective
• Architectures for a quantum random access memory
• Interacting Quantum Observables: Categorical Algebra and Diagrammatics
• The Frobenius anatomy of word meanings I: subject and object relative pronouns
• Advances in Quantum Reinforcement Learning
• Quantum Algorithms for Compositional Natural Language Processing
• A Study of Entanglement in a Categorical Framework of Natural Language
• The Frobenius anatomy of word meanings II: possessive relative pronouns
• Sentence Entailment in Compositional Distributional Semantics
• Interacting Conceptual Spaces
• Coherence for Frobenius pseudomonoids and the geometry of linear proofs
• A Corpus-based Toy Model for DisCoCat

Cited by in corpus (10)

• The Presence and Absence of Barren Plateaus in Tensor-network Based Machine Learning
• Avoiding Barren Plateaus with Classical Deep Neural Networks
• ResQNets: A Residual Approach for Mitigating Barren Plateaus in Quantum Neural Networks
• Grammar-aware sentence classification on quantum computers
• Quantum Picturalism: Learning Quantum Theory in High School
• Completeness for arbitrary finite dimensions of ZXW-calculus, a unifying calculus
• Quantum-machine-assisted Drug Discovery
• The Qupit Stabiliser ZX-travaganza: Simplified Axioms, Normal Forms and Graph-Theoretic Simplification
• Quantum Algorithms for Compositional Text Processing
• Lambek pregroups are Frobenius spiders in preorders