Related papers: On the information-theoretic structure of distribu…
After a brief introduction to the spectral presheaf, which serves as an analogue of state space in the topos approach to quantum theory, we show that every state of the von Neumann algebra of physical quantities of a quantum system…
A method for studying the qualitative dynamical properties of abstract computing machines based on the approximation of their program-size complexity using a general lossless compression algorithm is presented. It is shown that the…
We show that some characteristics of multiply-imaged QSO systems are very model-independent and can be deduced accurately by simply scrutinizing the relative positions of images and galaxy-lens center. These include the time-ordering of the…
Measures of dependence among variables, and measures of information content and shared information have become valuable tools of multi-variable data analysis. Information measures, like marginal entropies, mutual and multi-information, have…
To study discrete dynamical systems of different types --- deterministic, statistical and quantum --- we develop various approaches. We introduce the concept of a system of discrete relations on an abstract simplicial complex and develop…
The modelling and analysis of biological systems has deep roots in Mathematics, specifically in the field of Ordinary Differential Equations. Alternative approaches based on formal calculi, often derived from process algebras or term…
Unsharp quantum measurements provide a resource in scenarios where one faces the trade-off between information gain and disturbance. In this work we introduce a prepare-transform-measure scenario in which two-outcome unsharp measurements…
Account of a system may depend on available methods of gaining information. We discuss a simple discrete system whose description is affected by a specific model of measurement and transformations. It is shown that the limited means of…
The compression of geometric structures is a relatively new field of data compression. Since about 1995, several articles have dealt with the coding of meshes, using for most of them the following approach: the vertices of the mesh are…
We investigate fully self-consistent multiscale quantum-classical algorithms on current generation superconducting quantum computers, in a unified approach to tackle the correlated electronic structure of large systems in both quantum…
Ordered nanoarrays, i.e. regular patterns of quantum structures at the nanometre scale, have recently been synthesized in a wide range of systems. Here I explore a possible route to technological exploitation: assuming a simple form of…
In a previous work arXiv:physics/0611108v2, it was shown that the volume spanned by a molecular system in its conformational space can be effectively bounded by a polyhedral cone, this cone is described by means of a simple combinatorial…
In this paper, we revisit pattern mining and study the distribution underlying a binary dataset thanks to the closure structure which is based on passkeys, i.e., minimum generators in equivalence classes robust to noise. We introduce…
We show that every diffeomorphism with mostly contracting center direction exhibits a geometric-combinatorial structure, which we call \emph{skeleton}, that determines the number, basins and supports of the physical measures. Furthermore,…
Variational quantum algorithms, inspired by neural networks, have become a novel approach in quantum computing. However, designing efficient parameterized quantum circuits remains a challenge. Quantum architecture search tackles this by…
Lab::Measurement is a framework for test and measurement automatization using Perl 5. While primarily developed with applications in mesoscopic physics in mind, it is widely adaptable. Internally, a layer model is implemented. Communication…
Beimel, Tassa and Weinreb (2008) and Farras and Padro (2010) partially characterized access structures of ideal weighted threshold secret sharing schemes in terms of the operation of composition. They classified indecomposable ideal…
A learning algorithm is presented which given the structure of a causal tree, will estimate its link probabilities by sequential measurements on the leaves only. Internal nodes of the tree represent conceptual (hidden) variables…
Partial Information Decomposition (PID) has become one of the most prominent information-theoretic frameworks for describing the structure and quality of information in complex systems. Despite its widespread utility, there exists no unique…
High dimensional and heterogeneous count data are collected in various applied fields. In this paper, we look closely at high-resolution sequencing data on the microbiome, which have enabled researchers to study the genomes of entire…