相关论文: Hypergraph min-cuts from quantum entropies
Neural-network quantum states (NQS) have become a powerful tool in many-body physics. Of the numerous possible architectures in which neural-networks can encode amplitudes of quantum states the simplicity of the Restricted Boltzmann Machine…
We show that the von Neumann's algorithm of reduction (i.e. the algorithm of calculating the density matrix of the observable subsystem from the density matrix of the closed quantum system) corresponds to the special approximation at which…
The goal of the paper is to lay the foundation for the qualitative analogue of the classical, quantitative sparse graph limit theory. In the first part of the paper we introduce the qualitative analogues of the Benjamini-Schramm and…
We introduce shortcut graphs and groups. Shortcut graphs are graphs in which cycles cannot embed without metric distortion. Shortcut groups are groups which act properly and cocompactly on shortcut graphs. These notions unify a surprisingly…
Regarding the strange properties of quantum entropy and entanglement, e.g., the negative quantum conditional entropy, we revisited the foundations of quantum entropy, namely, von Neumann entropy, and raised the new method of quantum…
Cuts in graphs are a fundamental object of study, and play a central role in the study of graph algorithms. The problem of sparsifying a graph while approximately preserving its cut structure has been extensively studied and has many…
The Von Neumann entropy of reduced states is a measure of bipartite entanglement. Despite its name, the entanglement entropy cannot by itself be used as a resource for creating thermodynamic heat flows. In order to extract heat from an…
A general method for proving continuity of the von Neumann entropy on subsets of positive trace-class operators is considered. This makes it possible to re-derive the known conditions for continuity of the entropy in more general forms and…
Quantum Geometry (the modern Loop Quantum Gravity using graphs and spin-networks instead of the loops) provides microscopic degrees of freedom that account for the black-hole entropy. However, the procedure for state counting used in the…
We study the minimum cut problem in weighted undirected graphs using variational quantum algorithms in which only feasible cut configurations are explored. Although minimum cut admits efficient classical solutions, it is a fundamental…
In this paper we study fundamental connectivity properties of hypergraphs from a graph-theoretic perspective, with the emphasis on cut edges, cut vertices, and blocks. To prepare the ground, we define various types of subhypergraphs, as…
We study the holographic properties of a class of quantum geometry states characterized by a superposition of discrete geometric data, in the form of generalised tensor networks. This class specifically includes spin networks, the kinematic…
We discuss the construction of $n$-qubit pure states with maximum bipartite entanglement across all possible choices of $k$ vs $n-k$ bi-partitioning, which implies that the Von Neumann entropy of every $k$-qubit reduced density matrix…
Minimum-weight cut (min-cut) is a basic measure of a network's connectivity strength. While the min-cut can be computed efficiently in the sequential setting [Karger STOC'96], there was no efficient way for a distributed network to compute…
We interpret the Holographic Conjecture in terms of quantum bits (qubits). N-qubit states are associated with surfaces that are punctured in N points by spin networks' edges labeled by the spin-1/2 representation of SU(2), which are in a…
We study the entropy of small subsystems in thermalizing quantum many-body systems governed by local Hamiltonians. Assuming the eigenstate thermalization hypothesis, we derive an analytical formula for the von Neumann entropy of…
Over all graphs (or unicyclic graphs) of a given order, we characterise those graphs that minimise or maximise the number of connected induced subgraphs. For each of these classes, we find that the graphs that minimise the number of…
We introduce the Hidden Polynomial Function Graph Problem as a natural generalization of an abelian Hidden Subgroup Problem (HSP) where the subgroups and their cosets correspond to graphs of linear functions over the finite field F_p. For…
We characterize the quantum states dual to entanglement wedges in arbitrary spacetimes, in settings where the matter entropy can be neglected compared to the geometric entropy. In AdS/CFT, such states obey special entropy inequalities known…
In supersymmetric grand unified theories, the gauge hierarchy achieved by a fine-tuning in the superpotential can be violated in the presence of soft breaking terms. We examine this problem in Einstein supergravity with hidden-sector…