Quantum Algorithms for Compositional Text Processing
<|reference_start|>Quantum Algorithms for Compositional Text Processing: 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.<|reference_end|>
@article{laakkonen2024quantum,
    title={Quantum Algorithms for Compositional Text Processing},
    author={Tuomas Laakkonen (Quantinuum), Konstantinos Meichanetzidis
  (Quantinuum), Bob Coecke (Quantinuum)},
    journal={EPTCS 406, 2024, pp. 162-196},
    year={2024},
    doi={10.4204/EPTCS.406.8},
    archivePrefix={arXiv},
    eprint={2408.06061},
    primaryClass={quant-ph cs.CL}
}