Related papers: Characterization of quantum states in predicative …
A crucial issue both in cognitive and psychoanalytical theories deals with the origin of mental representations. In order to explore this issue, the paper analyzes a pre-logical setting, by considering a formalized approach to the…
The characterization of physical systems requires a comprehensive understanding of quantum effects. One aspect is a proper quantification of the strength of such quantum phenomena. Here, a general convex ordering of quantum states will be…
The hunt for exotic quantum phase transitions described by emergent fractionalized degrees of freedom coupled to gauge fields requires a precise determination of the fixed point structure from the field theoretical side, and an extreme…
Various feature descriptions are being employed in logic programming languages and constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called features. The descriptions…
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…
In this paper, we present a Hoare-style logic for reasoning about quantum programs with classical variables. Our approach offers several improvements over previous work: (1) Enhanced expressivity of the programming language: Our logic…
Recently, the possible existence of quantum processes with indefinite causal order has been extensively discussed, in particular using the formalism of process matrices. Here we give a new perspective on this question, by establishing a…
We study the logic obtained by endowing the language of first-order arithmetic with second-order measure quantifiers. This new kind of quantification allows us to express that the argument formula is true in a certain portion of all…
The coherence of an individual quantum state can be meaningfully discussed only when referring to a preferred basis. This arbitrariness can however be lifted when considering sets of quantum states. Here we introduce the concept of set…
The definition of the conditional probability is very important in the theory of the probability. This definition is based on the fact, that random events can be simultaneously measurable. This paper deal with the problem of conditioning…
The questions we raise in this letter are as follows: What is the most general representation of a quantum state at a single point in time? Can we adapt the current formalisms to situations where the order of quantum operations is…
We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability results.
In this work we first propose to exploit the fundamental properties of quantum physics to evaluate the probability of events with projection measurements. Next, to study what events can be specified by quantum methods, we introduce the…
We demonstrate that the task of determining an unknown quantum state can be accomplished efficiently by making a sequential measurement of two observables $\hat{A}$ and $\hat{B}$, provided that the two observables are chosen in such a way…
Many fundamental and key objects in quantum mechanics are linear mappings between particular affine/linear spaces. This structure includes basic quantum elements such as states, measurements, channels, instruments, non-signalling channels…
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…
We consider the problem of answering queries about formulas of first-order logic based on background knowledge partially represented explicitly as other formulas, and partially represented as examples independently drawn from a fixed…
In this paper we adapt the definitions and results from Apt and Vermeulen on `First order logic as a constraint programming language' (in: Proceedings of LPAR2001, Baaz and Voronkov (eds.), Springer LNAI 2514) to include important ideas…
The subject of this work is quantum predicative programming -- the study of developing of programs intended for execution on a quantum computer. We look at programming in the context of formal methods of program development, or programming…
Most of the stochastic orders for comparing random variables, considered in the literature, are afflicted with two main drawbacks: (i) lack of connex property and (ii) lack of consideration of any dependence structure between the random…