String Diagrams for Quantum Foundations, Computing and Natural Language Processing

• URL: http://arxiv.org/abs/2605.11417v1
• Date: Tue, 12 May 2026 02:11:44 GMT
• Title: String Diagrams for Quantum Foundations, Computing and Natural Language Processing
• Abstract summary: We use string diagrams to investigate topics in the areas of quantum foundations, computing, and natural language processing.<n>We develop a formalism for wave-based logic circuits with phase encoding.<n>We investigate the elimination of inter-language grammatical bureaucracy in the distributional compositional circuits.
• Score: 0.38073142980733005
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Applied category theory provides powerful mathematical tools for modelling processes and their composition. Symmetric monoidal categories, which involve series and parallel composition, are particularly well-suited for describing the composition of processes in space and time. Also called process theories, they admit string diagrams, which constitute a visually intuitive, mathematically rigorous, expressive and flexible syntax that is applicable to wide-ranging scientific domains. In this thesis, we employ string diagrams to investigate a selection of topics in the areas of quantum foundations, computing, and natural language processing: (1) We formalise constructor theory as a process theory. In the context of quantum physics, we also demonstrate the conflict between constructor-theoretic principles of locality and composition. Moreover, we argue that if the principle of locality is rejected, categorical quantum mechanics (CQM) can be conceived as a constructor theory of quantum physics. (2) We develop a formalism for wave-based logic circuits with phase encoding. We motivate the formalism using the example of spin-wave circuits, and then demonstrate its utility in design, analysis and optimisation of Boolean logic circuits. (3) We investigate the elimination of inter-language grammatical bureaucracy in the distributional compositional circuits (DisCoCirc) framework. In particular, we develop a hybrid grammar for a restricted fragment of the Urdu language, and show that Urdu text endowed with this hybrid grammar maps surjectively to DisCoCirc text circuits. Furthermore, we show that for the same language fragment, Urdu and English text circuits become the same up to gate-level translation. The aforementioned work supports the view that a process-relational outlook in science is well-supported by applied category-theoretic tools, particularly string diagrams.

Related papers

• Towards Physics-Faithful Generation of Scientific Diagrams [60.50428624576465]
  Princigram is a physics-faithful scientific-diagram generator.<n>We present Princigram, a physics-faithful scientific-diagram generator.
  arXiv  Detail & Related papers  (2026-08-13T11:40:33Z)
• Quantum algorithms for equational reasoning [0.0]
  We introduce quantum normal form reduction, a quantum computational framework for analyzing symbolic expressions.<n>We demonstrate a quantum-inspired version of the algorithm using tensor network simulations.<n>This framework opens the path for quantum symbolic computation in areas ranging from quantum and logical circuit design to data compression.
  arXiv  Detail & Related papers  (2025-08-28T18:00:06Z)
• Generalised Process Theories [0.0]
  We propose an alternative formalization using operad algebras, motivated by recent results connecting SMCs to operadic structures.<n>We provide an accessible yet rigorous formulation that unifies and extends traditional process-theoretic approaches.
  arXiv  Detail & Related papers  (2025-02-14T18:47:07Z)
• An Encoding of Abstract Dialectical Frameworks into Higher-Order Logic [57.24311218570012]
  This approach allows for the computer-assisted analysis of abstract dialectical frameworks. Exemplary applications include the formal analysis and verification of meta-theoretical properties.
  arXiv  Detail & Related papers  (2023-12-08T09:32:26Z)
• Pregeometry, Formal Language and Constructivist Foundations of Physics [0.0]
  We discuss the metaphysics of pregeometric structures, upon which new and existing notions of quantum geometry may find a foundation. We draw attention to evidence suggesting that the framework of formal language, in particular, homotopy type theory, provides the conceptual building blocks for a theory of pregeometry.
  arXiv  Detail & Related papers  (2023-11-07T13:19:29Z)
• Query Structure Modeling for Inductive Logical Reasoning Over Knowledge Graphs [67.043747188954]
  We propose a structure-modeled textual encoding framework for inductive logical reasoning over KGs. It encodes linearized query structures and entities using pre-trained language models to find answers. We conduct experiments on two inductive logical reasoning datasets and three transductive datasets.
  arXiv  Detail & Related papers  (2023-05-23T01:25:29Z)
• Linear Spaces of Meanings: Compositional Structures in Vision-Language Models [110.00434385712786]
  We investigate compositional structures in data embeddings from pre-trained vision-language models (VLMs) We first present a framework for understanding compositional structures from a geometric perspective. We then explain what these structures entail probabilistically in the case of VLM embeddings, providing intuitions for why they arise in practice.
  arXiv  Detail & Related papers  (2023-02-28T08:11:56Z)
• Categorical Tools for Natural Language Processing [0.0]
  This thesis develops the translation between category theory and computational linguistics. The three chapters deal with syntax, semantics and pragmatics. The resulting functorial models can be composed to form games where equilibria are the solutions of language processing tasks.
  arXiv  Detail & Related papers  (2022-12-13T15:12:37Z)
• Category Theory for Quantum Natural Language Processing [0.0]
  This thesis introduces quantum natural language processing (QNLP) models based on an analogy between computational linguistics and quantum mechanics. The grammatical structure of text and sentences connects the meaning of words in the same way that entanglement structure connects the states of quantum systems. We turn this abstract analogy into a concrete algorithm that translates the grammatical structure onto the architecture of parameterised quantum circuits. We then use a hybrid classical-quantum algorithm to train the model so that evaluating the circuits computes the meaning of sentences in data-driven tasks.
  arXiv  Detail & Related papers  (2022-12-13T14:38:57Z)
• LQP: The Dynamic Logic of Quantum Information [77.34726150561087]
  This paper introduces a dynamic logic formalism for reasoning about information flow in composite quantum systems. We present a finitary syntax, a relational semantics and a sound proof system for this logic. As applications, we use our system to give formal correctness for the Teleportation protocol and for a standard Quantum Secret Sharing protocol.
  arXiv  Detail & Related papers  (2021-10-04T12:20:23Z)
• The Logic of Quantum Programs [77.34726150561087]
  We present a logical calculus for reasoning about information flow in quantum programs. In particular we introduce a dynamic logic that is capable of dealing with quantum measurements, unitary evolutions and entanglements in compound quantum systems.
  arXiv  Detail & Related papers  (2021-09-14T16:08:37Z)
• PBS-Calculus: A Graphical Language for Coherent Control of Quantum Computations [77.34726150561087]
  We introduce the PBS-calculus to represent and reason on quantum computations involving coherent control of quantum operations. We equip the language with an equational theory, which is proved to be sound and complete. We consider applications like the implementation of controlled permutations and the unrolling of loops.
  arXiv  Detail & Related papers  (2020-02-21T16:15:58Z)

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.