Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1708.01525

The physical structure of grammatical correlations: equivalences, formalizations and consequences.

Ángel J. Gallego, Román Orús

Published Aug 4, 2017• 4 citations
arXivHTMLPDF

Abstract

Here we consider some well-known facts in syntax from a physics perspective, allowing us to establish equivalences between both fields with many consequences. Mainly, we observe that the operation MERGE, put forward by N. Chomsky in 1995, can be interpreted as a physical information coarse-graining. Thus, MERGE in linguistics entails information renormalization in physics, according to different time scales. We make this point mathematically formal in terms of language models. In this setting, MERGE amounts to a probability tensor implementing a coarse-graining, akin to a probabilistic context-free grammar. The probability vectors of meaningful sentences are given by stochastic tensor networks (TN) built from diagonal tensors and which are mostly loop-free, such as Tree Tensor Networks and Matrix Product States, thus being computationally very efficient to manipulate. We show that this implies the polynomially-decaying (long-range) correlations experimentally observed in language, and also provides arguments in favour of certain types of neural networks for language processing. Moreover, we show how to obtain such language models from quantum states that can be efficiently prepared on a quantum computer, and use this to find bounds on the perplexity of the probability distribution of words in a sentence. Implications of our results are discussed across several ambits.

Related papers

An Epistemic Quantum Framework for Linguistics!

Maneesha Rani Biswas

Abstract Language is not fixed. It is entangled, probabilistic, and observer-dependent. This paper introduces a new paradigm in linguistic theory named "Quantum Linguistics," inspired by the principles of Quantum Physics. Quantum physics and Linguistics have long been regarded as unrelated disciplines,describing nature at the inanimate microlevel on the one hand and language and its scientific study on the other hand. Over the past decades the linguistics has succeeded in providing ever more and refined explanations of generative grammar. Since quantum physics and linguistics deal with the symbolic, rule-governed structure of human language and the non-classical, probabilistic behaviour of subatomic particles, respectively, they have historically been seen as two separate disciplines. This framework allows modeling of polysemy, ambiguity, free word order, and argument structure in a unified, mathematically rigorous manner.To operationalize the model, we implement a Quantum Syntax-Semantics Integration (QSSI) pipeline, which encodes sentences into vector states, applies quantum operations for compositional syntax and semantics, and produces contextually resolved meanings through measurement. Two variants of the pipeline are considered: a classical simulation for experimental validation and a quantum-simulated version for future hardware implementation. The linguistic theory with quantum principles such as superposition, entanglement, and measurement, our model provides a novel probabilistic and context-dependent approach to understand language, explore new insights into human cognitive-linguistic processes, semantic ambiguity observation, and advanced natural language processing applications.

•Mar 13, 2026•0 citations

Quantum Tensor Networks, Stochastic Processes, and Weighted Automata

Siddarth Srinivasan, Sandesh Adhikary, Jacob Miller +2 more

Modeling joint probability distributions over sequences has been studied from many perspectives. The physics community developed matrix product states, a tensor-train decomposition for probabilistic modeling, motivated by the need to tractably model many-body systems. But similar models have also been studied in the stochastic processes and weighted automata literature, with little work on how these bodies of work relate to each other. We address this gap by showing how stationary or uniform versions of popular quantum tensor network models have equivalent representations in the stochastic processes and weighted automata literature, in the limit of infinitely long sequences. We demonstrate several equivalence results between models used in these three communities: (i) uniform variants of matrix product states, Born machines and locally purified states from the quantum tensor networks literature, (ii) predictive state representations, hidden Markov models, norm-observable operator models and hidden quantum Markov models from the stochastic process literature,and (iii) stochastic weighted automata, probabilistic automata and quadratic automata from the formal languages literature. Such connections may open the door for results and methods developed in one area to be applied in another.

arXiv:2010.10653•Oct 20, 2020•6 citations

Operationalism, Causality, and Quantum Theory: a mostly time symmetric perspective

Lucien Hardy

