Related papers: A Quantum Interpretation of Bunched Logic for Quan…
In this work we discuss logical structures related to indistinguishable particles. Most of the framework used to develop these structures was presented in [17, 28] and in [20, 14, 15, 16]. We use these structures and constructions to…
Despite rapid progress in the field, it is still challenging to discover new ways to take advantage of quantum computation: all quantum algorithms need to be designed by hand, and quantum mechanics is notoriously counterintuitive. In this…
Presented is a topological representation of quantum logic that views entangled qubit spacetime histories (or qubit world lines) as a generalized braid, referred to as a superbraid. The crossing of world lines is purely quantum in nature,…
I offer an account of how the quantum theory we have helps us explain so much. The account depends on a pragmatist interpretation of the theory: This takes a quantum state to serve solely as a source of sound advice to physically situated…
Separation logic and its variants can describe various properties on pointer programs. However, when it comes to properties on sequences, one may find it hard to formalize. To deal with properties on variable-length sequences and multilevel…
Quantum copy protection, introduced by Aaronson, enables giving out a quantum program-description that cannot be meaningfully duplicated. Despite over a decade of study, copy protection is only known to be possible for a very limited class…
This paper contributes to a burgeoning area of investigation, the ambiguity inherent in mathematics and the implications for physics of this ambiguity. To display the mathematical form of equations of quantum theory used to describe…
We apply residuated structures associated with fuzzy logic to develop certain aspects of information processing in quantum computing from a logical perspective. For this purpose, we introduce an axiomatic system whose natural interpretation…
Conditioning is a key feature in probabilistic programming to enable modeling the influence of data (also known as observations) to the probability distribution described by such programs. Determining the posterior distribution is also…
Entangled systems in experiments may be lost or offline in distributed quantum information processing. This inspires a general problem to characterize quantum operations which result in breaking of entanglement or not. Our goal in this work…
We introduce a generalized logic programming paradigm where programs, consisting of facts and rules with the usual syntax, can be enriched by co-facts, which syntactically resemble facts but have a special meaning. As in coinductive logic…
Type-based amortised resource analysis following Hofmann and Jost---where resources are associated with individual elements of data structures and doled out to the programmer under a linear typing discipline---have been successful in…
This study examines the simulation of quantum algorithms on a classical computer. The program code implemented on a classical computer will be a straight connection between the mathematical formulation of quantum mechanics and computational…
We show that quantum computation circuits with coherent states as the logical qubits can be constructed using very simple linear networks, conditional measurements and coherent superposition resource states.
We introduce algebraic sets in the products of complex projective spaces for the mixed states in multipartite quantum systems as their invariants under local unitary operations. The algebraic sets have to be the union of the linear…
We extend the simply-typed guarded $\lambda$-calculus with discrete probabilities and endow it with a program logic for reasoning about relational properties of guarded probabilistic computations. This provides a framework for programming…
We present Coneris, the first higher-order concurrent separation logic for reasoning about error probability bounds of higher-order concurrent probabilistic programs with higher-order state. To support modular reasoning about concurrent…
The standard theory of quantum computation relies on the idea that the basic information quantity is represented by a superposition of elements of the canonical basis and the notion of probability naturally follows from the Born rule. In…
We investigate the exploitation of various combinatorial properties of graphs and set systems to study several issues in quantum information theory. We characterize the combinatorics of distributed EPR pairs for preparing multi-partite…
It is well known that the classification of pure multiparticle entangled states according to stochastic local operations leads to a natural classification of mixed states in terms of convex sets. We present a simple algorithmic procedure to…