A Quantum Natural Language Processing Approach to Pronoun Resolution

• URL: http://arxiv.org/abs/2208.05393v1
• Date: Wed, 10 Aug 2022 15:22:58 GMT
• Title: A Quantum Natural Language Processing Approach to Pronoun Resolution
• Authors: Hadi Wazni, Kin Ian Lo, Lachlan McPheat, Mehrnoosh Sadrzadeh
• Abstract summary: We use the Lambek Calculus to model and reason about discourse relations such as anaphora and ellipsis. A semantics for this logic is obtained by using truncated Fock spaces, developed in our previous work. We extend the existing translation to Fock spaces and develop quantum circuit semantics for discourse relations.
• Score: 1.5293427903448022
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We use the Lambek Calculus with soft sub-exponential modalities to model and reason about discourse relations such as anaphora and ellipsis. A semantics for this logic is obtained by using truncated Fock spaces, developed in our previous work. We depict these semantic computations via a new string diagram. The Fock Space semantics has the advantage that its terms are learnable from large corpora of data using machine learning and they can be experimented with on mainstream natural language tasks. Further, and thanks to an existing translation from vector spaces to quantum circuits, we can also learn these terms on quantum computers and their simulators, such as the IBMQ range. We extend the existing translation to Fock spaces and develop quantum circuit semantics for discourse relations. We then experiment with the IBMQ AerSimulations of these circuits in a definite pronoun resolution task, where the highest accuracies were recorded for models when the anaphora was resolved.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Tensor Networks or Decision Diagrams? Guidelines for Classical Quantum Circuit Simulation [65.93830818469833]
  tensor networks and decision diagrams have independently been developed with differing perspectives, terminologies, and backgrounds in mind. We consider how these techniques approach classical quantum circuit simulation, and examine their (dis)similarities with regard to their most applicable abstraction level. We provide guidelines for when to better use tensor networks and when to better use decision diagrams in classical quantum circuit simulation.
  arXiv  Detail & Related papers  (2023-02-13T19:00:00Z)
• A didactic approach to quantum machine learning with a single qubit [68.8204255655161]
  We focus on the case of learning with a single qubit, using data re-uploading techniques. We implement the different proposed formulations in toy and real-world datasets using the qiskit quantum computing SDK.
  arXiv  Detail & Related papers  (2022-11-23T18:25:32Z)
• Near-Term Advances in Quantum Natural Language Processing [0.03298597939573778]
  This paper describes experiments showing that some tasks in natural language processing can already be performed using quantum computers. The first uses an explicit word-based approach, in which word-topic scoring weights are implemented as fractional rotations of individual qubit. A new phrase is classified based on the accumulation of these weights in a scoring qubit using entangling controlled-NOT gates.
  arXiv  Detail & Related papers  (2022-06-05T13:10:46Z)
• A gentle introduction to Quantum Natural Language Processing [0.0]
  The main goal of this master's thesis is to introduce Quantum Natural Language Processing. QNLP aims at representing sentences' meaning as vectors encoded into quantum computers.
  arXiv  Detail & Related papers  (2022-02-23T20:17:00Z)
• SML: a new Semantic Embedding Alignment Transformer for efficient cross-lingual Natural Language Inference [71.57324258813674]
  The ability of Transformers to perform with precision a variety of tasks such as question answering, Natural Language Inference (NLI) or summarising, have enable them to be ranked as one of the best paradigms to address this kind of tasks at present. NLI is one of the best scenarios to test these architectures, due to the knowledge required to understand complex sentences and established a relation between a hypothesis and a premise. In this paper, we propose a new architecture, siamese multilingual transformer, to efficiently align multilingual embeddings for Natural Language Inference.
  arXiv  Detail & Related papers  (2021-03-17T13:23:53Z)
• Facial Expression Recognition on a Quantum Computer [68.8204255655161]
  We show a possible solution to facial expression recognition using a quantum machine learning approach. We define a quantum circuit that manipulates the graphs adjacency matrices encoded into the amplitudes of some appropriately defined quantum states.
  arXiv  Detail & Related papers  (2021-02-09T13:48:00Z)
• Quantum Mathematics in Artificial Intelligence [4.958574440736237]
  This paper describes some of the common mathematical areas, including examples of how they are used in artificial intelligence (AI) Some of these approaches can potentially be implemented on quantum hardware.
  arXiv  Detail & Related papers  (2021-01-12T01:35:56Z)
• Foundations for Near-Term Quantum Natural Language Processing [0.17205106391379021]
  We provide conceptual and mathematical foundations for near-term quantum natural language processing (QNLP) We recall how the quantum model for natural language that we employ canonically combines linguistic meanings with rich linguistic structure. We provide references for supporting empirical evidence and formal statements concerning mathematical generality.
  arXiv  Detail & Related papers  (2020-12-07T14:49:33Z)
• Efficient simulatability of continuous-variable circuits with large Wigner negativity [62.997667081978825]
  Wigner negativity is known to be a necessary resource for computational advantage in several quantum-computing architectures. We identify vast families of circuits that display large, possibly unbounded, Wigner negativity, and yet are classically efficiently simulatable. We derive our results by establishing a link between the simulatability of high-dimensional discrete-variable quantum circuits and bosonic codes.
  arXiv  Detail & Related papers  (2020-05-25T11:03:42Z)
• Quantum Natural Language Processing on Near-Term Quantum Computers [0.0]
  We describe a full-stack pipeline for natural language processing on near-term quantum computers, aka QNLP. DisCoCat is a language-modelling framework that extends and complements the compositional structure of pregroup grammars. We present a method for mapping DisCoCat diagrams to quantum circuits.
  arXiv  Detail & Related papers  (2020-05-08T16:42:54Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.