Putting a Spin on Language: A Quantum Interpretation of Unary Connectives for Linguistic Applications

Correia, A. D.; Stoof, H. T. C.; Moortgat, Michael

doi:10.4204/eptcs.340.6

Cited by 3 publications

(3 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To handle the well-documented problems of over/undergeneration of (N)L /,\ in a principled way, the logics can be extended with modalities that allow for controlled forms of reordering and/or restructuring. We address these extensions in [36].…”

Section: From Proofs To Programsmentioning

confidence: 99%

“…[94] for a survey, and Ref. [36] for a quantum interpretation of such structural control operations.…”

Section: Type Logic As Syntaxmentioning

confidence: 99%

“…Furthermore, a number of theoretical advances using the tensor contractions from DisCoCat cannot be directly reproduced, since the mapping from a phrase to a circuit requires extra steps that deviate from the original grammatical foundation, not treating every word as an input at the same level. We refer here to the work done in expanding the toolbox of word representations with density matrices [108], so as to achieve good results on discerning different word and phrase senses [9,84,118], and in entertaining simultaneously different possible interpretations of texts, either by looking at an incremental interpretation of the parsing process [127], or by considering a single representation for the multiple readings of syntactic ambiguities [35,36]. This presents a strong incentive to find an alternative quantum-circuit implementation that sticks to the original grammatical formulation, preserving the previous achievements, where all words are taken as input on an equal footing.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Quantum distributional semantics

Correia¹

View full text Add to dashboard Cite

show abstract

Section: From Proofs To Programsmentioning

confidence: 99%

“…[94] for a survey, and Ref. [36] for a quantum interpretation of such structural control operations.…”

Section: Type Logic As Syntaxmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Quantum distributional semantics

Correia¹

View full text Add to dashboard Cite

show abstract

Quantum computations for disambiguation and question answering

Correia

Moortgat

Stoof

2022

Quantum Inf Process

View full text Add to dashboard Cite

Automatic text processing is now a mature discipline in computer science, and so attempts at advancements using quantum computation have emerged as the new frontier, often under the term of quantum natural language processing. The main challenges consist in finding the most adequate ways of encoding words and their interactions on a quantum computer, considering hardware constraints, as well as building algorithms that take advantage of quantum architectures, so as to show improvement on the performance of natural language tasks. In this paper, we introduce a new framework that starts from a grammar that can be interpreted by means of tensor contraction, to build word representations as quantum states that serve as input to a quantum algorithm. We start by introducing an operator measurement to contract the representations of words, resulting in the representation of larger fragments of text. We then go on to develop pipelines for the tasks of sentence meaning disambiguation and question answering that take advantage of quantum features. For the first task, we show that our contraction scheme deals with syntactically ambiguous phrases storing the various different meanings in quantum superposition, a solution not available on a classical setting. For the second task, we obtain a question representation that contains all possible answers in equal quantum superposition, and we implement Grover’s quantum search algorithm to find the correct answer, agnostic to the specific question, an implementation with the potential of delivering a result with quadratic speedup.

show abstract

Grover's Algorithm for Question Answering

Correia

Moortgat²,

Stoof³

2021

Preprint

View full text Add to dashboard Cite

Grover's algorithm, a well-know quantum search algorithm, allows one to find the correct item in a database, with quadratic speedup. In this paper we adapt Grover's algorithm to the problem of finding a correct answer to a natural language question in English, thus contributing to the growing field of Quantum Natural Language Processing. Using a grammar that can be interpreted as tensor contractions, each word is represented as a quantum state that serves as input to the quantum circuit. We here introduce a quantum measurement to contract the representations of words, resulting in the representation of larger text fragments. Using this framework, a representation for the question is found that contains all the possible answers in equal quantum superposition, and allows for the building of an oracle that can detect a correct answer, being agnostic to the specific question. Furthermore, we show that our construction can deal with certain types of ambiguous phrases by keeping the various different meanings in quantum superposition.

show abstract

Putting a Spin on Language: A Quantum Interpretation of Unary Connectives for Linguistic Applications

Cited by 3 publications

References 17 publications

Quantum distributional semantics

Quantum distributional semantics

Quantum computations for disambiguation and question answering

Grover's Algorithm for Question Answering

Contact Info

Product

Resources

About