This is a book about operational probabilistic theories. The standard approach in such theories is from a time forward perspective. In this book we mostly take a time symmetric perspective. This presents a branding problem. Is this a niche book merely about time symmetry? No. This is a comprehensive book about operational probabilistic theories, but mostly from a time symmetric perspective. In fact, this book consists of (1) a simple book about simple operations having simple causal structure (where all the inputs are before all the outputs), and (2) a complex book about complex operations that can have complicated causal structure (a complex operation is equipped with a causal diagram). For the simple case we are able to show that the time symmetric perspective is equivalent to the time forward perspective. In each book we set up (A) operational probabilistic theories (OPTs) in terms of operations, (B) Operational Quantum Theory (OQT) in terms of operator tensors which correspond to operations, and (C) the theory of Hilbert objects which can be doubled up to give operator tensors. Operations are required to be physical which guarantees that circuits built out of operations have probabilities between 0 and 1 and that certain causality conditions are met. We prove that when we wire together operations the resulting networks are also physical. We model Sorkin's impossible measurements with complex operations and show that physicality prevents anomalous signalling. We develop diagrammatic notation for Hilbert objects. This includes mirrors for doubling up and mirror theorems. We use this framework to prove time symmetric causal dilation theorems for various causal diagrams.

quant-pharXiv:2603.12076•Mar 13, 2026•1 citation

Foundations for Near-Term Quantum Natural Language Processing

Bob Coecke, Giovanni de Felice, Konstantinos Meichanetzidis +1 more

We provide conceptual and mathematical foundations for near-term quantum natural language processing (QNLP), and do so in quantum computer scientist friendly terms. We opted for an expository presentation style, and provide references for supporting empirical evidence and formal statements concerning mathematical generality. We recall how the quantum model for natural language that we employ canonically combines linguistic meanings with rich linguistic structure, most notably grammar. In particular, the fact that it takes a quantum-like model to combine meaning and structure, establishes QNLP as quantum-native, on par with simulation of quantum systems. Moreover, the now leading Noisy Intermediate-Scale Quantum (NISQ) paradigm for encoding classical data on quantum hardware, variational quantum circuits, makes NISQ exceptionally QNLP-friendly: linguistic structure can be encoded as a free lunch, in contrast to the apparently exponentially expensive classical encoding of grammar. Quantum speed-up for QNLP tasks has already been established in previous work with Will Zeng. Here we provide a broader range of tasks which all enjoy the same advantage. Diagrammatic reasoning is at the heart of QNLP. Firstly, the quantum model interprets language as quantum processes via the diagrammatic formalism of categorical quantum mechanics. Secondly, these diagrams are via ZX-calculus translated into quantum circuits. Parameterisations of meanings then become the circuit variables to be learned. Our encoding of linguistic structure within quantum circuits also embodies a novel approach for establishing word-meanings that goes beyond the current standards in mainstream AI, by placing linguistic structure at the heart of Wittgenstein's meaning-is-context.

arXiv:2012.03755•Dec 7, 2020•144 citations

Capturing Long-Range Memory Structures with Tree-Geometry Process Tensors

Neil Dowling, Kavan Kishore Modi, Roberto N. Muñoz +2 more

We introduce a class of quantum non-Markovian processes—dubbed process trees—that exhibit polynomially decaying temporal correlations and memory distributed across timescales. This class of processes is described by a tensor network with treelike geometry whose component tensors are (1) causality-preserving maps (superprocesses) and (2) locality-preserving temporal change-of-scale transformations. We show that the long-range correlations in this class of processes tends to originate almost entirely from memory effects and can accommodate genuinely quantum power-law correlations in time. Importantly, this class allows efficient computation of multitime correlation functions. To showcase the potential utility of this model-agnostic class for numerical simulation of physical models, we show how it can efficiently approximate the strong memory dynamics of the paradigmatic spin-boson model, in terms of arbitrary multitime features. In contrast to an equivalently costly matrix-product-operator representation, the ansatz produces a fiducial characterization of the relevant physics. Finally, leveraging 2D tensor-network renormalization-group methods, we detail an algorithm for deriving a process tree from an underlying Hamiltonian via the Feynmann-Vernon influence functional. Our work lays the foundation for the development of more efficient numerical techniques in the field of strongly interacting open quantum systems, as well as the theoretical development of a temporal renormalization-group scheme. Published by the American Physical Society 2024

arXiv:2312.04624•Physical Review X•Oct 21, 2024•10 citations

Quantum Language Processing

Nathan Wiebe, Alex Bocharov, Paul Smolensky +2 more

