Related papers: Quantitative testing semantics for non-interleavin…
Message passing is a key ingredient of concurrent programming. The purpose of this paper is to describe the equivalence between the proof theory, the categorical semantics, and term calculus of message passing. In order to achieve this we…
Theory of quantum measurements is often classified as decision theory. An event in decision theory corresponds to the measurement of an observable. This analogy looks clear for operationally testable simple events. However, the situation is…
Non-classical probability (along with its underlying logic) is a defining feature of quantum mechanics. A formulation that incorporates them, inherently and directly, would promise a unified description of seemingly different prescriptions…
This paper shows how we can make use of an asynchronous transition system, whose transitions are labelled with events and which is equipped with a notion of independence of events, to define non-interleaving semantics for the applied…
A computer code can simulate a system's propagation of variation from random inputs to output measures of quality. Our aim here is to estimate a critical output tail probability or quantile without a large Monte Carlo experiment. Instead,…
Recently, it was shown that most popular IR measures are not interval-scaled, implying that decades of experimental IR research used potentially improper methods, which may have produced questionable results. However, it was unclear if and…
Measurements serve as the intermediate communication layer between the quantum world and our classical perception. So, the question which measurements efficiently extract information from quantum systems is of central interest. Using…
Quantum causality extends the conventional notion of fixed causal structure by allowing channels and operations to act in an indefinite causal order. The importance of such an indefinite causal order ranges from the foundational---e.g.…
Tarski gave a general semantics for deductive reasoning: a formula a may be deduced from a set A of formulas iff a holds in all models in which each of the elements of A holds. A more liberal semantics has been considered: a formula a may…
Testing whether a probability distribution is compatible with a given Bayesian network is a fundamental task in the field of causal inference, where Bayesian networks model causal relations. Here we consider the class of causal structures…
While the standard formulation of quantum theory assumes a fixed background causal structure, one can relax this assumption within the so-called process matrix framework. Remarkably, some processes, termed causally nonseparable, are…
Quantum computation has suggested new forms of quantum logic, called quantum computational logics. The basic semantic idea is the following: the meaning of a sentence is identified with a quregister, a system of qubits, representing a…
The indeterministic outcome of a measurement of an individual quantum is certified by the impossibility of the simultaneous, definite, deterministic pre-existence of all conceivable observables from physical conditions of that quantum…
A provenance analysis for a query evaluation or a model checking computation extracts information on how its result depends on the atomic facts of the model or database. Traditional work on data provenance was, to a large extent, restricted…
We propose an exercise in which one attempts to deduce the formalism of quantum mechanics solely from phenomenological observations. The only assumed inputs are obtained through sequential probing of quantum systems; no presuppositions…
More than a century after the inception of quantum theory, the question of which traits and phenomena are fundamentally quantum remains under debate. Here we give an answer to this question for temporal processes which are probed…
We investigate the possibility of a semantic account of the execution time (i.e. the number of beta-steps leading to the normal form, if any) for the shuffling calculus, an extension of Plotkin's call-by-value lambda-calculus. For this…
We propose a notion of quantum control in a quantum programming language which permits the superposition of finitely many quantum operations without performing a measurement. This notion takes the form of a conditional construct similar to…
To represent anything from mathematical concepts to real-world objects, we have to resort to an encoding. Encodings, such as written language, usually assume a decoder that understands a rich shared code. A semantic embedding is a form of…
Programming a quantum computer, i.e., implementing quantum algorithms on a quantum processor-based copmputer architecture, is a task that can be addressed (just as for classical computers) at different levels of abstraction. This paper…