English
Related papers

Related papers: The Quantum Monadology

200 papers

Quantum computation is a novel way of information processing which allows, for certain classes of problems, exponential speedups over classical computation. Various models of quantum computation exist, such as the adiabatic, circuit and…

Quantum Physics · Physics 2012-08-02 Robert Raussendorf , Tzu-Chieh Wei

The main contribution of the present paper is the introduction of a simple yet expressive hybrid-dynamic logic for describing quantum programs. This version of quantum logic can express quantum measurements and unitary evolutions of states…

Logic in Computer Science · Computer Science 2024-06-05 Daniel Gaina

The two main notions of control in quantum programming languages are often referred to as "quantum" control and "classical" control. With the latter, the control flow is based on classical information, potentially resulting from a quantum…

Logic in Computer Science · Computer Science 2025-12-01 Kinnari Dave , Louis Lemonnier , Romain Péchoux , Vladimir Zamdzhiev

We show how to smoothly incorporate in the object-oriented paradigm constructs to raise, compose, and handle effects in an arbitrary monad. The underlying pure calculus is meant to be a representative of the last generation of OO languages,…

Programming Languages · Computer Science 2025-04-23 Francesco Dagnino , Paola Giannini , Elena Zucca

In monadic programming, datatypes are presented as free algebras, generated by data values, and by the algebraic operations and equations capturing some computational effects. These algebras are free in the sense that they satisfy just the…

Logic in Computer Science · Computer Science 2023-11-03 Dusko Pavlovic , Peter-Michael Seidel

Recent works have shown that defining a behavioural equivalence that matches the observational properties of a quantum-capable, concurrent, non-deterministic system is a surprisingly difficult task. We explore coalgebras over distributions…

Logic in Computer Science · Computer Science 2025-09-26 Lorenzo Ceragioli , Elena Di Lavore , Giuseppe Lomurno , Gabriele Tedeschi

This article contains a proposal to add coinduction to the computational apparatus of natural language understanding. This, we argue, will provide a basis for more realistic, computationally sound, and scalable models of natural language…

Computation and Language · Computer Science 2020-12-11 Wlodek W. Zadrozny

Quantum computing exploits quantum phenomena such as superposition and entanglement to realize a form of parallelism that is not available to traditional computing. It offers the potential of significant computational speed-ups in quantum…

As quantum computers become real, it is high time we come up with effective techniques that help programmers write correct quantum programs. Inspired by Hoare Type Theory in classical computing, we propose Quantum Hoare Type Theory (QHTT),…

Programming Languages · Computer Science 2021-11-16 Kartik Singhal

Theories of natural language and concepts have been unable to model the flexibility, creativity, context-dependence, and emergence, exhibited by words, concepts and their combinations. The mathematical formalism of quantum theory has…

Artificial Intelligence · Computer Science 2016-09-09 Diederik Aerts , Jan Broekaert , Liane Gabora , Sandro Sozzo

A new class of modified gravity theories, made possible by subtle features of the canonical formulation of general covariance, naturally allows MOND-like behavior (MOdified Newtonian Dynamics) in effective space-time solutions without…

General Relativity and Quantum Cosmology · Physics 2023-11-01 Martin Bojowald , Erick I. Duque

We introduce a novel quantum programming language featuring higher-order programs and quantum controlflow which ensures that all qubit transformations are unitary. Our language boasts a type system guaranteeingboth unitarity and…

Logic in Computer Science · Computer Science 2024-03-06 Alejandro Díaz-Caro , Emmanuel Hainry , Romain Péchoux , Mário Silva

Free categorical constructions characterise quantum computing as the combination of two copies of a reversible classical model, glued by the complementarity equations of classical structures. This recipe effectively constructs a…

Programming Languages · Computer Science 2025-11-25 Jacques Carette , Chris Heunen , Robin Kaarsgaard , Amr Sabry

We provide a new characterisation of quantum supermaps in terms of an axiom that refers only to sequential and parallel composition. Consequently, we generalize quantum supermaps to arbitrary monoidal categories and operational…

Quantum Physics · Physics 2026-03-11 Matt Wilson , Giulio Chiribella , Aleks Kissinger

The notion of effectus from categorical logic is relevant in the emerging field of categorical probability theory. In some cases, stochastic maps are represented by maps in the Kleisli category of some probability monad. Quantum…

Logic in Computer Science · Computer Science 2020-05-04 Octavio Zapata

Quantum Natural Language Processing (QNLP) deals with the design and implementation of NLP models intended to be run on quantum hardware. In this paper, we present results on the first NLP experiments conducted on Noisy Intermediate-Scale…

Computation and Language · Computer Science 2023-05-05 Robin Lorenz , Anna Pearson , Konstantinos Meichanetzidis , Dimitri Kartsaklis , Bob Coecke

Hybrid computation combines discrete and continuous dynamics in the form of an entangled mixture inherently present both in various natural phenomena, and in applications ranging from control theory to microbiology. The emergent behaviours…

Logic in Computer Science · Computer Science 2019-07-19 Sergey Goncharov , Renato Neves

This paper introduces the Quantum Contextual Topos (QCT), a novel framework that extends traditional quantum logic by embedding contextual elements within a topos-theoretic structure. This framework seeks to provide a classically-obedient…

Logic · Mathematics 2024-09-20 Jesse Werbow

Computer science provides an in-depth understanding of technical aspects of programming concepts, but if we want to understand how programming concepts evolve, how programmers think and talk about them and how they are used in practice, we…

Programming Languages · Computer Science 2018-03-28 Tomas Petricek

Regular languages -- the languages accepted by deterministic finite automata -- are known to be precisely the languages recognized by finite monoids. This characterization is the origin of algebraic language theory. In this paper, we…

Formal Languages and Automata Theory · Computer Science 2025-05-06 Fabian Lenke , Stefan Milius , Henning Urbat , Thorsten Wißmann