Related papers: A Generalized Statistical Complexity Measure: Appl…
We develop a quantum topological data analysis (QTDA) protocol based on the estimation of the density of states (DOS) of the combinatorial Laplacian. Computing topological features of graphs and simplicial complexes is crucial for analyzing…
This thesis aims to establish notions of symmetry for quantum states and channels as well as describe algorithms to test for these properties on quantum computers. Ideally, the work will serve as a self-contained overview of the subject. We…
It has been shown that one can accommodate data (Bayes) and constraints (MaxEnt) in one method, the method of Maximum (relative) Entropy (ME) (Giffin 2007). In this paper we show a complex agent based example of inference with two different…
Recently it has been argued that entropy can be a direct measure of complexity, where the smaller value of entropy indicates lower system complexity, while its larger value indicates higher system complexity. We dispute this view and…
We summarize recent work showing that the $1/r^2$ model of interacting particles in 1-dimension is a universal Hamiltonian for quantum chaotic systems. The problem is analyzed in terms of random matrices and of the evolution of their…
The Gram matrix of a set of quantum pure states plays key roles in quantum information theory. It has been highlighted that the Gram matrix of a pure-state ensemble can be viewed as a quantum state, and the quantumness of a pure-state…
The electronic density \rho(r) in atoms, molecules and solids is, in general, a distribution that can be observed experimentally, containing spatial information projected from the total wave function. These density distributions can be…
The random matrix ensembles (RME) of quantum statistical Hamiltonian operators, e.g. Gaussian random matrix ensembles (GRME) and Ginibre random matrix ensembles (Ginibre RME), are applied to following quantum statistical systems: nuclear…
This paper presents and discusses the use of a new feature for PolSAR imagery: the Generalized Statistical Complexity. This measure is able to capture the disorder of the data by means of the entropy, as well as its departure from a…
Superstatistics describes statistical systems that behave like superpositions of different inverse temperatures $\beta$, so that the probability distribution is $p(\epsilon_i) \propto \int_{0}^{\infty} f(\beta) e^{-\beta \epsilon_i}d\beta$,…
Solving polynomial systems arising from applications is frequently made easier by the structure of the systems. Weighted homogeneity (or quasi-homogeneity) is one example of such a structure: given a system of weights…
A practical measure for the complexity of sequences of symbols (``strings'') is introduced that is rooted in automata theory but avoids the problems of Kolmogorov-Chaitin complexity. This physical complexity can be estimated for ensembles…
The so-called quantum measurement problems are solved from a new perspective. One of the main observations is that the basic entities of our world are {\it particles}, elementary or composite. It follows that each elementary process, hence…
In these notes we will give an overview and road map for a definition and characterization of (relative) entropy for both classical and quantum systems. In other words, we will provide a consistent treatment of entropy which can be applied…
We present a general method for calculating R\'enyi entropies in the ground state of a one-dimensional critical system with mixed open boundaries, for an interval starting at one of its ends. In the conformal field theory framework, this…
We study the problem of detecting the structure of a complex dynamical system described by a set of deterministic differential equation that contains a Hamiltonian subsystem, without any information on the explicit form of evolution laws.…
Complex systems are characterised by a tight, nontrivial interplay of their constituents, which gives rise to a multi-scale spectrum of emergent properties. In this scenario, it is practically and conceptually difficult to identify those…
In Nielsen's geometric approach to quantum complexity, the introduction of a suitable geometrical space, based on the Lie group formed by fundamental operators, facilitates the identification of complexity through geodesic distance in the…
Quantitative characterization of different entanglement detection criteria for bipartite systems is presented. We review the implication sequence of these criteria and then numerically estimate volume ratios between criteria non-violating…
This paper presents a series of general properties of the r-Complexity calculus, a complexity measurement for assessing the performance and asymptotic behaviour of real-world algorithms. This research describes characteristics such as…