Related papers: Distinguishability and copiability of programs in …
A set of quantum states can be unambiguously discriminated if and only if they are linearly independent. However, for a linearly dependent set, if C copies of the state are available, then the resulting C particle states may form a linearly…
We introduce a general analytic approach to the study of factorization points and factorized ground states in quantum cooperative systems. The method allows to determine rigorously existence, location, and exact form of separable ground…
Cluster analysis is a popular unsupervised learning tool used in many disciplines to identify heterogeneous sub-populations within a sample. However, validating cluster analysis results and determining the number of clusters in a data set…
Nonseparability - multipartite states that cannot be factorized - is one of the most striking features of quantum mechanics, as it gives rise to entanglement and non-causal correlations. In quantum computing, it also contributes directly to…
This paper introduces abstractions that are meaningful for computers and that can be built and used according to computers' own criteria, i.e., computable abstractions. It is analyzed how abstractions can be seen to serve as the building…
In this article I propose an approach for defining replicability for prediction rules. Motivated by a recent NAS report, I start from the perspective that replicability is obtaining consistent results across studies suitable to address the…
For systems consisting of distinguishable particles, there exists an agreed upon notion of entanglement which is fundamentally based on the possibility of addressing individually each one of the constituent parties. Instead, the…
Determining whether a quantum state is separable or entangled is a problem of fundamental importance in quantum information science. It has recently been shown that this problem is NP-hard. There is a highly inefficient `basic algorithm'…
To understand and explain process behaviour we need to be able to see it, and decide its significance, i.e. be able to tell a story about its behaviours. This paper describes a few of the modelling challenges that underlie monitoring and…
Indifferentiability is a popular cryptographic paradigm for analyzing the security of ideal objects -- both in a classical as well as in a quantum world. It is typically stated in the form of a composable and simulation-based definition,…
We indicate a way of distinguishing between structures, for which, we call two structures distinguishable. Roughly, being distinguishable means that they differ in the number of realizations each gives for some formula. Being…
We start by an introduction to the basic concepts of computability theory and the introduction of the concept of Turing machine and computation universality. Then se turn to the exploration of trade-offs between different measures of…
Theoretical computer science discusses foundational issues about computations. It asks and answers questions such as "What is a computation?", "What is computable?", "What is efficiently computable?","What is information?", "What is…
There exist applications of reinforcement learning like medicine where policies need to be ''interpretable'' by humans. User studies have shown that some policy classes might be more interpretable than others. However, it is costly to…
The notions of $k$-separability and $k$-producibility are useful and expressive tools for the characterization of entanglement in multipartite quantum systems, when a more detailed analysis would be infeasible or simply needless. In this…
Physical processes are computations only when we use them to externalize thought. Computation is the performance of one or more fixed processes within a contingent environment. We reformulate the Church-Turing thesis so that it applies to…
Consider a situation in which a quantum system is secretly prepared in a state chosen from the known set of states. We present a principle that gives a definite distinction between the operations that preserve the states of the system and…
A number of noncontextual models exist which reproduce different subsets of quantum theory and admit a no-cloning theorem. Therefore, if one chooses noncontextuality as one's notion of classicality, no-cloning cannot be regarded as a…
Can free agency be compatible with determinism? Compatibilists argue that the answer is yes, and it has been suggested that the computer science principle of "computational irreducibility" sheds light on this compatibility. It implies that…
Quantifying how distinguishable two stochastic processes are lies at the heart of many fields, such as machine learning and quantitative finance. While several measures have been proposed for this task, none have universal applicability and…