The reviewed record of science sign in
Pith

arxiv: 2409.08777 · v1 · pith:N2373VN6 · submitted 2024-09-13 · quant-ph

Scalable and interpretable quantum natural language processing: an implementation on trapped ions

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:N2373VN6record.jsonopen to challenge →

classification quant-ph
keywords compositionalquantummodelimplementationtaskapproachbehaviourclassically
0
0 comments X
read the original abstract

We present the first implementation of text-level quantum natural language processing, a field where quantum computing and AI have found a fruitful intersection. We focus on the QDisCoCirc model, which is underpinned by a compositional approach to rendering AI interpretable: the behaviour of the whole can be understood in terms of the behaviour of parts, and the way they are put together. Interpretability is crucial for understanding the unwanted behaviours of AI. By leveraging the compositional structure in the model's architecture, we introduce a novel setup which enables 'compositional generalisation': we classically train components which are then composed to generate larger test instances, the evaluation of which asymptotically requires a quantum computer. Another key advantage of our approach is that it bypasses the trainability challenges arising in quantum machine learning. The main task that we consider is the model-native task of question-answering, and we handcraft toy scale data that serves as a proving ground. We demonstrate an experiment on Quantinuum's H1-1 trapped-ion quantum processor, which constitutes the first proof of concept implementation of scalable compositional QNLP. We also provide resource estimates for classically simulating the model. The compositional structure allows us to inspect and interpret the word embeddings the model learns for each word, as well as the way in which they interact. This improves our understanding of how it tackles the question-answering task. As an initial comparison with classical baselines, we considered transformer and LSTM models, as well as GPT-4, none of which succeeded at compositional generalisation.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. String Diagrams for Quantum Foundations, Computing and Natural Language Processing

    quant-ph 2026-05 unverdicted novelty 6.0

    String diagrams formalize constructor theory with locality-composition conflicts, enable wave-based Boolean logic design and optimization, and map Urdu text circuits equivalently to English ones up to gate translation...

  2. Compositional Quantum Heuristics for Max-Clique Detection

    quant-ph 2026-05 unverdicted novelty 5.0

    Compositional quantum circuits with symmetry-induced invariant losses produce trainable equivariant quantum GNNs that generalize on max-clique problems and improve hybrid recursive search accuracy and scalability.