Related papers: Presheaf models of quantum computation: an outline
Based on the Sheaf Logic approach to set theoretic forcing, a hierarchy of Quantum Variable Sets is constructed which generalizes and simplifies the analogous construction developed by Takeuti on boolean valued models of set theory. Over…
In a recent paper, a realizability technique has been used to give a semantics of a quantum lambda calculus. Such a technique gives rise to an infinite number of valid typing rules, without giving preference to any subset of those. In this…
Modeling hydrological fracture networks is a hallmark challenge in computational earth sciences. Accurately predicting critical features of fracture systems, e.g. percolation, can require solving large linear systems far beyond current or…
A research programme is set out for developing the use of high-level methods for quantum computation and information, based on the categorical formulation of quantum mechanics introduced by the author and Bob Coecke.
While quantum machine learning (ML) has been proposed to be one of the most promising applications of quantum computing, how to build quantum ML models that outperform classical ML remains a major open question. Here, we demonstrate a…
For regular linear time-invariant DAEs the corresponding matrix pencil is regular and the computation of a standard canonical form is well-understood. Although the investigation of linear DAEs with time-varying coefficients is more complex,…
Let $\mathcal C$ be a category of a set of (small) categories. This paper concerns with the ${\mathbf {Cat}}$-valued presheaves and sieves over category $\mathcal C.$ Since ${\mathbf {Cat}}$ is not a concrete category, existing definition…
Causal modelling provides a powerful set of tools for identifying causal structure from observed correlations. It is well known that such techniques fail for quantum systems, unless one introduces `spooky' hidden mechanisms. Whether one can…
It is obvious that we still have not any unified framework covering a zoo of interpretations of Quantum Mechanics, as well as satisfactory understanding of main ingredients of a phenomena like entanglement. The starting point is an idea to…
The quantum Lefschetz formula explains how virtual fundamental classes (or structure sheaves) of moduli stacks of stable maps behave when passing from an ambient target scheme to the zero locus of a section. It is only valid under special…
The goal of the presented paper is to provide an introduction to the basic computational models used in quantum information theory. We review various models of quantum Turing machine, quantum circuits and quantum random access machine…
We conduct an extensive study on using near-term quantum computers for a task in the domain of computational biology. By constructing quantum models based on parameterised quantum circuits we perform sequence classification on a task…
We identify morphisms of strong profunctors as a categorification of quantum supermaps. These black-box generalisations of diagrams-with-holes are hence placed within the broader field of profunctor optics, as morphisms in the category of…
For each compact, simple, simply-connected Lie group and each integer level we construct a modular tensor category from a quotient of a certain subcategory of the category of representations of the corresponding quantum group. We determine…
The Heisenberg representation of quantum operators provides a powerful technique for reasoning about quantum circuits, albeit those restricted to the common (non-universal) Clifford set H, S and CNOT. The Gottesman-Knill theorem showed that…
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),…
The categorical models of the differential lambda-calculus are additive categories because of the Leibniz rule which requires the summation of two expressions. This means that, as far as the differential lambda-calculus and differential…
In the topos approach to quantum theory of Doering and Isham the Kochen-Specker Theorem, which asserts the contextual nature of quantum theory, can be reformulated in terms of the global sections of a presheaf characterised by the Gelfand…
A central goal in quantum computing is the development of quantum hardware and quantum algorithms in order to analyse challenging scientific and engineering problems. Research in quantum computation involves contributions from both physics…
A pretorsion theory for the category of all categories is presented. The associated prekernels and precokernels are calculated for every functor.