Related papers: The holographic entropy arrangement
We compute the set of all extreme rays of the 6-party subadditivity cone that are compatible with strong subadditivity. In total, we identify 208 new (genuine 6-party) orbits, 52 of which violate at least one known holographic entropy…
The complicated ways in which electrons interact in many-body systems such as molecules and materials have long been viewed through the lens of local electron correlation and associated correlation functions. However, quantum information…
The Markov gap, defined as the difference between reflected entropy and mutual information, serves as a diagnostic for quantum recoverability and multipartite entanglement. In holographic settings, it admits a geometric interpretation as…
We investigate the entanglement entropy of a two-dimensional disordered system holographically. In particular, we study the evolution of the entanglement entropy along renormalization group flows for a conformal theory at the UV fixed…
When a quantum system is divided into subsystems, their entanglement entropies are subject to an inequality known as "strong subadditivity". For a field theory this inequality can be stated as follows: given any two regions of space $A$ and…
Here we show the connection between topological order and the geometric entanglement, as measured by the logarithm of the overlap between a given state and its closest product state of blocks, for the topological universality class of the…
Finding inherent or processed links within a dataset allows to discover potential knowledge. The main contribution of this article is to define a global framework that enables optimal knowledge discovery by visually rendering co-occurences…
Recently, several notions of entanglement in time have emerged as a novel frontier in quantum many-body physics, quantum field theory and gravity. We propose a systematic prescription to characterize temporal entanglement in relativistic…
Hypergraph partitioning is an important problem in machine learning, computer vision and network analytics. A widely used method for hypergraph partitioning relies on minimizing a normalized sum of the costs of partitioning hyperedges…
We investigate the self-organization of point-particles with short-range interactions modeled via simple 1D and 2D Hubbard-like models. We show how various properties emerge such as, boson-like ordering leading to topological structures in…
We show how to quantify tri-partite entanglement using entropies derived from experimental correlations. We use a multi-partite generalization of the entanglement of formation that is greater than zero if and only if the state is genuinely…
This paper investigates the entanglement entropy inequality and explores the presentation of mutual information and conditional mutual information in kinematic space. Specifically, we examine the regions within kinematic space responsible…
We show that multipartite entanglement can be used as an efficient way of identifying the critical points of 1+1D systems. We demonstrate this with the quantum Ising model, lattice $\lambda \phi^4$ approximated with qutrits, and arrays of…
Hypergraphs, increasingly utilised for modelling complex and diverse relationships in modern networks, gain much attention representing intricate higher-order interactions. Among various challenges, cohesive subgraph discovery is one of the…
Graphs serve as powerful tools for modeling pairwise interactions in diverse fields such as biology, material science, and social networks. However, they inherently overlook interactions involving more than two entities. Simplicial…
Learning embeddings of entities and relations is an efficient and versatile method to perform machine learning on relational data such as knowledge graphs. In this work, we propose holographic embeddings (HolE) to learn compositional vector…
Entanglement entropies have revealed, in the last years, to be a powerful tool to extract information about the physics of condensed-matter systems. In the first part of this thesis, we show how to extract essential details about the…
This paper proposes an embedding method for co-occurrence data aimed at visual information exploration. We consider cases where co-occurrence probabilities are measured between pairs of elements from heterogeneous domains. The proposed…
We introduce several classes of quantum combinatorial designs, namely quantum Latin squares, cubes, hypercubes and a notion of orthogonality between them. A further introduced notion, quantum orthogonal arrays, generalizes all previous…
We continue the study of the quantum marginal independence problem, namely the question of which faces of the subadditivity cone are achievable by quantum states. We introduce a new representation of the patterns of marginal independence…