We present a representation for linguistic structure that we call a Fock-space representation, which allows us to embed problems in language processing into small quantum devices. We further develop a formalism for understanding both classical as well as quantum linguistic problems and phrase them both as a Harmony optimization problem that can be solved on a quantum computer which we show is related to classifying vectors using quantum Boltzmann machines. We further provide a new training method for learning quantum Harmony operators that describe a language. This also provides a new algorithm for training quantum Boltzmann machines that requires no approximations and works in the presence of hidden units. We additionally show that quantum language processing is BQP-complete, meaning that it is polynomially equivalent to the circuit model of quantum computing which implies that quantum language models are richer than classical models unless BPP=BQP. It also implies that, under certain circumstances, quantum Boltzmann machines are more expressive than classical Boltzmann machines. Finally, we examine the performance of our approach numerically for the case of classical harmonic grammars and find that the method is capable of rapidly parsing even non-trivial grammars. This suggests that the work may have value as a quantum inspired algorithm beyond its initial motivation as a new quantum algorithm.

arXiv:1902.05162•Feb 13, 2019•42 citations
Here we consider some well-known facts in syntax from a physics perspective, allowing us to establish equivalences between both fields with many consequences. Mainly, we observe that the operation MERGE, put forward by N. Chomsky in 1995, can be interpreted as a physical information coarse-graining. Thus, MERGE in linguistics entails information renormalization in physics, according to different time scales. We make this point mathematically formal in terms of language models. In this setting, MERGE amounts to a probability tensor implementing a coarse-graining, akin to a probabilistic context-free grammar. The probability vectors of meaningful sentences are given by stochastic tensor networks (TN) built from diagonal tensors and which are mostly loop-free, such as Tree Tensor Networks and Matrix Product States, thus being computationally very efficient to manipulate. We show that this implies the polynomially-decaying (long-range) correlations experimentally observed in language, and also provides arguments in favour of certain types of neural networks for language processing. Moreover, we show how to obtain such language models from quantum states that can be efficiently prepared on a quantum computer, and use this to find bounds on the perplexity of the probability distribution of words in a sentence. Implications of our results are discussed across several ambits.
Abstract Language is not fixed. It is entangled, probabilistic, and observer-dependent. This paper introduces a new paradigm in linguistic theory named "Quantum Linguistics," inspired by the principles of Quantum Physics. Quantum physics and Linguistics have long been regarded as unrelated disciplines,describing nature at the inanimate microlevel on the one hand and language and its scientific study on the other hand. Over the past decades the linguistics has succeeded in providing ever more and refined explanations of generative grammar. Since quantum physics and linguistics deal with the symbolic, rule-governed structure of human language and the non-classical, probabilistic behaviour of subatomic particles, respectively, they have historically been seen as two separate disciplines. This framework allows modeling of polysemy, ambiguity, free word order, and argument structure in a unified, mathematically rigorous manner.To operationalize the model, we implement a Quantum Syntax-Semantics Integration (QSSI) pipeline, which encodes sentences into vector states, applies quantum operations for compositional syntax and semantics, and produces contextually resolved meanings through measurement. Two variants of the pipeline are considered: a classical simulation for experimental validation and a quantum-simulated version for future hardware implementation. The linguistic theory with quantum principles such as superposition, entanglement, and measurement, our model provides a novel probabilistic and context-dependent approach to understand language, explore new insights into human cognitive-linguistic processes, semantic ambiguity observation, and advanced natural language processing applications.
Modeling joint probability distributions over sequences has been studied from many perspectives. The physics community developed matrix product states, a tensor-train decomposition for probabilistic modeling, motivated by the need to tractably model many-body systems. But similar models have also been studied in the stochastic processes and weighted automata literature, with little work on how these bodies of work relate to each other. We address this gap by showing how stationary or uniform versions of popular quantum tensor network models have equivalent representations in the stochastic processes and weighted automata literature, in the limit of infinitely long sequences. We demonstrate several equivalence results between models used in these three communities: (i) uniform variants of matrix product states, Born machines and locally purified states from the quantum tensor networks literature, (ii) predictive state representations, hidden Markov models, norm-observable operator models and hidden quantum Markov models from the stochastic process literature,and (iii) stochastic weighted automata, probabilistic automata and quadratic automata from the formal languages literature. Such connections may open the door for results and methods developed in one area to be applied in another.
This is a book about operational probabilistic theories. The standard approach in such theories is from a time forward perspective. In this book we mostly take a time symmetric perspective. This presents a branding problem. Is this a niche book merely about time symmetry? No. This is a comprehensive book about operational probabilistic theories, but mostly from a time symmetric perspective. In fact, this book consists of (1) a simple book about simple operations having simple causal structure (where all the inputs are before all the outputs), and (2) a complex book about complex operations that can have complicated causal structure (a complex operation is equipped with a causal diagram). For the simple case we are able to show that the time symmetric perspective is equivalent to the time forward perspective. In each book we set up (A) operational probabilistic theories (OPTs) in terms of operations, (B) Operational Quantum Theory (OQT) in terms of operator tensors which correspond to operations, and (C) the theory of Hilbert objects which can be doubled up to give operator tensors. Operations are required to be physical which guarantees that circuits built out of operations have probabilities between 0 and 1 and that certain causality conditions are met. We prove that when we wire together operations the resulting networks are also physical. We model Sorkin's impossible measurements with complex operations and show that physicality prevents anomalous signalling. We develop diagrammatic notation for Hilbert objects. This includes mirrors for doubling up and mirror theorems. We use this framework to prove time symmetric causal dilation theorems for various causal diagrams.
We provide conceptual and mathematical foundations for near-term quantum natural language processing (QNLP), and do so in quantum computer scientist friendly terms. We opted for an expository presentation style, and provide references for supporting empirical evidence and formal statements concerning mathematical generality. We recall how the quantum model for natural language that we employ canonically combines linguistic meanings with rich linguistic structure, most notably grammar. In particular, the fact that it takes a quantum-like model to combine meaning and structure, establishes QNLP as quantum-native, on par with simulation of quantum systems. Moreover, the now leading Noisy Intermediate-Scale Quantum (NISQ) paradigm for encoding classical data on quantum hardware, variational quantum circuits, makes NISQ exceptionally QNLP-friendly: linguistic structure can be encoded as a free lunch, in contrast to the apparently exponentially expensive classical encoding of grammar. Quantum speed-up for QNLP tasks has already been established in previous work with Will Zeng. Here we provide a broader range of tasks which all enjoy the same advantage. Diagrammatic reasoning is at the heart of QNLP. Firstly, the quantum model interprets language as quantum processes via the diagrammatic formalism of categorical quantum mechanics. Secondly, these diagrams are via ZX-calculus translated into quantum circuits. Parameterisations of meanings then become the circuit variables to be learned. Our encoding of linguistic structure within quantum circuits also embodies a novel approach for establishing word-meanings that goes beyond the current standards in mainstream AI, by placing linguistic structure at the heart of Wittgenstein's meaning-is-context.
We introduce a class of quantum non-Markovian processes—dubbed process trees—that exhibit polynomially decaying temporal correlations and memory distributed across timescales. This class of processes is described by a tensor network with treelike geometry whose component tensors are (1) causality-preserving maps (superprocesses) and (2) locality-preserving temporal change-of-scale transformations. We show that the long-range correlations in this class of processes tends to originate almost entirely from memory effects and can accommodate genuinely quantum power-law correlations in time. Importantly, this class allows efficient computation of multitime correlation functions. To showcase the potential utility of this model-agnostic class for numerical simulation of physical models, we show how it can efficiently approximate the strong memory dynamics of the paradigmatic spin-boson model, in terms of arbitrary multitime features. In contrast to an equivalently costly matrix-product-operator representation, the ansatz produces a fiducial characterization of the relevant physics. Finally, leveraging 2D tensor-network renormalization-group methods, we detail an algorithm for deriving a process tree from an underlying Hamiltonian via the Feynmann-Vernon influence functional. Our work lays the foundation for the development of more efficient numerical techniques in the field of strongly interacting open quantum systems, as well as the theoretical development of a temporal renormalization-group scheme. Published by the American Physical Society 2024
We present a representation for linguistic structure that we call a Fock-space representation, which allows us to embed problems in language processing into small quantum devices. We further develop a formalism for understanding both classical as well as quantum linguistic problems and phrase them both as a Harmony optimization problem that can be solved on a quantum computer which we show is related to classifying vectors using quantum Boltzmann machines. We further provide a new training method for learning quantum Harmony operators that describe a language. This also provides a new algorithm for training quantum Boltzmann machines that requires no approximations and works in the presence of hidden units. We additionally show that quantum language processing is BQP-complete, meaning that it is polynomially equivalent to the circuit model of quantum computing which implies that quantum language models are richer than classical models unless BPP=BQP. It also implies that, under certain circumstances, quantum Boltzmann machines are more expressive than classical Boltzmann machines. Finally, we examine the performance of our approach numerically for the case of classical harmonic grammars and find that the method is capable of rapidly parsing even non-trivial grammars. This suggests that the work may have value as a quantum inspired algorithm beyond its initial motivation as a new quantum algorithm.