Related papers: Distinguishability and copiability of programs in …
In the task of discriminating between nonorthogonal quantum states from multiple copies, the key parameters are the error probability and the resources (number of copies) used. Previous studies have considered the task of minimizing the…
This paper addresses decision-aiding problems that involve multiple objectives and uncertain states of the world. Inspired by the capability approach, we focus on cases where a policy maker chooses an act that, combined with a state of the…
We analyze to what extent it is possible to copy arbitrary states of a two-level quantum system. We show that there exists a "universal quantum copying machine", which approximately copies quantum mechanical states in such a way that the…
We present a theory of information expressed solely in terms of which transformations of physical systems are possible and which are impossible - i.e. in constructor-theoretic terms. Although it includes conjectured laws of physics that are…
The impossibility of creating perfect identical copies of unknown quantum systems is a fundamental concept in quantum theory and one of the main non-classical properties of quantum information. This limitation imposed by quantum mechanics,…
We review the problem of discriminating entangled states from separable states for bipartite systems. We formally define what entangled states are, present some important criteria to detect entanglement, and show how they can be classified…
Distinguishability and, by extension, observability are key properties of dynamical systems. Establishing these properties is challenging, especially when no analytical model is available and they are to be inferred directly from…
As a part of the construction of an information theory based on general probabilistic theories, we propose and investigate the several distinguishability measures and "entropies" in general probabilistic theories. As their applications,…
We present an example of quantum computational tasks whose performance is enhanced if we distribute quantum information using quantum cloning. Furthermore we give achievable efficiencies for probabilistic cloning the quantum states used in…
There are fundamental limits to the accuracy with which one can determine the state of a quantum system. I give an overview of the main approaches to quantum state discrimination. Several strategies exist. In quantum hypothesis testing, a…
We discuss two qualities of quantum systems: various correlations existing between their subsystems and the distingushability of different quantum states. This is then applied to analysing quantum information processing. While quantum…
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…
Value independence is enormously beneficial for reasoning about software systems at scale. These benefits carry over into the world of formal verification. Reasoning about programs algebraically is a simple affair in a proof assistant,…
In the present paper we formally define the notion of abstract program slicing, a general form of program slicing where properties of data are considered instead of their exact value. This approach is applied to a language with numeric and…
Computability on uncountable sets has no standard formalization, unlike that on countable sets, which is given by Turing machines. Some of the approaches to define computability in these sets rely on order-theoretic structures to translate…
Abstraction is a fundamental tool for reasoning about complex systems. Program abstraction has been utilized to great effect for analyzing deterministic programs. At the heart of program abstraction is the relationship between a concrete…
Entanglement shared among multiple parties presents complex challenges for the characterisation of different types of entanglement. One of the most fundamental insights is the fact that some mixed states can feature entanglement across…
We solve the long-standing problem of making n perfect clones from m copies of one of two known pure states with minimum failure probability in the general case where the known states have arbitrary a priori probabilities. The solution…
The sequential unambiguous state discrimination (SSD) of two states prepared in arbitrary prior probabilities is studied, and compared with three strategies that allow classical communication. The deviation from equal probabilities…
Although there is a somewhat standard formalization of computability on countable sets given by Turing machines, the same cannot be said about uncountable sets. Among the approaches to define computability in these sets, order-theoretic…