Related papers: Decision problems on unary probabilistic and quant…
Relational quantum queries are sometimes capable to effectively decide between collections of mutually exclusive elementary cases without completely resolving and determining those individual instances. Thereby the set of mutually exclusive…
We introduce the class of synchronous subsequential relations, a subclass of the synchronous relations which embodies some properties of subsequential relations. If we take relations of this class as forming the possible transitions of an…
We propose that a quantum particle in a potential in one space dimension can be described by a probabilistic cellular automaton. While the simple updating rule of the automaton is deterministic, the probabilistic description is introduced…
The multitime multiple recurrences are common in analysis of algorithms, computational biology, information theory, queueing theory, filters theory, statistical physics etc. The theoretical part about them is little or not known. That is…
We consider N quantum systems initially prepared in pure states and address the problem of unambiguously comparing them. One may ask whether or not all $N$ systems are in the same state. Alternatively, one may ask whether or not the states…
This survey, aimed at information processing researchers, highlights intriguing but lesser known results, corrects misconceptions, and suggests research areas. Themes include: certainty in quantum algorithms; the "fewer worlds" theory of…
Through extended consideration of two wide classes of case studies -- dilute gases and linear systems -- I explore the ways in which assumptions of probability and irreversibility occur in contemporary statistical mechanics, where the…
Probabilistic programming combines general computer programming, statistical inference, and formal semantics to help systems make decisions when facing uncertainty. Probabilistic programs are ubiquitous, including having a significant…
Two problems will be considered: the question of hidden parameters and the problem of Kolmogorovity of quantum probabilities. Both of them will be analyzed from the point of view of two distinct understandings of quantum mechanical…
Recent work has examined how undecidable problems can arise in quantum information science. We augment this by introducing three new undecidable problems stated in terms of tensor networks. These relate to ideas of Penrose about the…
We consider the problem of learning a non-deterministic probabilistic system consistent with a given finite set of positive and negative tree samples. Consistency is defined with respect to strong simulation conformance. We propose learning…
This survey is focused on certain sequential decision-making problems that involve optimizing over probability functions. We discuss the relevance of these problems for learning and control. The survey is organized around a framework that…
In this paper we study a subclass of pebble automata (PA) for data languages for which the emptiness problem is decidable. Namely, we introduce the so-called top view weak PA. Roughly speaking, top view weak PA are weak PA where the…
We survey the problem of deciding the stability or stabilizability of uncertain linear systems whose region of uncertainty is a polytope. This natural setting has applications in many fields of applied science, from Control Theory to…
Nearly linear recurrences are a generalisation of linear recurrences and are instances of linear time-invariant systems in control theory and linear constraint loops in program analysis. In this paper we formulate the Positivity Problem for…
The value 1 problem is a decision problem for probabilistic automata over finite words: are there words accepted by the automaton with arbitrarily high probability? Although undecidable, this problem attracted a lot of attention over the…
We continue the systematic investigation of probabilistic and quantum finite automata (PFAs and QFAs) on promise problems by focusing on unary languages. We show that bounded-error QFAs are more powerful than PFAs. But, in contrary to the…
This paper is a continuation of a previous study on the so-called measure once finite quantum automata model introduced by Moore and Crutchfield in 2000. We investigate conditions assuring that, given a language recognized by such a device…
Let $L_{>\lambda}(\mathcal{A})$ and $L_{\geq\lambda}(\mathcal{A})$ be the languages recognized by {\em measure many 1-way quantum finite automata (MM-QFA)} (or,{\em enhanced 1-way quantum finite automata(EQFA)}) $\mathcal{A}$ with strict…
We introduce first order alternating automata, a generalization of boolean alternating automata, in which transition rules are described by multisorted first order formulae, with states and internal variables given by uninterpreted…