Related papers: Towards a complete classification of holographic e…
We reveal a complete set of constraints that need to be imposed on a set of 3-by-3 matrices to ensure that the matrices represent genuine homographies associated with multiple planes between two views. We also show how to exploit the…
It has been known for some years that entanglement entropy obtained from partial trace does not provide the correct entanglement measure when applied to systems of identical particles. Several criteria have been proposed that have the…
Image forensics has become increasingly crucial in our daily lives. Among various types of forgeries, copy-move forgery detection has received considerable attention within the academic community. Keypoint-based algorithms, particularly…
A novel matching based heuristic algorithm designed to detect specially formulated infeasible zero-one IPs is presented. The algorithm input is a set of nested doubly stochastic subsystems and a set E of instance defining variables set at…
We study entanglement entropies of simply connected surfaces in field theories dual to Lovelock gravities. We consider Gauss-Bonnet and cubic Lovelock gravities in detail. In the conformal case the logarithmic terms in the entanglement…
We show that every holographic entropy inequality can be recast in the form: "some entanglement wedges reach deeper in the bulk than some other entanglement wedges." When the inequality is saturated, the two sets of wedges reach equally…
The Graph Isomorphism problem has both theoretical and practical interest. In this paper we present an algorithm, called conauto-1.2, that efficiently tests whether two graphs are isomorphic, and finds an isomorphism if they are. This…
In this article, we review recent progresses on the holographic understandings of the entanglement entropy in the AdS/CFT correspondence. After reviewing the general idea of holographic entanglement entropy, we will explain its applications…
Low-contrast image enhancement is essential for high-quality image display and other visual applications. However, it is a challenging task as the enhancement is expected to increase the visibility of an image while maintaining its…
It was recently found that the stabilizer and hypergraph entropy cones coincide for four parties, leading to a conjecture of their equivalence at higher party numbers. In this note, we show this conjecture to be false by proving new…
Graph-structured data is central to many scientific and industrial domains, where the goal is often to optimize objectives defined over graph structures. Given the combinatorial complexity of graph spaces, such optimization problems are…
We derive some integral inequalities for holomorphic maps between complex manifolds. As applications, some rigidity and degeneracy theorems for holomorphic maps without assuming any pointwise curvature signs for both the domain and target…
In this article, we establish a mathematical framework that utilizes concepts from graph theory to formalize the parity transformation, an encoding strategy for compiling optimization problems on quantum devices. We introduce the…
Entanglement entropy is a useful probe of compressible quantum matter because it can detect the existence of Fermi surfaces, both of microscopic fermionic degrees of freedom and of "hidden" gauge charged fermions. Much recent attention has…
In this letter we define a natural generalization of the von Neumann entropy to multiple parties that is symmetric with respect to all the parties. We call this measure multi-entropy. We show that for conformal field theories with…
The dichotomy conjecture for the parameterized embedding problem states that the problem of deciding whether a given graph $G$ from some class $K$ of "pattern graphs" can be embedded into a given graph $H$ (that is, is isomorphic to a…
We present an algorithm that, given a channel, determines if there is a distance for it such that the maximum likelihood decoder coincides with the minimum distance decoder. We also show that any metric, up to a decoding equivalence, can be…
We address the question of whether holographic entropy inequalities obeyed in static states (by the RT formula) are always obeyed in time-dependent states (by the HRT formula), focusing on the case where the bulk spacetime is 2+1…
Measuring the complexity of high-dimensional data in physical systems becomes a critical factor in determining the information and quality of the systems. However, traditional metrics, such as Lyapunov exponent, fractal dimension, and…
We introduce the notion of an interpolating path on the set of probability measures on finite graphs. Using this notion, we first prove a displacement convexity property of entropy along such a path and derive Prekopa-Leindler type…